16. STOC 1984: Washington, DC, USA
Richard A. DeMillo
(Ed.): Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30 - May 2, 1984, Washington, DC, USA.
: Transition Logic: How to Reason About Temporal Properties in a Compositional Way.
: An Area-Maximum Edge Length Tradeoff for VLSI Layout.
Ming-Deh A. Huang
: Factorization of Polynomials over Finite Fields and Factorization of Primes in Algebraic Number Fields.
: Randomized Speed-Ups in Parallel Computation.
: Optimal Parallel Algorithms for String Matching.
: A Probabilistic Relation between Desirable and Feasible Models of Parallel Computation (A Preliminary Version).
: On Maintaining Dynamic Information in a Concurrent Environment (Preliminary Version).
, Nimrod Megiddo
: A Simplex Algorithm Whose Average Number of Steps is Bounded between Two Quadratic Functions of the Smaller Dimension.
Gaston H. Gonnet
: Determining Equivalence of Expressions in Random Polynomial Time (Extended Abstract).
Kenneth L. Clarkson
: Fast Expected-Time and Approximation Algorithms for Geometric Minimum Spanning Trees (Extended Abstract).
Gary L. Miller
: Finding Small Simple Cycle Separators for 2-Connected Planar Graphs.
: Quadratic Lower Bounds for Deterministic and Nondeterministic One-Tape Turing Machines (Extended Abstract).
: A General Result on Infinite Trees and Its Applications (Preliminary Report).
: Pebblings, Edgings, and Equational Logic.
: Comparison of Arithmetic Functions with Respect to Boolean Circuit Depth (Extended Abstract).
Ravi B. Boppana
: Threshold Functions and Bounded Depth Monotone Circuits.
Dan E. Willard
: Log-Logarithmic Protocols for Resolving Ethernet and Semaphore Conflicts (Preliminary Report).
Paul M. B. Vitányi
: Distributed Elections in an Archimedean Ring of Processors (Preliminary Version).