Abstract is missing.
- A Simple Parallel Algorithm for the Maximal Independent Set ProblemMichael Luby. 1-10
- The Two-Processor Scheduling Problem is in R-NCUmesh V. Vazirani, Vijay V. Vazirani. 11-21
- Constructing a Perfect Matching is in Random NCRichard M. Karp, Eli Upfal, Avi Wigderson. 22-32
- A Parallel Algorithm for the Maximal Path ProblemRichard Anderson. 33-37
- The Parallel Complexity of Exponentiating Polynomials over Finite FieldsFaith E. Fich, Martin Tompa. 38-47
- One, Two, Three /dots Infinity: Lower Bounds for Parallel ComputationFaith E. Fich, Friedhelm Meyer auf der Heide, Prabhakar Ragde, Avi Wigderson. 48-58
- Tradeoffs for VLSI Models with Subpolynomial DelayAlok Aggarwal. 59-68
- Algorithms for Routing and Testing Routability of Planar VLSI LayoutsCharles E. Leiserson, F. Miller Maley. 69-78
- Provably Good Routing in Graphs: Regular ArraysPrabhakar Raghavan, Clark D. Thompson. 79-87
- Expanders Obtained from Affine Transformations (Preliminary Version)Shuji Jimbo, Akira Maruoka. 88-97
- Expanders, Sorting in Rounds and Superconcentrators of Limited DepthNoga Alon. 98-102
- White Pebbles HelpRobert E. Wilber. 103-112
- Stable Prehension with Three FingersBrenda S. Baker, Steven Fortune, Eric Grosse. 114-120
- Riemann Hypothesis and Finding Roots over Finite FieldsMing-Deh A. Huang. 121-130
- Computing with Polynomials Given by Straight-Line Programs I: Greatest Common DivisorsErich Kaltofen. 131-142
- Efficient Parallel Solution of Linear SystemsVictor Y. Pan, John H. Reif. 143-152
- Polynomial Time Solutions of Some Problems in Computational AlgebraKatalin Friedl, Lajos Rónyai. 153-162
- A General Approach to d-Dimensional Geometric Queries (Extended Abstract)Andrew Chi-Chih Yao, F. Frances Yao. 163-168
- Space-Time Tradeoffs for Orthogonal Range Queries (Extended Abstract)Pravin M. Vaidya. 169-174
- A Probabilistic Algorithm for the Post Office ProblemKenneth L. Clarkson. 175-184
- A Linear Time Algorithm for Finding Dominators in Flow Graphs and Related ProblemsDov Harel. 185-194
- Multicommodity Flows in Planar Undirected Graphs and Shortest PathsHitoshi Suzuki, Takao Nishizeki, Nobuji Saito. 195-204
- The Effect of Updates in Binary Search TreesJoseph C. Culberson. 205-212
- Finding the Median Requires 2n ComparisonsSamuel W. Bent, John W. John. 213-216
- Self-Organizing Sequential Search and Hilbert s InequalitiesFan R. K. Chung, D. J. Hajela, Paul D. Seymour. 217-223
- On the Expected Behaviour of Disjoint Set Union AlgorithmsBéla Bollobás, István Simon. 224-231
- Concurrent Dynamic Logic (Extended Abstract)David Peleg. 232-239
- Improved Upper and Lower Bounds for Modal Logics of Programs: Preliminary ReportMoshe Y. Vardi, Larry J. Stockmeyer. 240-251
- Transition Systems, Infinitary Languages and the Semantics of Uniform ConcurrencyJ. W. de Bakker, John-Jules Ch. Meyer, Ernst-Rüdiger Olderog, Jeffery I. Zucker. 252-262
- Provable Isomorphisms and Domain Equations in Models of Typed Languages (Preliminary Version)Kim B. Bruce, Giuseppe Longo. 263-272
- Equational Theories and Database ConstraintsStavros S. Cosmadakis, Paris C. Kanellakis. 273-284
- The Polynomial Hierarchy and Fragments of Bounded Arithmetic (Extended Abstract)Samuel R. Buss. 285-290
- The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract)Shafi Goldwasser, Silvio Micali, Charles Rackoff. 291-304
- An Internal Semantics for Modal Logic: Preliminary ReportRonald Fagin, Moshe Y. Vardi. 305-315
- An O(/mathop lg n) Expected Rounds Randomized Byzantine Generals ProtocolGabriel Bracha. 316-326
- Fault Tolerance of Minimal Path Routings in a NetworkPaul Feldman. 327-334
- The Distributed Firing Squad Problem (Preliminary Version)Brian A. Coan, Danny Dolev, Cynthia Dwork, Larry J. Stockmeyer. 335-345
- Optimal Precision in the Presence of Uncertainty (Preliminary Version)Joseph Y. Halpern, Nimrod Megiddo, Ashfaq A. Munshi. 346-355
- The Cryptographic Security of Truncated Linearly Related VariablesJohan Håstad, Adi Shamir. 356-362
- One-Way Functions and Pseudorandom GeneratorsLeonid A. Levin. 363-365
- Towards a Strong Communication Complexity Theory or Generating Quasi-Random Sequences from Two Communicating Slightly-random Sources (Extended Abstract)Umesh V. Vazirani. 366-378
- On the Stability of the EthernetJonathan Goodman, Albert G. Greenberg, Neal Madras, Peter March. 379-387
- A Simple Three-Dimensional Real-Time Reliable Cellular ArrayPéter Gács, John H. Reif. 388-395
- Doubly Lexical Orderings of MatricesAnna Lubiw. 396-404
- The Complexity of the Equivalence Problem for Commutative Semigroups and Symmetric Vector Addition SystemsDung T. Huynh. 405-412
- Fast Algorithms for N-Dimensional Restrictions of Hard ProblemsFriedhelm Meyer auf der Heide. 413-420
- Trading Group Theory for RandomnessLászló Babai. 421-429
- An Algorithm for Finding Hamilton Cycles in a Random GraphBéla Bollobás, Trevor I. Fenner, Alan M. Frieze. 430-439
- Compression and RankingAndrew V. Goldberg, Michael Sipser. 440-448
- The Complexity of Backtrack Searches (Preliminary Version)Larry Carter, Larry J. Stockmeyer, Mark N. Wegman. 449-457
- NP Is as Easy as Detecting Unique SolutionsLeslie G. Valiant, Vijay V. Vazirani. 458-463
- Are Search and Decision Problems Computationally Equivalent?Richard M. Karp, Eli Upfal, Avi Wigderson. 464-475
- Dual Integer Linear Programs and the Relationship between their OptimaRon Aharoni, Paul Erdös, Nathan Linial. 476-483