Abstract is missing.
- An O(n^2 (m + n log n) log n) Min-Cost Flow AlgorithmZvi Galil, Éva Tardos. 1-9
- Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer ProgramsPrabhakar Raghavan. 10-18
- On a Search Problem Related to Branch-and-Bound ProceduresRichard M. Karp, Michael E. Saks, Avi Wigderson. 19-28
- Probabilistic Boolean Decision Trees and the Complexity of Evaluating Game TreesMichael E. Saks, Avi Wigderson. 29-38
- A Physical Interpretation of Graph Connectivity, and Its Algorithmic ApplicationsNathan Linial, László Lovász, Avi Wigderson. 39-48
- The Asymptotic Spectrum of Tensors and the Exponent of Matrix MultiplicationVolker Strassen. 49-54
- Storing a Dynamic Sparse TableAlfred V. Aho, David Lee. 55-60
- Lower Bounds for Accessing Binary Search Trees With Rotations (Preliminary Version)Robert E. Wilber. 61-70
- What search algorithm gives optimal average-case performance when search resources are highly limited?David Mutchler. 71-76
- Geometric Applications of Davenport-Schinzel SequencesMicha Sharir, Richard Cole, Klara Kedem, Daniel Leven, Richard Pollack, Shmuel Sifrony. 77-86
- Lower Bounds on the Complexity of Multidimensional Searching (Extended Abstract)Bernard Chazelle. 87-96
- Planar Realizations of Nonlinear Davenport-Schinzel Sequences by SegmentsAdy Wiernik. 97-106
- Proving by Example and Gap TheoremsJiawei Hong. 107-116
- An optimal algorithm for the All-Nearest-Neighbors ProblemPravin M. Vaidya. 117-122
- An Algorithm for Constructing the Aspect GraphW. Harry Plantinga, Charles R. Dyer. 123-131
- An Algorithmic Approach to the Automated Design of Parts OrientersB. K. Natarajan. 132-142
- Finite-Resolution Computational GeometryDaniel H. Greene, F. Frances Yao. 143-152
- On Newton s Method for PolynomialsJoel Friedman. 153-161
- How to Generate and Exchange Secrets (Extended Abstract)Andrew Chi-Chih Yao. 162-167
- Information Theoretic Reductions among Disclosure ProblemsGilles Brassard, Claude Crépeau, Jean-Marc Robert. 168-173
- Proofs that Yield Nothing But their Validity and a Methodology of Cryptographic Protocol Design (Extended Abstract)Oded Goldreich, Silvio Micali, Avi Wigderson. 174-187
- Non-Transitive Transfer of Confidence: A Perfect Zero-Knowledge Interactive Protocol for SAT and BeyondGilles Brassard, Claude Crépeau. 188-195
- Dynamic deadlock resolution protocols (Extended Abstract)Baruch Awerbuch, Silvio Micali. 196-207
- Programming Simultaneous Actions Using Common Knowledge: Preliminary VersionYoram Moses, Mark R. Tuttle. 208-221
- Flipping Persuasively in Constant Expected Time (Preliminary Version)Cynthia Dwork, David B. Shmoys, Larry J. Stockmeyer. 222-232
- Atomic Shared Register Access by Asynchronous Hardware (Detailed Abstract)Paul M. B. Vitányi, Baruch Awerbuch. 233-243
- Competitive Snoopy CachingAnna R. Karlin, Mark S. Manasse, Larry Rudolph, Daniel Dominic Sleator. 244-254
- The Distance Bound for Sorting on Mesh-Connected Processor Arrays Is Tight (Preliminary Report)Yiming Ma, Sandeep Sen, Isaac D. Scherson. 255-263
- Meshes with Multiple BusesQuentin F. Stout. 264-273
- Optimal Simulations of Tree Machines (Preliminary Version)Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg. 274-282
- How Robust Is the n-Cube? (Extended Abstract)Bernd Becker, Hans-Ulrich Simon. 283-291
- Parallel Algorithms for Permutation Groups and Graph IsomorphismEugene M. Luks. 292-302
- A Las Vegas-NC Algorithm for isomorphism of graphs with bounded multiplicity of eigenvaluesLászló Babai. 303-312
- The Complexity of Isomorphism TestingMax H. Garzon, Yechezkel Zalcstein. 313-321
- FFD Bin Packing for Item Sizes with Distributions on [0,1/2]Sally Floyd, Richard M. Karp. 322-330
- Fast Solution of Some Random NP-Hard ProblemsMartin E. Dyer, Alan M. Frieze. 331-336
- Complexity classes in communication complexity theory (preliminary version)László Babai, Peter Frankl, Janos Simon. 337-347
- A New Pebble Game that Characterizes Parallel Complexity ClassesH. Venkateswaran, Martin Tompa. 348-360
- k+1 Heads Are Better than k for PDA sMarek Chrobak, Ming Li. 361-367
- On the Power of InteractionWilliam Aiello, Shafi Goldwasser, Johan Håstad. 368-379
- Collapsing Degrees (Extended Abstract)Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer. 380-389
- Three Results on the Polynomial Isomorphism of Complete SetsJudy Goldsmith, Deborah Joseph. 390-397
- Permanent and DeterminantJoachim von zur Gathen. 398-401
- Time-Space Tradeoffs for Branching Programs Contrasted with those for Straight-Line ProgramsKarl R. Abrahamson. 402-409
- Meanders, Ramsey Theory and Lower Bounds for Branching ProgramsNoga Alon, Wolfgang Maass. 410-417
- The Token Distribution Problem (Preliminary Version)David Peleg, Eli Upfal. 418-427
- Separator-Based Strategies for Efficient Message Routing (Preliminary Version)Greg N. Frederickson, Ravi Janardan. 428-437
- Parallel Complexity of Logical Query ProgramsJeffrey D. Ullman, Allen Van Gelder. 438-454
- On the Power of One-Way CommunicationJik H. Chang, Oscar H. Ibarra, Anastasios Vergis. 455-464
- An Efficient Parallel Algorithm for PlanarityPhilip N. Klein, John H. Reif. 465-477
- Approximate and Exact Parallel Scheduling with Applications to List, Tree and Graph ProblemsRichard Cole, Uzi Vishkin. 478-491
- An Optimal Randomized Parallel Algorithm for Finding Connected Components in a GraphHillel Gazit. 492-501
- Tight Complexity Bounds for Parallel Comparison SortingNoga Alon, Yossi Azar, Uzi Vishkin. 502-510
- Parallel Merge SortRichard Cole. 511-516