Abstract is missing.
- Combinatorial Optimization with Rational Objective FunctionsNimrod Megiddo. 1-12
- Maximization Problems on Graphs with Edge Weights Chosen from a Normal Distribution (Extended Abstract)George S. Lueker. 13-18
- A Representation for Linear Lists with Movable FingersMark R. Brown, Robert Endre Tarjan. 19-29
- The Macro Model for Data Compression (Extended Abstract)James A. Storer, Thomas G. Szymanski. 30-39
- The Subgraph Homeomorphism ProblemAndrea S. LaPaugh, Ronald L. Rivest. 40-50
- On the n^log n Isomorphism Technique: A Preliminary ReportGary L. Miller. 51-58
- Exact and Approximate Membership TestersLarry Carter, Robert W. Floyd, John Gill, George Markowsky, Mark N. Wegman. 59-65
- Tree Transducers, L Systems and Two-Way Machines (Extended Abstract)Joost Engelfriet, Grzegorz Rozenberg, Giora Slutzki. 66-74
- Operational and Semantic Equivalence between Recursive ProgramsJean-Claude Raoult, Jean Vuillemin. 75-85
- A New Solution to the Critical Section ProblemHoward P. Katseff. 86-88
- A Unified Approach to Models of Synchronous Parallel MachinesLeslie M. Goldschlager. 89-94
- Computability Theory in Admissible DomainsEdward Sciore, A. Tang. 95-104
- On Formulating Simultaneity for Studying Parallelism and SynchronizationRaymond E. Miller, Chee-Keng Yap. 105-113
- Parallelism in Random Access MachinesSteven Fortune, James Wyllie. 114-118
- Data Type Specification: Parameterization and the Power of Specification TechniquesJames W. Thatcher, Eric G. Wagner, Jesse B. Wright. 119-132
- An Efficient Algorithm for Determining Whether a Cubic Graph is ToroidalI. S. Filotti. 133-142
- Switching Functions Whose Monotone Complexity Is Nearly QuadraticIngo Wegener. 143-149
- Straight-Line Program Length as a Parameter for Complexity MeasuresNancy A. Lynch. 150-161
- Computational Complexity of Computing Polynomials over the Fields of Real and Complex NumbersVictor Y. Pan. 162-172
- Optimal Evaluation of Pairs of Bilinear FormsJoseph JáJá. 173-183
- Algorithms for Edge Coloring Bipartite GraphsHarold N. Gabow, Oded Kariv. 184-192
- On the Parallel Evaluation of Multivariate PolynomialsLaurent Hyafil. 193-195
- Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of their CircuitsMartin Tompa. 196-204
- An NP-Complete Number-Theoretic ProblemEitan M. Gurari, Oscar H. Ibarra. 205-215
- The Complexity of Satisfiability ProblemsThomas J. Schaefer. 216-226
- Coping with Errors in Binary Search Procedures (Preliminary Report)Ronald L. Rivest, Albert R. Meyer, Daniel J. Kleitman, Karl Winklmann, Joel Spencer. 227-232
- On Time-Space Classes and Their Relation to the Theory of Real AdditionAnni R. Bruss, Albert R. Meyer. 233-239
- On the Completeness of a Generalized Matching ProblemDavid G. Kirkpatrick, Pavol Hell. 240-245
- Propositional Representation of Arithmetic Proofs (Preliminary Version)Martin Dowd. 246-252
- Node- and Edge-Deletion NP-Complete ProblemsMihalis Yannakakis. 253-264
- On the Complexity of the Maximum Subgraph ProblemJohn M. Lewis. 265-274
- Nondeterminism and the Size of Two Way Finite AutomataWilliam J. Sakoda, Michael Sipser. 275-286
- Indexing of Subrecursive ClassesDexter Kozen. 287-295
- An Analysis of the Full Alpha-Beta Pruning AlgorithmGérard M. Baudet. 296-313
- Anomaly Hierarchies of Mechanized Inductive InferenceJohn Case, Carl Smith. 314-319
- Presburger Arithmetic with Bounded Quantifier AlternationC. R. Reddy, Donald W. Loveland. 320-325
- A Practical Decision Method for Propositional Dynamic Logic: Preliminary ReportVaughan R. Pratt. 326-337
- Relativized Questions Involving Probabilistic AlgorithmsCharles Rackoff. 338-342