7. STOC 1975: Albuquerque, New Mexico, USA
- William C. Rounds, Nancy Martin, Jack W. Carlyle, Michael A. Harrison:
Proceedings of the 7th Annual ACM Symposium on Theory of Computing, May 5-7, 1975, Albuquerque, New Mexico, USA. ACM 1975 - Richard J. Lipton, David P. Dobkin:
Complexity Measures and Hierarchies for the Evaluation of Integers, Polynomials, and n-linear Forms. 1-5 - Ronald L. Rivest, Jean Vuillemin:
A Generalization and Proof of the Aanderaa-Rosenberg Conjecture. 6-11 - Michael J. Fischer, Albert R. Meyer, Mike Paterson:
Lower Bounds on the Size of Boolean Formulas: Preliminary Report. 37-44 - Shimon Even, Robert Endre Tarjan:
a Combinatorial Problem which is Complete in Polynomial Space. 66-71 - Stephen A. Cook:
Feasibly Constructive Proofs and the Propositional Calculus (Preliminary Version). 83-97 - Herbert Egli, Robert L. Constable:
Computability Concepts for Programming Language Semantics. 98-106 - Derek C. Oppen, Stephen A. Cook:
Proving Assertions about Programs that Manipulate Data Structures. 107-116 - Andrzej Ehrenfeucht, Grzegorz Rozenberg:
On (Un)predictability of Formal Languages (Extended Abstract). 117-120 - Andrzej Ehrenfeucht, Grzegorz Rozenberg:
On the (Combinatorial) Structure of L Languages without Interactions. 137-144 - Arnold L. Rosenberg, Larry J. Stockmeyer:
Hashing Schemes for Extendible Arrays (Extended Arrays). 159-166 - Terrence W. Pratt:
Four Models for the Analysis of Optimization of Program Control Structures. 167-176 - Richard J. Lipton, Stanley C. Eisenstat, Richard A. DeMillo:
The Complexity of Control Structures and Data Structures. 186-193 - Michael L. Fredman:
Two Applications of a Probabilistic Search Technique: Sorting x + y and Building Balanced Search Trees. 240-244 - Kellogg S. Booth, George S. Lueker:
Linear Algorithms to Recognize Interval Graphs and Test for the Consecutive Ones Property. 255-265