Abstract is missing.
- Complexity Measures and Hierarchies for the Evaluation of Integers, Polynomials, and n-linear FormsRichard J. Lipton, David P. Dobkin. 1-5
- A Generalization and Proof of the Aanderaa-Rosenberg ConjectureRonald L. Rivest, Jean Vuillemin. 6-11
- The Complexity of Parallel Evaluation of Linear RecurrenceLaurent Hyafil, H. T. Kung. 12-22
- On Computing the Minima of Quadratic Forms (Preliminary Report)Andrew Chi-Chih Yao. 23-26
- A 2.5 n-lower Bound on the Combinatorial Complexity of Boolean FunctionsWolfgang J. Paul. 27-36
- Lower Bounds on the Size of Boolean Formulas: Preliminary ReportMichael J. Fischer, Albert R. Meyer, Mike Paterson. 37-44
- On Non-linear Lower Bounds in Computational ComplexityLeslie G. Valiant. 45-53
- On the Complexity of Grammar and Related ProblemsHarry B. Hunt III, Thomas G. Szymanski. 54-65
- a Combinatorial Problem which is Complete in Polynomial SpaceShimon Even, Robert Endre Tarjan. 66-71
- On the Validity and Complexity of Bounded ResolutionZvi Galil. 72-82
- Feasibly Constructive Proofs and the Propositional Calculus (Preliminary Version)Stephen A. Cook. 83-97
- Computability Concepts for Programming Language SemanticsHerbert Egli, Robert L. Constable. 98-106
- Proving Assertions about Programs that Manipulate Data StructuresDerek C. Oppen, Stephen A. Cook. 107-116
- On (Un)predictability of Formal Languages (Extended Abstract)Andrzej Ehrenfeucht, Grzegorz Rozenberg. 117-120
- On Decomposing Languages Defined by Parallel DevicesSven Skyum. 121-125
- Intercalation Theorems for Tree Transducer LanguagesC. Raymond Perrault. 126-136
- On the (Combinatorial) Structure of L Languages without InteractionsAndrzej Ehrenfeucht, Grzegorz Rozenberg. 137-144
- Degree-Languages, Polynomial Time Recognition, and the LBA ProblemDetlef Wotschke. 145-152
- Comparative Complexity of Grammar FormsSeymour Ginsburg, Nancy A. Lynch. 153-158
- Hashing Schemes for Extendible Arrays (Extended Arrays)Arnold L. Rosenberg, Larry J. Stockmeyer. 159-166
- Four Models for the Analysis of Optimization of Program Control StructuresTerrence W. Pratt. 167-176
- Node Listings for Reducible Flow GraphsAlfred V. Aho, Jeffrey D. Ullman. 177-185
- The Complexity of Control Structures and Data StructuresRichard J. Lipton, Stanley C. Eisenstat, Richard A. DeMillo. 186-193
- The Optimal Fixedpoint of Recursive ProgramsZohar Manna, Adi Shamir. 194-206
- Optimal Code Generation for Expression TreesAlfred V. Aho, Stephen C. Johnson. 207-217
- On the Complexity of the Extended String-to-String Correction ProblemRobert A. Wagner. 218-223
- Geometric ComplexityMichael Ian Shamos. 224-233
- Riemann s Hypothesis and Tests for PrimalityGary L. Miller. 234-239
- Two Applications of a Probabilistic Search Technique: Sorting x + y and Building Balanced Search TreesMichael L. Fredman. 240-244
- Algorithmic Aspects of Vertex EliminationDonald J. Rose, Robert Endre Tarjan. 245-254
- Linear Algorithms to Recognize Interval Graphs and Test for the Consecutive Ones PropertyKellogg S. Booth, George S. Lueker. 255-265