Abstract is missing.
- Polytope Range Searching and Integral Geometry (Extended Abstract)Bernard Chazelle. 1-10
- An Output Sensitive Algorithm for Computing Visibility GraphsSubir Kumar Ghosh, David M. Mount. 11-19
- Delaunay Graphs are Almost as Good as Complete GraphsDavid P. Dobkin, Steven J. Friedman, Kenneth J. Supowit. 20-26
- On the Lower Envelope of Bivariate Functions and its ApplicationsHerbert Edelsbrunner, János Pach, Jacob T. Schwartz, Micha Sharir. 27-37
- A New Algebraic Method for Robot Motion Planning and Real GeometryJohn F. Canny. 39-48
- New Lower Bound Techniques for Robot Motion Planning ProblemsJohn F. Canny, John H. Reif. 49-60
- Learning One-Counter Languages in Polynomial Time (Extended Abstract)Piotr Berman, Robert Roos. 61-67
- Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm (Extended Abstract)Nick Littlestone. 68-77
- Diversity-Based Inference of Finite Automata (Extended Abstract)Ronald L. Rivest, Robert E. Schapire. 78-87
- Incomparability in Parallel ComputationVince Grolmusz, Prabhakar Ragde. 89-98
- Threshold circuits of bounded depthAndrás Hajnal, Wolfgang Maass, Pavel Pudlák, Mario Szegedy, György Turán. 99-110
- Complete and Incomplete Randomized NP ProblemsYuri Gurevich. 111-117
- Generic Oracles and Oracle Classes (Extended Abstract)Manuel Blum, Russell Impagliazzo. 118-126
- Functional Decomposition of PolynomialsJoachim von zur Gathen, Dexter Kozen, Susan Landau. 127-131
- Factoring Polynomials over Finite FieldsLajos Rónyai. 132-137
- Multiplicative complexity of polynomial multiplication over finite fields (Extended abstract)Michael Kaminski, Nader H. Bshouty. 138-140
- The Multiplicative Complexity of Quadratic Boolean FormsRoland Mirwald, Claus-Peter Schnorr. 141-150
- Cascading Divide-and-Conquer: A Technique for Designing Parallel AlgorithmsMikhail J. Atallah, Richard Cole, Michael T. Goodrich. 151-160
- A New Parallel Algorithm for the Maximal Independent Set ProblemMark K. Goldberg, Thomas H. Spencer. 161-165
- The Matching Problem for Bipartite Graphs with Polynomially Bounded Permanents Is in NC (Extended Abstract)Dima Grigoriev, Marek Karpinski. 166-172
- Some Polynomial and Toeplitz Matrix ComputationsVictor Y. Pan, John H. Reif. 173-184
- How to emulate shared memory (Preliminary Version)Abhiram G. Ranade. 185-194
- The Complexity of Parallel Comparison MergingMihály Geréb-Graus, Danny Krizanc. 195-201
- Hierarchical Memory with Block TransferAlok Aggarwal, Ashok K. Chandra, Marc Snir. 204-216
- Approximation Algorithms for Scheduling Unrelated Parallel MachinesJan Karel Lenstra, David B. Shmoys, Éva Tardos. 217-224
- Finding Near Optimal Separators in Planar GraphsSatish Rao. 225-237
- A Parallel Algorithm for Finding a Separator in Planar GraphsHillel Gazit, Gary L. Miller. 238-248
- Determining Edge Connectivity in O(nm)David W. Matula. 249-251
- Improved Algorithms for Graph Four-ConnectivityArkady Kanevsky, Vijaya Ramachandran. 252-259
- Parallel Graph Algorithms that Are Efficient on AverageDon Coppersmith, Prabhakar Raghavan, Martin Tompa. 260-269
- Canonical Labeling of Regular Graphs in Linear Average TimeLudek Kucera. 271-279
- Eigenvalues and Graph Bisection: An Average-Case Analysis (Extended Abstract)Ravi B. Boppana. 280-285
- On the Second Eigenvalue of Random Regular Graphs (Preliminary Version)Andrei Z. Broder, Eli Shamir. 286-294
- Recursive Construction for 3-Regular ExpandersMiklós Ajtai. 295-304
- The Organization of Permutation Architectures with Bussed Interconnections (Extended Abstract)Joe Kilian, Shlomo Kipnis, Charles E. Leiserson. 305-315
- Channel Routing of Multiterminal NetsShaodi Gao, Michael Kaufmann. 316-325
- Two Lower Bounds in Asynchronous Distributed Computation (Preliminary Version)Pavol Duris, Zvi Galil. 326-330
- Distributive Graph Algorithms-Global Solutions from Local DataNathan Linial. 331-335
- Achievable Cases in an Asynchronous Environment (Extended Abstract)Hagit Attiya, Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg, Rüdiger Reischuk. 337-346
- Local Management of a Global Resource in a Communication NetworkYehuda Afek, Baruch Awerbuch, Serge A. Plotkin, Michael E. Saks. 347-357
- Applying Static Network Protocols to Dynamic NetworksYehuda Afek, Baruch Awerbuch, Eli Gafni. 358-370
- Bounded Time-Stamps (Extended Abstract)Amos Israeli, Ming Li. 371-382
- Concurrent Reading While Writing II: The Multi-writer CaseGary L. Peterson, James E. Burns. 383-392
- Lower Bounds to Randomized Algorithms for Graph Properties (Extended Abstract)Andrew Chi-Chih Yao. 393-400
- Exponential Lower Bounds for Finding Brouwer Fixed Points (Extended Abstract)Michael D. Hirsch, Stephen A. Vavasis. 401-410
- Database Theory and Cylindric Lattices (Extended Abstract)Stavros S. Cosmadakis. 411-420
- Secret Linear Congruential Generators Are Not Cryptographically SecureJacques Stern. 421-426
- A Practical Scheme for Non-interactive Verifiable Secret SharingPaul Feldman. 427-437
- Perfect Zero-Knowledge Languages Can Be Recognized in Two RoundsWilliam Aiello, Johan Håstad. 439-448
- Interactive Proof Systems: Provers that never Fail and Random Selection (Extended Abstract)Oded Goldreich, Yishay Mansour, Michael Sipser. 449-461
- On the Cunning Power of Cheating Verifiers: Some Observations about Zero Knowledge Proofs (Extended Abstract)Yair Oren. 462-471
- Random Self-Reducibility and Zero Knowledge Interactive Proofs of Possession of InformationMartin Tompa, Heather Woll. 472-482
- Correction to A Linear-Time Algorithm for Triangulating Simple Polygons Robert Endre Tarjan, Christopher J. Van Wyk. 486
- Errata to Atomic Shared Register Access by Asynchronous Hardware Paul M. B. Vitányi, Baruch Awerbuch. 487
- The Average Complexity of Deterministic and Randomized Parallel Comparison Sorting AlgorithmsNoga Alon, Yossi Azar. 489-498