Abstract is missing.
- A Two-Dimensional Generating System Modeling Growth by Binary Cell Division (Preliminary Report)Jack W. Carlyle, Sheila A. Greibach, Azaria Paz. 1-12
- On the Power of Multiplication in Random Access MachinesJuris Hartmanis, Janos Simon. 13-23
- The Equivalence Problem for Regular Expressions over one Letter Is ElementaryJosé Lucas Rangel. 24-27
- P-Complete Problems and Approximate SolutionsSartaj Sahni, Teofilo F. Gonzalez. 28-32
- Approximate Algorithms for the Traveling Salesperson ProblemDaniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II. 33-42
- Relationships between Monadic Recursion Schemes and Deterministic Context-Free LanguagesEmily P. Friedman. 43-51
- Recursive Schemes, Algebraic Trees and Deterministic LanguagesBruno Courcelle. 52-62
- Initial Algebra SemanticsJoseph A. Goguen, James W. Thatcher. 63-77
- Axiomatic Equivalence of Programs with Structured VariablesChristoph M. Hoffmann, Lawrence H. Landweber. 78-83
- Ianov Schemas Augmented by a Pushdown MemoryNobuki Tokura, Tadao Kasami, Shukichi Furuta. 84-94
- On Hash-Coding Algorithms for Partial-Match Retrieval (Extended Abstract)Ronald L. Rivest. 95-103
- Bounds on the Complexity of the Longest Common Subsequence Problem (Extended Abstract)Alfred V. Aho, Daniel S. Hirschberg, Jeffrey D. Ullman. 104-109
- Bounds on Selection NetworksAndrew Chi-Chih Yao. 110-116
- On the Computational Complexity of Finding the Maxima of a Set of VectorsH. T. Kung. 117-121
- On Self-Organizing Sequential Search HeuristicsRonald L. Rivest. 122-126
- Operations on Sparse Relations and Efficient Algorithms for Grammar Problems (Extended Abstract)Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman. 127-132
- Minimization of Fanout in Switching NetworksJohn P. Hayes. 133-139
- Combinational Complexity of Some Monotone FunctionsEdmund A. Lamagna, John E. Savage. 140-144
- A Comparative Study of Models of Parallel ComputationRichard J. Lipton, Lawrence Snyder, Yechezkel Zalcstein. 145-155
- The Recursive Equivalence of the Reachability Problem and the Liveness Problem for Petri Nets and Vector Addition SystemsMichel Hack. 156-164
- Non-Complex Sequences: Characterizations and ExamplesRobert P. Daley. 165-169
- Two Way Deterministic Pushdown Automaton Languages and Some Open Problems in the Theory of ComputationZvi Galil. 170-177
- Natural Properties of Flowchart Complexity MeasuresTheodore P. Baker. 178-184
- Skeletal LR ParsingAlan J. Demers. 185-198
- Characterization of Context-Free Grammatical FamiliesArmin B. Cremers, Seymour Ginsburg. 199-204
- On Boolean Functions Having Maximal Number of Subfunction ClassesPawel Kerntopf. 205-211