Abstract is missing.
- Solving Low-Density Subset Sum ProblemsJ. C. Lagarias, Andrew M. Odlyzko. 1-10
- How to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically-Biased CoinMichael Luby, Silvio Micali, Charles Rackoff. 11-21
- Trapdoor Pseudo-random Number Generators, with Applications to Protocol DesignUmesh V. Vazirani, Vijay V. Vazirani. 23-30
- A Topological Approach to EvasivenessJeff Kahn, Michael E. Saks, Dean Sturtevant. 31-33
- On the Security of Multi-Party Ping-Pong ProtocolsShimon Even, Oded Goldreich. 34-39
- The Program Complexity of Searching a TableHarry G. Mairson. 40-47
- Improved Upper Bounds on ShellsortJanet Incerpi, Robert Sedgewick. 48-55
- Monte-Carlo Algorithms for Enumeration and Reliability ProblemsRichard M. Karp, Michael Luby. 56-64
- Optimum Algorithms for Two Random Sampling Problems (Extended Abstract)Jeffrey Scott Vitter. 65-75
- Probabilistic CountingPhilippe Flajolet, G. Nigel Martin. 76-82
- Constructing Arrangements of Lines and Hyperplanes with ApplicationsHerbert Edelsbrunner, Joseph O Rourke, Raimund Seidel. 83-91
- Dynamic Computational Geometry (Preliminary Version)Mikhail J. Atallah. 92-99
- A Kinetic Framework for Computational GeometryLeonidas J. Guibas, Lyle Ramshaw, Jorge Stolfi. 100-111
- Geometric Retrieval ProblemsRichard Cole, Chee-Keng Yap. 112-121
- Filtering Search: A New Approach to Query-AnsweringBernard Chazelle. 122-132
- Representations of Rational FunctionsJoachim von zur Gathen. 133-137
- Logarithmic Depth Circuits for Algebraic FunctionsJohn H. Reif. 138-145
- Trade-Offs between Depth and Width in Parallel Computation (Preliminary Version)Uzi Vishkin, Avi Wigderson. 146-153
- The Parallel Complexity of the Abelian Permutation Group Membership ProblemPierre McKenzie, Stephen A. Cook. 154-161
- Computational Complexity and the Classification of Finite Simple GroupsLászló Babai, William M. Kantor, Eugene M. Luks. 162-171
- Factoring Sparse Multivariate PolynomialsJoachim von zur Gathen. 172-179
- Some Relationships between Logics of Programs and Complexity Theory (Extended Abstract)Jerzy Tiuryn, Pawel Urzyczyn. 180-184
- Reasoning about Infinite Computation Paths (Extended Abstract)Pierre Wolper, Moshe Y. Vardi, A. Prasad Sistla. 185-194
- Propositional Game LogicRohit Parikh. 195-200
- Decision Procedures for Time and Chance (Extended Abstract)Sarit Kraus, Daniel J. Lehmann. 202-209
- Algebras of Feasible FunctionsYuri Gurevich. 210-214
- On Context-Free GeneratorsJoffroy Beauquier, Françoise Gire. 215
- The Power of Geometric DualityBernard Chazelle, Leonidas J. Guibas, D. T. Lee. 217-225
- Fast Algorithms for the All Nearest Neighbors ProblemKenneth L. Clarkson. 226-232
- Minimum Partition of Polygonal Regions into TrapezoidsTetsuo Asano, Takao Asano. 233-241
- Shortest Path Problems in Planar Graphs (Preliminary Version)Greg N. Frederickson. 242-247
- Scaling Algorithms for Network ProblemsHarold N. Gabow. 248-257
- Partition of Planar Flow Networks (Preliminary Version)Donald B. Johnson, Shankar M. Venkatesan. 259-263
- Approximation Algorithms for NP-Complete Problems on Planar Graphs (Preliminary Version)Brenda S. Baker. 265-273
- A Polynomial Algorithm for the Min Cut Linear Arrangement of Trees (Extended Abstract)Mihalis Yannakakis. 274-281
- Tree Structures for Partial Match RetrievalPhilippe Flajolet, Claude Puech. 282-288
- Bin Packing with Items Uniformly Distributed over Intervals [a,b]George S. Lueker. 289-297
- Hash Functions for Priority QueuesMiklós Ajtai, Michael L. Fredman, János Komlós. 299-303
- Lower Bounds on Graph Threading by Probabilistic Machines (Preliminary Version)Piotr Berman, Janos Simon. 304-311
- On the Computational Complexity of the Permanent (Extended Abstract)Joseph JáJá. 312-319
- Multiplication Is the Easiest Nontrivial Arithmetic FunctionHelmut Alt. 320-322
- On Depth-Reduction and GratesGeorg Schnitger. 323-328
- Relativized Circuit ComplexityChristopher B. Wilson. 329-334
- Randomness and the Density of Hard ProblemsRobert E. Wilber. 335-342
- Lower Bounds on the Time of Probabilistic On-Line Simulations (Preliminary Version)Ramamohan Paturi, Janos Simon. 343-350
- Techniques for Solving Graph Problems in Parallel EnvironmentsPeter H. Hochschild, Ernst W. Mayr, Alan R. Siegel. 351-359
- An Algorithm for the Optimal Placement and Routing of a Circuit within a Ring of Pads (Extended Abstract)Brenda S. Baker, Ron Y. Pinter. 360-370
- Period-Time Tradeoffs for VLSI Models with Delay (Preliminary Version)Alok Aggarwal. 372-382
- Estimating the Multiplicities of Conflicts in Multiple Access Channels (Preliminary Report)Albert G. Greenberg, Richard E. Ladner. 383-392
- On the Minimal Synchronism Needed for Distributed ConsensusDanny Dolev, Cynthia Dwork, Larry J. Stockmeyer. 393-402
- Randomized Byzantine GeneralsMichael O. Rabin. 403-409
- A Tight Bound for Black and White Pebbles on the PyramidMaria M. Klawe. 410-419
- Lower Bounds by Probabilistic Arguments (Extended Abstract)Andrew Chi-Chih Yao. 420-428
- On Determinism versus Non-Determinism and Related Problems (Preliminary Version)Wolfgang J. Paul, Nicholas Pippenger, Endre Szemerédi, William T. Trotter. 429-438
- Generalized Kolmogorov Complexity and the Structure of Feasible Computations (Preliminary Report)Juris Hartmanis. 439-445
- Games Against Nature (Extended Abstract)Christos H. Papadimitriou. 446-450
- Global Wire Routing in Two-Dimensional Arrays (Extended Abstract)Richard M. Karp, Frank Thomson Leighton, Ronald L. Rivest, Clark D. Thompson, Umesh V. Vazirani, Vijay V. Vazirani. 453-459
- Reasoning about Functional Programs and Complexity Classes Associated with Type DisciplinesDaniel Leivant. 460-469
- Legal Coloring of GraphsNathan Linial. 470-472
- Information Bounds Are Good for Search Problems on Ordered Data StructuresNathan Linial, Michael E. Saks. 473-475