Abstract is missing.
- Description and Analysis of an Efficient Priority Queue RepresentationJean Françon, G. Viennot, Jean Vuillemin. 1-7
- A Dichromatic Framework for Balanced TreesLeonidas J. Guibas, Robert Sedgewick. 8-21
- Should Tables Be Sorted? (Extended Abstract)Andrew Chi-Chih Yao. 22-27
- A Data Structure for Orthogonal Range QueriesGeorge S. Lueker. 28-34
- Complexity of Solvable Cases of the Decision Problem for the Predicate CalculusHarry R. Lewis. 35-47
- GO Is PSPACE HardDavid Lichtenstein, Michael Sipser. 48-54
- The Complexity of Checkers on an N * N Board - Preliminary ReportAviezri S. Fraenkel, M. R. Garey, David S. Johnson, T. Schaefer, Yaacov Yesha. 55-64
- One-Way Log-Tape ReductionsJuris Hartmanis, Neil Immerman, Stephen R. Mahaney. 65-72
- Halting Space-Bounded ComputationsMichael Sipser. 73-74
- Two Theorems on Random Polynomial TimeLeonard M. Adleman. 75-83
- Improved Bounds on the Problem of Time-Space Trade-Off in the Pebble Game (Preliminary Version)Rüdiger Reischuk. 84-91
- Alternating Pushdown Automata (Preliminary Report)Richard E. Ladner, Richard J. Lipton, Larry J. Stockmeyer. 92-106
- On Tape-Bounded Probabilistic Turing Machine Transducers (Extended Abstract)Janos Simon, John Gill, James Hunt. 107-112
- On Alternation (Preliminary Version)Wolfgang J. Paul, Ernst J. Prauß, Rüdiger Reischuk. 113-122
- Equality Languages, Fixed Point Languages and Representations of Recursively Enumerable LanguagesJoost Engelfriet, Grzegorz Rozenberg. 123-126
- Computable Nondeterministic FunctionsAshok K. Chandra. 127-131
- On the Power of the Compass (or, Why Mazes Are Easier to Search than Graphs)Manuel Blum, Dexter Kozen. 132-142
- Limited Subsets of a Free MonoidImre Simon. 143-150
- Lower Bounds on Information Transfer in Distributed ComputationsHarold Abelson. 151-158
- An Optimal Lower Bound on the Number of Total Operations to Compute 0-1 Polynomials over the Field of Complex NumbersJean-Paul Van de Wiele. 159-165
- Strassen s Algorithm Is not Optimal: Trililnear Technique of Aggregating, Uniting and Canceling for Constructing Fast Algorithms for Matrix OperationsVictor Y. Pan. 166-176
- A Decidability Result for a Second Order Process LogicRohit Parikh. 177-183
- Consistent and Complete Proof Rules for the Total Correctness of Parallel ProgramsLawrence Flon, Norihisa Suzuki. 184-192
- Model Theoretic Aspects of Computational ComplexityRichard J. Lipton. 193-200
- On Recursive Equations Having a Unique SolutionBruno Courcelle. 201-213
- On the Algebra of Order (Extended Abstract)Daniel J. Lehmann. 214-220
- Data Types as Initial Algebras: A unification of Scottery and ADJery (Extended Abstract)Akira Kanda. 221-230
- A New Algorithm for the Maximal Flow ProblemZvi Galil. 231-245
- A Fast Algorithm for Single Processor SchedulingBarbara Simons. 246-252
- Selection and Sorting with Limited StorageJ. Ian Munro, Mike Paterson. 253-258
- Improving the Bounds on Optimal MergingC. Christen. 259-266
- On Lifted Problems (Preliminary Reports)Chee-Keng Yap. 267-279
- On the Average-case Complexity of Selecting k-th BestAndrew Chi-Chih Yao, F. Frances Yao. 280-289