Abstract is missing.
- Finding a Minimum Circuit in a GraphAlon Itai. 1-10
- An Omega(n^2 log n) Lower Bound to the Shortest Paths ProblemAndrew Chi-Chih Yao, David Avis, Ronald L. Rivest. 11-17
- Reference Machines Require Non-linear Time to Maintain Disjoint SetsRobert Endre Tarjan. 18-29
- Fast Probabilistic Algorithms for Hamiltonian Circuits and MatchingsDana Angluin, Leslie G. Valiant. 30-41
- The Complexity of Priority Queue MaintenanceMark R. Brown. 42-48
- A New Representation for Linear ListsLeonidas J. Guibas, Edward M. McCreight, Michael F. Plass, Janet R. Roberts. 49-60
- The Decidability of the Reachability Problem for Vector Addition Systems (Preliminary Version)George S. Sacerdote, Richard L. Tenney. 61-76
- Optimal Implementation of Conjunctive Queries in Relational Data BasesAshok K. Chandra, Philip M. Merlin. 77-90
- Economical Solutions for the Critical Section Problem in a Distributed System (Extended Abstract)Gary L. Peterson, Michael J. Fischer. 91-97
- Nonserial Dynamic Programming Is OptimalArnie Rosenthal. 98-105
- Universal Classes of Hash Functions (Extended Abstract)Larry Carter, Mark N. Wegman. 106-112
- The Analysis of an Improved Hashing TechniqueGaston H. Gonnet, J. Ian Munro. 113-121
- Iteration Theorems for LL(k) LanguagesJohn C. Beatty. 122-131
- A Comparison of Instruction Sets for Stack MachinesBhaskaram Prabhala, Ravi Sethi. 132-142
- Graph Isomorphism, General RemarksGary L. Miller. 143-150
- Reducibility, Randomness, and Intractability (Abstract)Leonard M. Adleman, Kenneth L. Manders. 151-163
- Complexity of Finitely Presented AlgebrasDexter Kozen. 164-177
- Computations with a Restricted Number of Nondeterministic Steps (Extended Abstract)Chandra M. R. Kintala, Patrick C. Fischer. 178-185
- Polynomial Reducibilities and Upward DiagonalizationsIstván Simon, John Gill. 186-194
- On Feasible Numbers (Preliminary Version)Janos Simon. 195-207
- Separating Tape Bounded Auxiliary Pushdown Automata ClassesIvan Hal Sudborough. 208-217
- On Time HierarchiesWolfgang J. Paul. 218-222
- Relations Between Diagonalization, Proof Systems, and Complexity Gaps (Preliminary Version)Juris Hartmanis. 223-227
- Efficient Reducibility Between Programming Systems: Preliminary ReportNancy A. Lynch, Edward K. Blum. 228-238
- New Real-Time Simulations of Multihead Tape UnitsBenton L. Leong, Joel I. Seiferas. 239-248
- A Complete Axiomatic System for Proving Deductions about Recursive ProgramsDavid Harel, Amir Pnueli, Jonathan Stavi. 249-260
- Computability and Completeness in Logics of Programs (Preliminary Report)David Harel, Albert R. Meyer, Vaughan R. Pratt. 261-268
- On the Theory of Programming LogicsRobert L. Constable. 269-285
- Propositional Modal Logic of Programs (Extended Abstract)Michael J. Fischer, Richard E. Ladner. 286-294
- Subtree Replacement Systems: A Unifying Theory for Recursive Equations, LISP, Lucid and Combinatory LogicMike O Donnell. 295-305
- Parameter-Passing Mechanisms and NondeterminismMatthew Hennessy, Edward A. Ashcroft. 306-311