Abstract is missing.
- Separating the Polynomial-Time Hierarchy by Oracles (Preliminary Version)Andrew Chi-Chih Yao. 1-10
- Deterministic Simulation of Probabilistic Constant Depth Circuits (Preliminary Version)Miklós Ajtai, Avi Wigderson. 11-19
- Amplification of Probabilistic Boolean FormulasRavi B. Boppana. 20-29
- On Networks of Noisy GatesNicholas Pippenger. 30-38
- How Easy Is Local Search? (Extended Abstract)David S. Johnson, Christos H. Papadimitriou, Mihalis Yannakakis. 39-42
- Identification Is Easier Than DecodingJoseph JáJá. 43-50
- Three Theorems on Polynomial Degrees of NP-SetsKlaus Ambos-Spies. 51-55
- Simulating Two Pushdown Stores by One Tape in O(n^1.5 sqrt(log n)) TimeMing Li. 56-64
- Nondeterministic versus Probabilistic Linear Search AlgorithmsFriedhelm Meyer auf der Heide. 65-73
- The Complexity of Facets ResolvedChristos H. Papadimitriou, David Wolfe. 74-78
- Using Dual Approximation Algorithms for Scheduling Problems: Theoretical and Practical ResultsDorit S. Hochbaum, David B. Shmoys. 79-89
- A Scaling Algorithm for Weighted Matching on General GraphsHarold N. Gabow. 90-100
- An All Pairs Shortest Path Algorithm with Expected Running Time O(n^2 log n)Alistair Moffat, Tadao Takaoka. 101-105
- Recognizing Circle Graphs in Polynomial TimeCsaba P. Gabor, Wen-Lian Hsu, Kenneth J. Supowit. 106-116
- Why Certain Subgraph Computations Require Only Linear TimeMarshall W. Bern, Eugene L. Lawler, A. L. Wong. 117-125
- Efficient String Matching in the Presence of ErrorsGad M. Landau, Uzi Vishkin. 126-136
- The Least Weight Subsequence Problem (Extended Abstract)Daniel S. Hirschberg, Lawrence L. Larmore. 137-143
- Motion Planning in the Presence of Moving ObstaclesJohn H. Reif, Micha Sharir. 144-154
- Visibility-Polygon Search and Euclidean Shortest PathsTakao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai. 155-164
- Slimming Down Search Structures: A Functional Approach to Algorithm DesignBernard Chazelle. 165-174
- The Complexity of Recognizing Polyhedral Scenes (Extended Abstract)Lefteris M. Kirousis, Christos H. Papadimitriou. 175-185
- Multi-Layer Grid EmbeddingsAlok Aggarwal, Maria M. Klawe, David Lichtenstein, Nathan Linial, Avi Wigderson. 186-196
- Area Penalty for Sublinear Signal Propagation Delay on Chip (Preliminary Version)Paul M. B. Vitányi. 197-207
- On Information Flow and Sorting: New Upper and Lower Bounds for VLSI Circuits (Extended Abstract)Richard Cole, Alan Siegel. 208-221
- Solving Tree Problems on a Mesh-Connected Processor Array (Preliminary Version)Mikhail J. Atallah, Susanne E. Hambrusch. 222-231
- Solving Some Graph Problems with Optimal or Near-Optimal Speedup on Mesh-of-Trees NetworksMing-Deh A. Huang. 232-240
- Randomized Routing on Fat-Trees (Preliminary Version)Ronald I. Greenberg, Charles E. Leiserson. 241-249
- Distributed BFS AlgorithmsBaruch Awerbuch, Robert G. Gallager. 250-256
- An Almost Linear Time and O(n log n + e) Messages Distributed Algorithm for Minimum-Weight Spanning TreesFrancis Y. L. Chin, H. F. Ting. 257-266
- Byzantine Agreement in Constant Expected Time (and Trusting No One)Paul Feldman, Silvio Micali. 267-276
- Geometrical Realization of Set Systems and Probabilistic Communication ComplexityNoga Alon, Peter Frankl, Vojtech Rödl. 277-280
- Robin Hood Hashing (Preliminary Report)Pedro Celis, Per-Åke Larson, J. Ian Munro. 281-288
- Dynamic Monotone Priorities on Planar Sets (Extended Abstract)Michael J. Fischer, Mike Paterson. 289-292
- Design and Analysis of Dynamic Huffman Coding (Extended Abstract)Jeffrey Scott Vitter. 293-302
- Average Case Lower Bounds on the Construction and Searching of Partial OrdersHarry G. Mairson. 303-311
- On Minima of Functions, Intersection Patterns of Curves, and Davenport-Schinzel SequencesMicha Sharir, Ron Livne. 312-320
- Inferring the Structure of a Markov Chain from its OutputSteven Rudich. 321-326
- Automatic Verification of Probabilistic Concurrent Finite-State ProgramsMoshe Y. Vardi. 327-338
- Partial Polymorphic Type Inference Is UndecidableHans-Juergen Boehm. 339-345
- Fixed-Point Extensions of First-Order LogicYuri Gurevich, Saharon Shelah. 346-353
- Equivalences and Transformations of Recursive DefinitionsBruno Courcelle. 354-359
- A Private Interactive Test of a Boolean Predicate and Minimum-Knowledge Public-Key Cryptosystems (Extended Abstract)Zvi Galil, Stuart Haber, Moti Yung. 360-371
- A Robust and Verifiable Cryptographically Secure Election Scheme (Extended Abstract)Josh D. Cohen, Michael J. Fischer. 372-382
- Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract)Benny Chor, Shafi Goldwasser, Silvio Micali, Baruch Awerbuch. 383-395
- The Bit Extraction Problem of t-Resilient Functions (Preliminary Version)Benny Chor, Oded Goldreich, Johan Håstad, Joel Friedman, Steven Rudich, Roman Smolensky. 396-407
- Collective Coin Flipping, Robust Voting Schemes and Minima of Banzhaf ValuesMichael Ben-Or, Nathan Linial. 408-416
- Random Polynomial Time Is Equal to Slightly-random Polynomial TimeUmesh V. Vazirani, Vijay V. Vazirani. 417-428
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity (Extended Abstract)Benny Chor, Oded Goldreich. 429-442
- Factoring with Cyclotomic PolynomialsEric Bach, Jeffrey Shallit. 443-450
- Computing with Polynomials Given by Straight-Line Programs II: Sparse FactorizationErich Kaltofen. 451-458
- An Application of Simultaneous Approximation in Combinatorial OptimizationAndrás Frank, Éva Tardos. 459-463
- Computing ears and branchings in parallelLászló Lovász. 464-467
- Parallel Computational Geometry (Extended Abstract)Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó Dúnlaing, Chee-Keng Yap. 468-477
- Parallel Tree Contraction and Its ApplicationGary L. Miller, John H. Reif. 478-489
- Improved Processor Bounds for Algebraic and Combinatorial Problems in RNCZvi Galil, Victor Y. Pan. 490-495
- An Optimal Parallel Algorithm for Integer SortingJohn H. Reif. 496-504
- Fast Parallel Computation with Permutation GroupsEugene M. Luks, Pierre McKenzie. 505-514
- Algebraic Cell Decomposition in NC (Preliminary Version)Dexter Kozen, Chee-Keng Yap. 515-521
- Fast and Efficient Algorithms for Sequential and Parallel Evaluation of Polynomial Zeros and of Matrix PolynomialsVictor Y. Pan. 522-531
- The Complexity of Parallel SortingFriedhelm Meyer auf der Heide, Avi Wigderson. 532-540
- The Complexity of Parallel Computation on MatroidsRichard M. Karp, Eli Upfal, Avi Wigderson. 541-550