17. STOC 1985: Providence, Rhode Island, USA
(Ed.): Proceedings of the 17th Annual ACM Symposium on Theory of Computing, May 6-8, 1985, Providence, Rhode Island, USA.
: A Simple Parallel Algorithm for the Maximal Independent Set Problem.
: Tradeoffs for VLSI Models with Subpolynomial Delay.
: Expanders, Sorting in Rounds and Superconcentrators of Limited Depth.
: Computing with Polynomials Given by Straight-Line Programs I: Greatest Common Divisors.
Pravin M. Vaidya
: Space-Time Tradeoffs for Orthogonal Range Queries (Extended Abstract).
: A Linear Time Algorithm for Finding Dominators in Flow Graphs and Related Problems.
: Concurrent Dynamic Logic (Extended Abstract).
Kim B. Bruce
, Giuseppe Longo
: Provable Isomorphisms and Domain Equations in Models of Typed Languages (Preliminary Version).
Samuel R. Buss
: The Polynomial Hierarchy and Fragments of Bounded Arithmetic (Extended Abstract).
: An O(\mathop lg n) Expected Rounds Randomized Byzantine Generals Protocol.
: Fault Tolerance of Minimal Path Routings in a Network.
Umesh V. Vazirani
: Towards a Strong Communication Complexity Theory or Generating Quasi-Random Sequences from Two Communicating Slightly-random Sources (Extended Abstract).
: Doubly Lexical Orderings of Matrices.
Dung T. Huynh
: The Complexity of the Equivalence Problem for Commutative Semigroups and Symmetric Vector Addition Systems.