Abstract is missing.
- Matrix Multiplication via Arithmetic ProgressionsDon Coppersmith, Shmuel Winograd. 1-6
- Solving Minimum-Cost Flow Problems by Successive ApproximationAndrew V. Goldberg, Robert Endre Tarjan. 7-18
- A New Approach to All Pairs Shortest Paths in Planar Graphs (Extended Abstract)Greg N. Frederickson. 19-28
- An Algorithm for Linear Programming which Requires O(((m+n)n^2 + (m+n)^1.5 n)L) Arithmetic OperationsPravin M. Vaidya. 29-38
- A Linear Time Algorithm for Computing the Voronoi Diagram of a Convex PolygonAlok Aggarwal, Leonidas J. Guibas, James B. Saxe, Peter W. Shor. 39-45
- Testing for Cycles in Infinite Graphs with Periodic Structure (Extended Abstract)Kazuo Iwano, Kenneth Steiglitz. 46-55
- Approximation Algorithms for Shortest Path Motion Planning (Extended Abstract)Kenneth L. Clarkson. 56-65
- The Complexity of Cutting Convex PolytopesBernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas. 66-76
- Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit ComplexityRoman Smolensky. 77-82
- Optimal Bounds for Decision Problems on the CRCW PRAMPaul Beame, Johan Håstad. 83-93
- Two Tapes Are Better than One for Off-Line Turing MachinesWolfgang Maass, Georg Schnitger, Endre Szemerédi. 94-100
- Finite Monoids and the Fine Structure of NC¹David A. Mix Barrington, Denis Thérien. 101-109
- The Strong Exponential Hierarchy CollapsesLane A. Hemachandra. 110-122
- The Boolean Formula Value Problem Is in ALOGTIMESamuel R. Buss. 123-131
- Deterministic Simulation in LOGSPACEMiklós Ajtai, János Komlós, Endre Szemerédi. 132-140
- Properties that Characterize LOGCFLH. Venkateswaran. 141-150
- Some Consequences of the Existence of Pseudorandom GeneratorsEric Allender. 151-159
- Efficiency Considerations in Using Semi-random Sources (Extended Abstract)Umesh V. Vazirani. 160-168
- Imperfect Random Sources and Discrete Controlled ProcessesDavid Lichtenstein, Nathan Linial, Michael E. Saks. 169-177
- The Power of Randomness for Communication Complexity (Preliminary Version)Martin Fürer. 178-181
- Towards a Theory of Software Protection and Simulation by Oblivious RAMsOded Goldreich. 182-194
- On Hiding Information from an Oracle (Extended Abstract)Martín Abadi, Joan Feigenbaum, Joe Kilian. 195-203
- The Complexity of Perfect Zero-Knowledge (Extended Abstract)Lance Fortnow. 204-209
- Zero Knowledge Proofs of IdentityUriel Feige, Amos Fiat, Adi Shamir. 210-217
- How to Play any Mental Game or A Completeness Theorem for Protocols with Honest MajorityOded Goldreich, Silvio Micali, Avi Wigderson. 218-229
- Optimal Distributed Algorithms for Minimum Weight Spanning Tree, Counting, Leader Election and Related Problems (Detailed Summary)Baruch Awerbuch. 230-240
- Analysis of Backoff Protocols for Multiple Access Channels (Extended Abstract)Johan Håstad, Frank Thomson Leighton, Brian Rogoff. 241-253
- Dynamic Parallel Complexity of Computational CircuitsGary L. Miller, Shang-Hua Teng. 254-263
- Constructing Disjoint Paths on Expander Graphs (Extended Abstract)David Peleg, Eli Upfal. 264-273
- Reconfiguring a Hypercube in the Presence of Faults (Extended Abstract)Johan Håstad, Frank Thomson Leighton, Mark Newman. 274-284
- On the Learnability of Boolean FormulaeMichael J. Kearns, Ming Li, Leonard Pitt, Leslie G. Valiant. 285-295
- On Learning Boolean FunctionsB. K. Natarajan. 296-304
- A Model for Hierarchical MemoryAlok Aggarwal, Bowen Alpern, Ashok K. Chandra, Marc Snir. 305-314
- Parallel Symmetry-Breaking in Sparse GraphsAndrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon. 315-324
- A Random NC Algorithm for Depth First SearchAlok Aggarwal, Richard J. Anderson. 325-334
- A New Graph Triconnectivity Algorithm and Its ParallelizationGary L. Miller, Vijaya Ramachandran. 335-344
- Matching Is as Easy as Matrix InversionKetan Mulmuley, Umesh V. Vazirani, Vijay V. Vazirani. 345-354
- Fast Parallel Algorithms for Chordal Graphs (Extended Abstract)Joseph Naor, Moni Naor, Alejandro A. Schäffer. 355-364
- Two Algorithms for Maintaining Order in a ListPaul F. Dietz, Daniel Dominic Sleator. 365-372
- An Optimal Online Algorithm for Metrical Task SystemsAllan Borodin, Nathan Linial, Michael E. Saks. 373-382
- Searching a Two Key Table Under a Single KeyJ. Ian Munro. 383-387
- The Pagenumber of Genus g Graphs is O(g)Lenwood S. Heath, Sorin Istrail. 388-397
- Simple Algebras Are DifficultLajos Rónyai. 398-408
- Permutation Groups in NCLászló Babai, Eugene M. Luks, Ákos Seress. 409-420
- Threshold Spectra for Random GraphsSaharon Shelah, Joel Spencer. 421-424
- The Decision Problem for the Probabilities of Higher-Order PropertiesPhokion G. Kolaitis, Moshe Y. Vardi. 425-435
- Size-Time Complexity of Boolean Networks for Prefix ComputationsGianfranco Bilardi, Franco P. Preparata. 436-442
- Single-Factor Hensel Lifting and its Application to the Straight-Line Complexity of Certain PolynomialsErich Kaltofen. 443-452
- Realistic Analysis of Some Randomized AlgorithmsEric Bach. 453-461
- Recognizing Primes in Random Polynomial TimeLeonard M. Adleman, Ming-Deh A. Huang. 462-469