Abstract is missing.
- Subrecursive Program Schemata I & II: I. Undecidable Equivalence Problems; II. Decidable Equivalence ProblemsRobert L. Constable, Steven S. Muchnick. 1-17
- Characterization of Flowchartable Recursions (Short Version)S. A. Walker, H. Raymond Strong. 18-34
- Recursion Schemes with ListsJames H. Morris Jr.. 35-43
- Flowchart Schemata with CountersDavid A. Plaisted. 44-51
- Program Schemas with EqualityAshok K. Chandra, Zohar Manna. 52-64
- On the Equivalence of SchemesStephen J. Garland, David C. Luckham. 65-72
- Time-Bounded Random Access MachinesStephen A. Cook, Robert A. Reckhow. 73-80
- Predecessor Machines and Regressing FunctionsJohn C. Warkentin, Patrick C. Fischer. 81-87
- Polynomial Evaluation via the Division Algorithm: The Fast Fourier Transform RevisitedCharles M. Fiduccia. 88-93
- On the Additions Necessary to Compute Certain FunctionsDavid G. Kirkpatrick. 94-101
- A Bound on the Multiplication Efficiency of IterationH. T. Kung. 102-107
- Algorithms for Rational Function Arithmetic OperationsEllis Horowitz. 108-118
- Linear Time Bounds for Median ComputationsManuel Blum, Robert W. Floyd, Vaughan R. Pratt, Ronald L. Rivest, Robert Endre Tarjan. 119-124
- Rapid Identification of Repeated Patterns in Strings, Trees and ArraysRichard M. Karp, Raymond E. Miller, Arnold L. Rosenberg. 125-136 [doi]
- Binary Search Trees of Bounded BalanceJürg Nievergelt, Edward M. Reingold. 137-142
- Worst-Case Analysis of Memory Allocation AlgorithmsM. R. Garey, Ronald L. Graham, Jeffrey D. Ullman. 143-150
- Maze Recognizing Automata (Extended Abstract)Walter J. Savitch. 151-156
- Turing Machines and the Spectra of First-Order Formulas with EqualityNeil D. Jones, Alan L. Selman. 157-167
- The Process Complexity and Effective Random TestsClaus-Peter Schnorr. 168-176
- The Computation of Finite FunctionsD. M. Symes. 177-182
- Program Size and Economy of Descriptions: Preliminary ReportAlbert R. Meyer, A. Bagchi. 183-186
- A Hierarchy for Nondeterministic Time ComplexityStephen A. Cook. 187-192
- A Patent Problem for Abstract Programming Languages: Machine-Independent ComputationsRichard G. Hamlet. 193-197
- Compositions of n Tree TransducersWilliam F. Ogden, William C. Rounds. 198-206
- Uniformly Erasable AFLSheila Carlyle-Greibach, Seymour Ginsburg, Jonathan Goldstine. 207-213
- Developmental Systems and LanguagesAristid Lindenmayer, Grzegorz Rozenberg. 214-221
- Validating Register Allocations for Straight Line ProgramsRavi Sethi. 222-237
- Flow Graph ReducibilityMatthew S. Hecht, Jeffrey D. Ullman. 238-250
- A Technique for Speeding Up LR(k) ParsersAlfred V. Aho, Jeffrey D. Ullman. 251-263