Abstract is missing.
- Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC¹David A. Mix Barrington. 1-5
- Almost Optimal Lower Bounds for Small Depth CircuitsJohan Håstad. 6-20
- With Probability One, A Random Oracle Separates PSPACE from the Polynomial-Time HierarchyJin-yi Cai. 21-29
- Two lower bounds for branching programsMiklós Ajtai, László Babai, Péter Hajnal, János Komlós, Pavel Pudlák, Vojtech Rödl, Endre Szemerédi, György Turán. 30-38
- On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing MachinesZvi Galil, Ravi Kannan, Endre Szemerédi. 39-49
- How hard is to marry at random? (On the approximation of the permanent)Andrei Z. Broder. 50-58
- Private Coins versus Public Coins in Interactive Proof SystemsShafi Goldwasser, Michael Sipser. 59-68
- The Complexity of Optimization ProblemsMark W. Krentel. 69-76
- A Provably Efficient Algorithm for Dynamic Storage AllocationEdward G. Coffman Jr., Frank Thomson Leighton. 77-90
- Tight Bounds for Minimax Grid Matching, With Applications to the Average Case Analysis of AlgorithmsFrank Thomson Leighton, Peter W. Shor. 91-103
- Four Pages are Necessary and Sufficient for Planar Graphs (Extended Abstract)Mihalis Yannakakis. 104-108
- Making Data Structures PersistentJames R. Driscoll, Neil Sarnak, Daniel Dominic Sleator, Robert Endre Tarjan. 109-121
- Rotation Distance, Triangulations, and Hyperbolic GeometryDaniel Dominic Sleator, Robert Endre Tarjan, William P. Thurston. 122-135
- A New Approach to the Maximum Flow ProblemAndrew V. Goldberg, Robert Endre Tarjan. 136-146
- Fast Algorithms for Convex Quadratic Programming and Multicommodity FlowsSanjiv Kapoor, Pravin M. Vaidya. 147-159
- Parallel Hashing-An Efficient Implementation of Shared Memory (Preliminary Version)Anna R. Karlin, Eli Upfal. 160-168
- Limits on the Power of Concurrent-Write Parallel MachinesPaul Beame. 169-176
- New Lower Bounds for Parallel ComputationMing Li, Yaacov Yesha. 177-187
- Deterministic Selection in O(log log N) Parallel TimeMiklós Ajtai, János Komlós, William L. Steiger, Endre Szemerédi. 188-195
- Linear Programming with Two Variables per Inequality in Poly-Log Time (Preliminary Version)George S. Lueker, Nimrod Megiddo, Vijaya Ramachandran. 196-205
- Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithmsRichard Cole, Uzi Vishkin. 206-219
- Introducing Efficient Parallelism into Approximate String Matching and a New Serial AlgorithmGad M. Landau, Uzi Vishkin. 220-230
- Parallel Evaluation of Division-Free Arithmetic ExpressionsS. Rao Kosaraju. 231-239
- Explicit Expanders and the Ramanujan ConjecturesAlexander Lubotzky, R. Phillips, P. Sarnak. 240-246
- Non-Blocking Networks (Preliminary Version)Paul Feldman, Joel Friedman, Nicholas Pippenger. 247-254
- An Optimal Sorting Algorithm for Mesh Connected ComputersClaus-Peter Schnorr, Adi Shamir. 255-263
- Optimal Simulations between Mesh-Connected Arrays of Processors (Preliminary Version)S. Rao Kosaraju, Mikhail J. Atallah. 264-272
- Classifying Learnable Geometric Concepts with the Vapnik-Chervonenkis Dimension (Extended Abstract)Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, Manfred K. Warmuth. 273-282
- Reasoning about Fair Concurrent ProgramsCostas Courcoubetis, Moshe Y. Vardi, Pierre Wolper. 283-294
- A Note on One-Way Functions and Polynomial-Time Isomorphisms (Extended Abstract)Ker-I Ko, Timothy J. Long, Ding-Zhu Du. 295-303
- The Complexity of Reasoning about Knowledge and Time: Extended AbstractJoseph Y. Halpern, Moshe Y. Vardi. 304-315
- Almost All Primes Can Be Quickly CertifiedShafi Goldwasser, Joe Kilian. 316-329
- Uniform Closure Properties of P-Computable FunctionsErich Kaltofen. 330-337
- A Fast Parallel Algorithm to Compute the Rank of a Matrix over an Arbitrary FieldKetan Mulmuley. 338-339
- A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real RootsMichael Ben-Or, Ephraim Feig, Dexter Kozen, Prasoon Tiwari. 340-349
- Finding Irreducible Polynomials over Finite FieldsLeonard M. Adleman, Hendrik W. Lenstra Jr.. 350-355
- Pseudo-random Permutation Generators and Cryptographic CompositionMichael Luby, Charles Rackoff. 356-363
- Limits on the Security of Coin Flips when Half the Processors Are Faulty (Extended Abstract)Richard Cleve. 364-369
- Fault Tolerance in Networks of Bounded Degree (Preliminary Version)Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal. 370-379
- A Linear-Time Algorithm for Triangulating Simple PolygonsRobert Endre Tarjan, Christopher J. Van Wyk. 380-388
- Topologically Sweeping an ArrangementHerbert Edelsbrunner, Leonidas J. Guibas. 389-403
- Constructing Higher-Dimensional Convex Hulls at Logarithmic Cost per FaceRaimund Seidel. 404-413
- Further Applications of Random Sampling to Computational GeometryKenneth L. Clarkson. 414-423
- Probing Convex PolytopesDavid P. Dobkin, Herbert Edelsbrunner, Chee-Keng Yap. 424-432
- Two Probabilistic Results on Rectilinear Steiner TreesMarshall W. Bern. 433-441
- Computing the Volume Is DifficultImre Bárány, Zoltán Füredi. 442-447
- Aspects of Information Flow in VLSI Circuits (Extended Abstract)Alan Siegel. 448-459