Abstract is missing.
- The Effect of the Field of Constants on the Number of MultiplicationShmuel Winograd. 1-2
- The Exact Time Required to Perform Generalized AdditionRobert W. Floyd. 3-5
- Polynomials with 0-1 Coefficients that Are Hard to EvaluateRichard J. Lipton. 6-10
- Fast Parallel Matrix Inversion AlgorithmsL. Csanky. 11-12
- Parallel Computations in Graph TheoryEshrat Arjomandi, Derek G. Corneil. 13-18
- Synchronization and Computing Capabilities of Linear Asynchronous StructuresRichard J. Lipton, Raymond E. Miller, Lawrence Snyder. 19-28
- Flow of Control in the Proof Theory of Structured ProgrammingJ. W. de Bakker. 29-33
- Bases for Chain-Complete PosetsGeorge Markowsky, Barry K. Rosen. 34-47
- Correct Computation Rules for Recursive Languages (Extended Abstract)Peter J. Downey, Ravi Sethi. 48-56
- On Time versus Space and Related ProblemsJohn E. Hopcroft, Wolfgang J. Paul, Leslie G. Valiant. 57-64
- A Note on Tape Bounds for SLA Language ProcessingJuris Hartmanis, Leonard Berman. 65-70
- Minimean Optimality in Sorting AlgorithmsIra Pohl. 71-74
- Preserving Order in a Forest in less than Logarithmic TimePeter van Emde Boas. 75-84
- On the Complexity of Comparison Problems using Linear Functions (Preliminary Report)Andrew Chi-Chih Yao. 85-89
- Evaluating Relational Expressions with Dense and Sparse ArgumentsThomas G. Szymanski, Jeffrey D. Ullman. 90-97
- On the Decision Tree Complexity of the Shortest Path ProblemsMichael L. Fredman. 98-99
- An O(n^2.5) Algorithm for Maximum Matching in General GraphsShimon Even, Oded Kariv. 100-112
- Information Theory and the Complexity of Switching Networks (Preliminary Version)Nicholas Pippenger. 113-118
- The Effect of Basis on Size of Boolean ExpressionsVaughan R. Pratt. 119-121
- Economy of Descriptions by Parsers, DPDA s, and PDA sMatthew M. Geller, Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman. 122-127
- An Improvement of Valiant s Decision Procedure for Equivalence of Deterministic Finite-Turn Pushdown AutomataCatriel Beeri. 128-134
- A Grammatical Characterization of Exponential-Time LanguagesWilliam C. Rounds. 135-143
- Decidability of Equivalence, Containment, Intersection, and Separability of Context-Free Languages (Extended Abstract)Harry B. Hunt III, J. L. Rangel. 144-150
- Closest-Point ProblemsMichael Ian Shamos, Dan Hoey. 151-162
- An Optimal Bound for Two Dimensional Bin PackingDaniel J. Kleitman, Michael M. Krieger. 163-168
- Computational Complexity of Decision Procedures for Polynomials (Extended Abstract)Leonard M. Adleman, Kenneth L. Manders. 169-177
- An Application of Graph Coloring to Printed Circuit Testing (Working Paper)M. R. Garey, David S. Johnson, H. C. So. 178-183
- On the Complexity of Timetable and Multi-Commodity Flow ProblemsShimon Even, Alon Itai, Adi Shamir. 184-193