Conferences in DBLP
Robert L. Constable , Steven S. Muchnick Subrecursive Program Schemata I & II: I. Undecidable Equivalence Problems; II. Decidable Equivalence Problems [Citation Graph (0, 0)][DBLP ] Conf ] S. A. Walker , H. Raymond Strong Characterization of Flowchartable Recursions (Short Version) [Citation Graph (0, 0)][DBLP ] Conf ] James H. Morris Jr. Recursion Schemes with Lists [Citation Graph (0, 0)][DBLP ] Conf ] David A. Plaisted Flowchart Schemata with Counters [Citation Graph (0, 0)][DBLP ] Conf ] Ashok K. Chandra , Zohar Manna Program Schemas with Equality [Citation Graph (0, 0)][DBLP ] Conf ] Stephen J. Garland , David C. Luckham On the Equivalence of Schemes [Citation Graph (0, 0)][DBLP ] Conf ] Stephen A. Cook , Robert A. Reckhow Time-Bounded Random Access Machines [Citation Graph (0, 0)][DBLP ] Conf ] John C. Warkentin , Patrick C. Fischer Predecessor Machines and Regressing Functions [Citation Graph (0, 0)][DBLP ] Conf ] Charles M. Fiduccia Polynomial Evaluation via the Division Algorithm: The Fast Fourier Transform Revisited [Citation Graph (0, 0)][DBLP ] Conf ] David G. Kirkpatrick On the Additions Necessary to Compute Certain Functions [Citation Graph (0, 0)][DBLP ] Conf ] H. T. Kung A Bound on the Multiplication Efficiency of Iteration [Citation Graph (0, 0)][DBLP ] Conf ] Ellis Horowitz Algorithms for Rational Function Arithmetic Operations [Citation Graph (0, 0)][DBLP ] Conf ] Manuel Blum , Robert W. Floyd , Vaughan R. Pratt , Ronald L. Rivest , Robert Endre Tarjan Linear Time Bounds for Median Computations [Citation Graph (0, 0)][DBLP ] Conf ] Richard M. Karp , Raymond E. Miller , Arnold L. Rosenberg Rapid Identification of Repeated Patterns in Strings, Trees and Arrays [Citation Graph (2, 0)][DBLP ] Conf ] Jürg Nievergelt , Edward M. Reingold Binary Search Trees of Bounded Balance [Citation Graph (0, 0)][DBLP ] Conf ] M. R. Garey , Ronald L. Graham , Jeffrey D. Ullman Worst-Case Analysis of Memory Allocation Algorithms [Citation Graph (0, 0)][DBLP ] Conf ] Walter J. Savitch Maze Recognizing Automata (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Neil D. Jones , Alan L. Selman Turing Machines and the Spectra of First-Order Formulas with Equality [Citation Graph (0, 0)][DBLP ] Conf ] Claus-Peter Schnorr The Process Complexity and Effective Random Tests [Citation Graph (0, 0)][DBLP ] Conf ] D. M. Symes The Computation of Finite Functions [Citation Graph (0, 0)][DBLP ] Conf ] Albert R. Meyer , A. Bagchi Program Size and Economy of Descriptions: Preliminary Report [Citation Graph (0, 0)][DBLP ] Conf ] Stephen A. Cook A Hierarchy for Nondeterministic Time Complexity [Citation Graph (1, 0)][DBLP ] Conf ] Richard G. Hamlet A Patent Problem for Abstract Programming Languages: Machine-Independent Computations [Citation Graph (0, 0)][DBLP ] Conf ] William F. Ogden , William C. Rounds Compositions of n Tree Transducers [Citation Graph (0, 0)][DBLP ] Conf ] Sheila Carlyle-Greibach , Seymour Ginsburg , Jonathan Goldstine Uniformly Erasable AFL [Citation Graph (0, 0)][DBLP ] Conf ] Aristid Lindenmayer , Grzegorz Rozenberg Developmental Systems and Languages [Citation Graph (0, 0)][DBLP ] Conf ] Ravi Sethi Validating Register Allocations for Straight Line Programs [Citation Graph (0, 0)][DBLP ] Conf ] Matthew S. Hecht , Jeffrey D. Ullman Flow Graph Reducibility [Citation Graph (0, 0)][DBLP ] Conf ] Alfred V. Aho , Jeffrey D. Ullman A Technique for Speeding Up LR(k) Parsers [Citation Graph (0, 0)][DBLP ] Conf ] 