Abstract is missing.
- Linear Pattern Matching AlgorithmsPeter Weiner. 1-11
- Efficient Algorithms for Determining an Extremal Tree of a Graph (Extended Abstract)Tiko Kameda, S. Toida. 12-15
- Efficient Compilation of Linear Recursive ProgramsAshok K. Chandra. 16-25
- Equivalence Problems in Monadic Recursion SchemesEmily P. Friedman. 26-33
- Mechanizable Proofs about Parallel ProcessesJ. M. Cadiou, Jean-Jacques Lévy. 34-48
- Chow Parameters in Pseudothreshold LogicC. R. Baugh. 49-55
- On Multiple Input Change Hazard-Free Combinatorial Switching Circuits without FeedbackJon G. Bredeson. 56-63
- Multiple-Input Change Asynchronous Machines Using Controlled Excitation and Flip-FlopsHenry Y. H. Chuang, Santanu Das. 64-69
- On Lower Bounds for Computing the i-th Largest ElementVaughan R. Pratt, Foong Frances Yao. 70-81
- On Finding and Updating Shortest Paths and Spanning TreesPhilip M. Spira, A. Pan. 82-84
- Statistical Indicators of OptimalitySam Savage. 85-91
- On the Optimal Evaluation of a Set of n-Linear FormsDavid P. Dobkin. 92-102
- Characterizations of LR(0) Languages (Extended Abstract)Matthew M. Geller, Michael A. Harrison. 103-108
- On the Ability to Cover LR(k) Grammars with LR(1), SLR(1), and (1,1) Bounded-Context GrammarsM. Dennis Mickunas, Victor B. Schneider. 109-121
- Non-Canonical ParsingThomas G. Szymanski, John H. Williams. 122-129
- Refinements of the Nondeterministic Time and Space HierarchiesJoel I. Seiferas, Michael J. Fischer, Albert R. Meyer. 130-137
- On Tape-Bounded Complexity Classes and Multi-Head Finite AutomataIvan Hal Sudborough. 138-144
- Complexity of Recognition in Intermediate-Level LanguagesWilliam C. Rounds. 145-158
- Automatic Theorem-Proving and the Decision ProblemWilliam H. Joyner Jr.. 159-166
- Graph-Grammars: An Algebraic ApproachHartmut Ehrig, Michael Pfender, Hans Jürgen Schneider. 167-180
- A Notion of Helping and Pseudo-Complementation in Lattices of Honest Subrecursive ClassesMichael Machtey. 181-189
- On the Size of Sets of Computable FunctionsKurt Mehlhorn. 190-196
- Optimization among Provably Equivalent Programs (Preliminary Abstract)Paul Young. 197-199
- Inductive Inference: A Recursion Theoretic ApproachLenore Blum, Manuel Blum. 200-208
- The Complexity of Some Non-Classical LogicsJohn C. Cherniavsky. 209-213