Abstract is missing.
- Some Theoretical Aspects of Position-Location ProblemsYechiam Yemini. 1-8
- On a General Method for Maximizing and Minimizing among Certain Geometric Problems (Extended Abstract)David P. Dobkin, Lawrence Snyder. 9-17
- Efficient Computation of Continuous SkeletonsDavid G. Kirkpatrick. 18-27
- Field Extension and Triangular Aggregating, Uniting and Canceling for the Acceleration of Matrix MultiplicationsVictor Y. Pan. 28-38
- Canonical Labelling of Graphs in Linear Average TimeLászló Babai, Ludek Kucera. 39-46
- Succinct Certificates for the Solvability of Binary Quadratic Diophantine EquationsJ. C. Lagarias. 47-54
- A Subexponential Algorithm for the Discrete Logarithm Problem with Applications to Cryptography (Abstract)Leonard M. Adleman. 55-60
- Computational Complexity in Algebraic Function Fields (Preliminary Version)Nicholas Pippenger. 61-65
- Formal Languages: Origins and DirectionsSheila A. Greibach. 66-90
- The Decidability of the Equivalence of Context-Free Grammar FormsMeera Blattner. 91-96
- Bijective A-TransducersHermann A. Maurer, Maurice Nivat. 97-100
- Semantics of Probabilistic ProgramsDexter Kozen. 101-114
- Models of Program LogicsVaughan R. Pratt. 115-122
- Orderings for Term-Rewriting SystemsNachum Dershowitz. 123-131
- Complexity of Partial SatisfactionKarl J. Lieberherr, Ernst Specker. 132-139
- The Cube-Connected-Cycles: A Versatile Network for Parallel Computation (Extended Abstract)Franco P. Preparata, Jean Vuillemin. 140-147
- Transforming Static Data Structures to Dynamic Structures (Abridged Version)James B. Saxe, Jon Louis Bentley. 148-168
- Toward Self-Organizing Linear Search (Preliminary Draught)Gaston H. Gonnet, J. Ian Munro, Hendra Suwanda. 169-174
- New Classes and Applications of Hash FunctionsMark N. Wegman, Larry Carter. 175-182
- Towards Analysing Sequences of Operations for Dynamic Data Structures (Preliminary Version)Philippe Flajolet, Jean Françon, Jean Vuillemin. 183-195
- Efficient Algorithms for Simple Matroid Intersection ProblemsHarold N. Gabow, Robert Endre Tarjan. 196-204
- A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables per InequalityBengt Aspvall, Yossi Shiloach. 205-217
- Random Walks, Universal Traversal Sequences, and the Complexity of Maze ProblemsRomas Aleliunas, Richard M. Karp, Richard J. Lipton, László Lovász, Charles Rackoff. 218-223
- Observations about the Development of Theoretical Computer ScienceJuris Hartmanis. 224-233
- Resource Allocation with Immunity to Limited Process Failure (Preliminary Report)Michael J. Fischer, Nancy A. Lynch, James E. Burns, Allan Borodin. 234-254
- Approximate Algorithms for Optimization of Busy Waiting in Parallel Programs (Preliminary Report)Edmund M. Clarke, Lishing Liu. 255-266
- Modeling Communications Protocols by AutomataAlfred V. Aho, Jeffrey D. Ullman, Mihalis Yannakakis. 267-273
- Controlling Concurrency Using Locking Protocols (Preliminary Report)Zvi M. Kedem, Abraham Silberschatz. 274-285
- Locking Policies: Safety and Freedom from DeadlockMihalis Yannakakis, Christos H. Papadimitriou, H. T. Kung. 286-297
- On Time versus Space IIWolfgang J. Paul, Rüdiger Reischuk. 298-306
- On Simultaneous Resource Bounds (Preliminary Version)Nicholas Pippenger. 307-311
- On Uniform Circuit Complexity (Extended Abstract)Walter L. Ruzzo. 312-318
- A Time-Space Tradeoff for Sorting on Non-Oblivious MachinesAllan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa. 319-327
- A T S^2 = O(2^n) Time/Space Tradeoff for Certain NP-Complete ProblemsRichard Schroeppel, Adi Shamir. 328-336
- Length of Predicate Calculus Formulas as a New Complexity MeasureNeil Immerman. 337-347
- Multiple-Person AlternationGary L. Peterson, John H. Reif. 348-363
- Explicit Constructions of Linear Size SuperconcentratorsOfer Gabber, Zvi Galil. 364-370
- Origins of Recursive Function TheoryStephen Cole Kleene. 371-382
- Relativized CryptographyGilles Brassard. 383-391
- Succinctness, Verifiability and Determinism in Representations of Polynomial-Time LanguagesTheodore P. Baker, Juris Hartmanis. 392-396
- Reductions that LieLeonard M. Adleman, Kenneth L. Manders. 397-410
- Division Is GoodJanos Simon. 411-420
- Complexity of the Mover s Problem and Generalizations (Extended Abstract)John H. Reif. 421-427