Abstract is missing.
- New Lower Bound Techniques for VLSIFrank Thomson Leighton. 1-12
- Census Functions: an Approach to VLSI Upper Bounds (Preliminary Version)Richard J. Lipton, Jacobo Valdes. 13-22
- Optimizing Synchronous SystemsCharles E. Leiserson, James B. Saxe. 23-36
- On Relations Between Input and Communication/Computation in VLSI (Preliminary Report)Zvi M. Kedem, Alessandro Zorat. 37-44
- Two-Way Counter Machines and Diophantine EquationsEitan M. Gurari, Oscar H. Ibarra. 45-52
- A Time-Space Tradeoff for Language RecognitionPavol Duris, Zvi Galil. 53-57
- Simulations among Multidimensional Turing Machines (Preliminary Version)Michael C. Loui. 58-67
- On Heads Versus TapesWolfgang J. Paul. 68-73
- On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Grammars, and AutomataRichard Edwin Stearns, Harry B. Hunt III. 74-81
- On the Asymptotic Complexity of Matrix Multiplication (Extended Summary)Don Coppersmith, Shmuel Winograd. 82-90
- On the Direct Sum Conjecture (Extended Summary)Ephraim Feig, Shmuel Winograd. 91-94
- Computation of Algebraic Functions with Root ExtractionsJoseph JáJá. 95-100
- An Omega(n^4/3) Lower Bound on the Monotone Network Complexity of n-th Degree ConvolutionNorbert Blum. 101-108
- Non-Existence of One-Dimensional Expanding GraphsMaria M. Klawe. 109-114
- A Minimum Spanning Ellipse AlgorithmMark J. Post. 115-122
- A Direct Dynamic Solution to Range Search and Related Problems for Product RegionsZ. Aviad, E. Shamir. 123-126
- Deletion Algorithms for Hashing that Preserve Randomness (detailed abstract)Jeffrey Scott Vitter. 127-132
- Implicit Data Structures for the Weighted Dictionary Problem (preliminary version)Greg N. Frederickson. 133-139
- Possible Futures, Acceptances, Refusals, and Communicating ProcessesWilliam C. Rounds, Stephen D. Brookes. 140-149
- Symmetry Breaking in Distributive NetworksAlon Itai, Michael Rodeh. 150-158
- Unanimity in an Unknown and Unreliable EnvironmentDanny Dolev. 159-168
- Symmetry in Systems of Asynchronous ProcessesJames E. Burns. 169-174
- A model of concurrent database transactions (summary)Ravi Sethi. 175-184
- The Complexity of Distributed Concurrency ControlParis C. Kanellakis, Christos H. Papadimitriou. 185-197
- Global Decision Problems for Relational DatabasesMoshe Y. Vardi. 198-202
- Optimizing Conjunctive Queries When Attribute Domains Are not Disjoint (Extended Abstract)David S. Johnson, Anthony C. Klug. 203-211
- A Fast Probabilistic Parallel Sorting AlgorithmRüdiger Reischuk. 212-219
- The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring ProblemUdi Manber, Martin Tompa. 220-227
- Time-Space Trade-Offs for General RecursionRutger Verbeek. 228-234
- Towards Separating Nondeterministic Time from Deterministic TimeR. Kannan. 235-243
- A Complexity Theory Based on Boolean AlgebraSven Skyum, Leslie G. Valiant. 244-253
- Relativizing Time and Space (Preliminary Report)Ronald V. Book, Christopher B. Wilson, Mei-rui Xu. 254-259
- Parity, Circuits, and the Polynomial-Time HierarchyMerrick L. Furst, James B. Saxe, Michael Sipser. 260-270
- On the Number of P-Isomorphism Classes of NP-Complete SetsStephen R. Mahaney. 271-278
- Number Theoretic Functions Computable by Polymorphic Programs (Extended Abstract)Richard Statman. 279-282
- The Power of Parallelism for Automatic Program SynthesisCarl H. Smith. 283-295
- On the Relation between Descriptional Complexity and Algorithmic ProbabilityPéter Gács. 296-303
- A Circuit-Size Lower BoundR. Kannan. 304-309
- Propositional Dynamic Logic of Context-Free ProgramsDavid Harel, Amir Pnueli, Jonathan Stavi. 310-321
- The Propositional Dynamic Logic of Deterministic, Well-Structured Programs (Extended Abstract)Joseph Y. Halpern, John H. Reif. 322-334
- Unbounded Program Memory Adds to the Expressive Power of First-Order Dynamic Logic (Extended Abstract)Jerzy Tiuryn. 335-339
- Temporal Logic Can Be More ExpressivePierre Wolper. 340-348
- On the Security of Public Key Protocols (Extended Abstract)Danny Dolev, Andrew Chi-Chih Yao. 350-357
- Worst-Case Ratios for Planar Graphs and the Method of Induction on Faces (Extended Abstract)Christos H. Papadimitriou, Mihalis Yannakakis. 358-363
- Maximum Matchings in Sparse Random GraphsRichard M. Karp, Michael Sipser. 364-375
- The Complexity of Searching a Graph (Preliminary Version)Nimrod Megiddo, S. Louis Hakimi, M. R. Garey, David S. Johnson, Christos H. Papadimitriou. 376-385
- A Complexity Calculus for Classes of Recursive Search Programs over Tree StructuresPhilippe Flajolet, Jean-Marc Steyaert. 386-393
- Probabilistic Algorithms in Finite FieldsMichael Ben-Or. 394-398
- Applying Parallel Computation Algorithms in the Design of Serial AlgorithmsNimrod Megiddo. 399-408
- Irreducibility Testing and Factorization of Polynomials (Extended Abstract)Leonard M. Adleman, Andrew M. Odlyzko. 409-418
- A Decidable mu-Calculus: Preliminary ReportVaughan R. Pratt. 421-427