Abstract is missing.
- An O(n log n) Sorting NetworkMiklós Ajtai, János Komlós, Endre Szemerédi. 1-9
- A Logarithmic Time Sort for Linear Size NetworksJohn H. Reif, Leslie G. Valiant. 10-16
- Parallel algorithms for algebraic problemsJoachim von zur Gathen. 17-23
- Topological MatchingQuentin F. Stout. 24-31
- Reliable Computation with Cellular AutomataPéter Gács. 32-41
- Superconcentrators, Generalizers and Generalized Connectors with Limited Depth (Preliminary Version)Danny Dolev, Cynthia Dwork, Nicholas Pippenger, Avi Wigderson. 42-51
- Unbounded Fan-in Circuits and Associative FunctionsAshok K. Chandra, Steven Fortune, Richard J. Lipton. 52-60
- Borel Sets and Circuit ComplexityMichael Sipser. 61-69
- A Polynomial Linear Search Algorithm for the N-Dimensional Knapsack ProblemFriedhelm Meyer auf der Heide. 70-79
- Lower Bounds for Algebraic Computation Trees (Preliminary Report)Michael Ben-Or. 80-86
- Bounds for Width Two Branching ProgramsAllan Borodin, Danny Dolev, Faith E. Fich, Wolfgang J. Paul. 87-93
- Multi-Party ProtocolsAshok K. Chandra, Merrick L. Furst, Richard J. Lipton. 94-99
- New Bounds for Parallel Prefix CircuitsFaith E. Fich. 100-109
- Exponential Lower Bounds for Restricted Monotone CircuitsLeslie G. Valiant. 110-117
- The Complexity of Approximate Counting (Preliminary Version)Larry J. Stockmeyer. 118-126
- Two Nonlinear Lower BoundsPavol Duris, Zvi Galil, Wolfgang J. Paul, Rüdiger Reischuk. 127-132
- On Notions of Information Transfer in VLSI CircuitsAlfred V. Aho, Jeffrey D. Ullman, Mihalis Yannakakis. 133-139
- Solvability by Radicals is in Polynomial TimeSusan Landau, Gary L. Miller. 140-151
- On the Diameter of Permutation GroupsJames R. Driscoll, Merrick L. Furst. 152-160
- Normal Forms for Trivalent Graphs and Graphs of Bounded ValenceMartin Fürer, Walter Schnyder, Ernst Specker. 161-170
- Canonical Labeling of GraphsLászló Babai, Eugene M. Luks. 171-183
- How to Generate Random Integers with Known FactorizationEric Bach. 184-188
- Factoring Multivariate Polynomials over Finite Fields (Extended Abstract)Arjen K. Lenstra. 189-192
- Improved Algorithms for Integer Programming and Related Lattice ProblemsRavi Kannan. 193-206
- Retraction: A New Approach to Motion-Planning (Extended Abstract)Colm Ó Dúnlaing, Micha Sharir, Chee-Keng Yap. 207-220
- Primitives for the Manipulation of General Subdivisions and the Computation of Voronoi DiagramsLeonidas J. Guibas, Jorge Stolfi. 221-234
- Self-Adjusting Binary TreesDaniel Dominic Sleator, Robert Endre Tarjan. 235-245
- A Linear-Time Algorithm for a Special Case of Disjoint Set UnionHarold N. Gabow, Robert Endre Tarjan. 246-251
- Data Structures for On-Line Updating of Minimum Spanning Trees (Preliminary Version)Greg N. Frederickson. 252-257
- A 3-Space Partition and Its Applications (Extended Abstract)F. Frances Yao. 258-263
- Unary Inclusion Dependencies have Polynomial Time Inference Problems (Extended Abstract)Paris C. Kanellakis, Stavros S. Cosmadakis, Moshe Y. Vardi. 264-277
- On the Extremely Fair Treatment of Probabilistic AlgorithmsAmir Pnueli. 278-290
- A Probabilistic PDLDexter Kozen. 291-297
- A Decidable Propositional Probabilistic Dynamic LogicYishai A. Feldman. 298-309
- A Logic to Reason about LikelihoodJoseph Y. Halpern, Michael O. Rabin. 310-319
- A Characterization of Hoare s Logic for Programs with Pascal-like ProceduresErnst-Rüdiger Olderog. 320-329
- A Complexity Theoretic Approach to RandomnessMichael Sipser. 330-335
- Speedups of Deterministic Machines by Synchronous Parallel MachinesPatrick W. Dymond, Martin Tompa. 336-343
- Alternation and the Power of NondeterminismRavi Kannan. 344-346
- Languages Which Capture Complexity Classes (Preliminary Report)Neil Immerman. 347-354
- The Random Access Hierarchy (Preliminary Report)Dale Myers. 355-364
- Iterated Pushdown Automata and Complexity ClassesJoost Engelfriet. 365-373
- Unique Decomposability of Shuffled Strings: A Formal Treatment of Asynchronous Time-Multiplexed CommunicationKazuo Iwama. 374-381
- Sparse Sets in NP-P: EXPTIME versus NEXPTIMEJuris Hartmanis, Vivian Sewelson, Neil Immerman. 382-391
- Some Structural Properties of Polynomial Reducibilities and Sets in NPPaul Young. 392-401
- On Breaking Generalized Knapsack Public Key Cryptosystems (Abstract)Leonard M. Adleman. 402-412
- How Discreet is the Discrete Log?Douglas L. Long, Avi Wigderson. 413-420
- On the Cryptographic Security of Single RSA BitsMichael Ben-Or, Benny Chor, Adi Shamir. 421-430
- Strong Signature SchemesShafi Goldwasser, Silvio Micali, Andrew Chi-Chih Yao. 431-439
- How to Exchange (Secret) Keys (Extended Abstract)Manuel Blum. 440-447
- An Efficient Reduction Technique for Degree-Constrained Subgraph and Bidirected Network Flow ProblemsHarold N. Gabow. 448-456
- Transitive Orientation in O(n²) TimeJeremy Spinrad. 457-466
- Probabilistic Analysis of Bandwidth Minimization AlgorithmsJonathan S. Turner. 467-476
- An Approximation Algorithm for Manhattan Routing (Extended Abstract)Brenda S. Baker, Sandeep N. Bhatt, Frank Thomson Leighton. 477-486