Abstract is missing.
- The omega-Sequence Equivalence Problem for DOL Systems Is DecidableKarel Culik II, Tero Harju. 1-6
- Unique Normal Forms in Term Rewriting Systems with Repeated VariablesPaul Chew. 7-18
- Classes of Functions for Computing on Binary Trees (Extended Abstract)Frank M. Hawrusik, K. N. Venkataraman, Ann Yasuhara. 19-27
- Examples of Hard Tautologies in the Propositional CalculusBalakrishnan Krishnamurthy, Robert N. Moll. 28-37
- The Complexity of Parameter Passing in Polymorphic Procedures (or: Programming Language Theorems Independent of Very Strong Theories)Daniel Leivant. 38-45
- Pushdown Automata, Graphs, Ends, Second-Order Logic, and Reachability ProblemsDavid E. Muller, Paul E. Schupp. 46-54
- Fast Programs for Initial Segments and Polynomial Time Computation in Weak Models of Arithmetic (Preliminary Abstract)Deborah Joseph, Paul Young. 55-61
- Localized Search in Sorted ListsS. Rao Kosaraju. 62-69
- Convex Decompositions of PolyhedraBernard Chazelle. 70-79
- Digital Straightness and Convexity (Extended Abstract)Chul E. Kim, Azriel Rosenfeld. 80-89
- A Linear Probing Sort and its Analysis (Preliminary Draft)Gaston H. Gonnet, J. Ian Munro. 90-95
- Lower Bounds for the Cycle Detection ProblemFaith E. Fich. 96-105
- Time-Space-Optimal String MatchingZvi Galil, Joel I. Seiferas. 106-113
- A Data Structure for Dynamic TreesDaniel Dominic Sleator, Robert Endre Tarjan. 114-122
- On the Parallel Computation for the Knapsack ProblemAndrew Chi-Chih Yao. 123-127
- A Difference in Efficiency between Synchronous and Asynchronous SystemsEshrat Arjomandi, Michael J. Fischer, Nancy A. Lynch. 128-132
- Distributed Algorithms for Synchronizing Interprocess Communication within Real TimeJohn H. Reif, Paul G. Spirakis. 133-145
- Reversal Complexity of Counter MachinesTat-hung Chan. 146-157
- Space-Bounded Probabilistic Turing Machine Complexity Classes Are Closed under Complement (Preliminary Version)Janos Simon. 158-167
- A Characterization of the Class of Functions Computable in Polynomial Time on Random Access MachinesAlberto Bertoni, Giancarlo Mauri, Nicoletta Sabadini. 168-176
- Fooling a Two-Way Automaton or One Pushdown Store Is Better Than One Counter for Two Way Machines (Preliminary Version)Pavol Duris, Zvi Galil. 177-188
- Measures of Parallelism in Alternating Computation Trees (Extended Abstract)K. N. King. 189-201
- LALR(k) Testing is PSPACE-CompleteEsko Ukkonen, Eljas Soisalon-Soininen. 202-206
- Bandwidth Constrained NP-Complete ProblemsBurkhard Monien, Ivan Hal Sudborough. 207-217
- The Complexity of Dynamic Languages and Dynamic Optimization ProblemsJames B. Orlin. 218-227
- Low Level Complexity for Combinatorial GamesAkeo Adachi, Shigeki Iwata, Takumi Kasai. 228-237
- An Algorithm for the General Petri Net Reachability ProblemErnst W. Mayr. 238-246
- An Efficient General Purpose Parallel ComputerZvi Galil, Wolfgang J. Paul. 247-262
- Universal Schemes for Parallel CommunicationLeslie G. Valiant, Gordon J. Brebner. 263-277
- New Layouts for the Shuffle-Exchange Graph (Extended Abstract)Daniel J. Kleitman, Frank Thomson Leighton, Margaret Lepley, Gary L. Miller. 278-292
- Bounds on Minimax Edge Length for Complete Binary Trees (Extended Abstract)Mike Paterson, Walter L. Ruzzo, Lawrence Snyder. 293-299
- Lower Bounds for VLSIRichard J. Lipton, Robert Sedgewick. 300-307
- The Entropic Limitations on VLSI Computations (Extended Abstract)Andrew Chi-Chih Yao. 308-311
- Optimal Wiring between RectanglesDanny Dolev, Kevin Karplus, Alan Siegel, Alex Strong, Jeffrey D. Ullman. 312-317
- A Model of Computation for VLSI with Related Complexity ResultsBernard Chazelle, Louis Monier. 318-325
- I/O Complexity: The Red-Blue Pebble GameJia-Wei Hong, H. T. Kung. 326-333
- Graphs that Are Almost Binary Trees (Preliminary Version)Jia-Wei Hong, Arnold L. Rosenberg. 334-341
- Embedded Implicational Dependencies and their Inference ProblemAshok K. Chandra, Harry R. Lewis, Johann A. Makowsky. 342-354
- Properties of Acyclic Database SchemesCatriel Beeri, Ronald Fagin, David Maier, Alberto O. Mendelzon, Jeffrey D. Ullman, Mihalis Yannakakis. 355-362
- Issues of Correctness in Database Concurrency Control by LockingMihalis Yannakakis. 363-367
- On the Faithful Regular Extensions of Iterative AlgebrasFrancesco Parisi-Presicce. 368-374
- Propositional Dynamic Logic of Looping and ConverseRobert S. Streett. 375-383
- Equations between Regular Terms and an Application to Process LogicAshok K. Chandra, Joseph Y. Halpern, Albert R. Meyer, Rohit Parikh. 384-390