Conferences in DBLP
Michael Luby A Simple Parallel Algorithm for the Maximal Independent Set Problem [Citation Graph (0, 0)][DBLP ] Conf ] Umesh V. Vazirani , Vijay V. Vazirani The Two-Processor Scheduling Problem is in R-NC [Citation Graph (0, 0)][DBLP ] Conf ] Richard M. Karp , Eli Upfal , Avi Wigderson Constructing a Perfect Matching is in Random NC [Citation Graph (1, 0)][DBLP ] Conf ] Richard Anderson A Parallel Algorithm for the Maximal Path Problem [Citation Graph (0, 0)][DBLP ] Conf ] Faith E. Fich , Martin Tompa The Parallel Complexity of Exponentiating Polynomials over Finite Fields [Citation Graph (0, 0)][DBLP ] Conf ] Faith E. Fich , Friedhelm Meyer auf der Heide , Prabhakar Ragde , Avi Wigderson One, Two, Three \dots Infinity: Lower Bounds for Parallel Computation [Citation Graph (0, 0)][DBLP ] Conf ] Alok Aggarwal Tradeoffs for VLSI Models with Subpolynomial Delay [Citation Graph (0, 0)][DBLP ] Conf ] Charles E. Leiserson , F. Miller Maley Algorithms for Routing and Testing Routability of Planar VLSI Layouts [Citation Graph (0, 0)][DBLP ] Conf ] Prabhakar Raghavan , Clark D. Thompson Provably Good Routing in Graphs: Regular Arrays [Citation Graph (0, 0)][DBLP ] Conf ] Shuji Jimbo , Akira Maruoka Expanders Obtained from Affine Transformations (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon Expanders, Sorting in Rounds and Superconcentrators of Limited Depth [Citation Graph (0, 0)][DBLP ] Conf ] Robert E. Wilber White Pebbles Help [Citation Graph (0, 0)][DBLP ] Conf ] Brenda S. Baker , Steven Fortune , Eric Grosse Stable Prehension with Three Fingers [Citation Graph (0, 0)][DBLP ] Conf ] Ming-Deh A. Huang Riemann Hypothesis and Finding Roots over Finite Fields [Citation Graph (0, 0)][DBLP ] Conf ] Erich Kaltofen Computing with Polynomials Given by Straight-Line Programs I: Greatest Common Divisors [Citation Graph (0, 0)][DBLP ] Conf ] Victor Y. Pan , John H. Reif Efficient Parallel Solution of Linear Systems [Citation Graph (0, 0)][DBLP ] Conf ] Katalin Friedl , Lajos Rónyai Polynomial Time Solutions of Some Problems in Computational Algebra [Citation Graph (0, 0)][DBLP ] Conf ] Andrew Chi-Chih Yao , F. Frances Yao A General Approach to d-Dimensional Geometric Queries (Extended Abstract) [Citation Graph (2, 0)][DBLP ] Conf ] Pravin M. Vaidya Space-Time Tradeoffs for Orthogonal Range Queries (Extended Abstract) [Citation Graph (2, 0)][DBLP ] Conf ] Kenneth L. Clarkson A Probabilistic Algorithm for the Post Office Problem [Citation Graph (0, 0)][DBLP ] Conf ] Dov Harel A Linear Time Algorithm for Finding Dominators in Flow Graphs and Related Problems [Citation Graph (0, 0)][DBLP ] Conf ] Hitoshi Suzuki , Takao Nishizeki , Nobuji Saito Multicommodity Flows in Planar Undirected Graphs and Shortest Paths [Citation Graph (0, 0)][DBLP ] Conf ] Joseph C. Culberson The Effect of Updates in Binary Search Trees [Citation Graph (0, 0)][DBLP ] Conf ] Samuel W. Bent , John W. John Finding the Median Requires 2n Comparisons [Citation Graph (0, 0)][DBLP ] Conf ] Fan R. K. Chung , D. J. Hajela , Paul D. Seymour Self-Organizing Sequential Search and Hilbert's Inequalities [Citation Graph (0, 0)][DBLP ] Conf ] Béla Bollobás , István Simon On the Expected Behaviour of Disjoint Set Union Algorithms [Citation Graph (0, 0)][DBLP ] Conf ] David Peleg Concurrent Dynamic Logic (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Moshe Y. Vardi , Larry J. Stockmeyer Improved Upper and Lower Bounds for Modal Logics of Programs: Preliminary Report [Citation Graph (1, 0)][DBLP ] Conf ] J. W. de Bakker , John-Jules Ch. Meyer , Ernst-Rüdiger Olderog , Jeffery I. Zucker Transition Systems, Infinitary Languages and the Semantics of Uniform Concurrency [Citation Graph (0, 0)][DBLP ] Conf ] Kim B. Bruce , Giuseppe Longo Provable Isomorphisms and Domain Equations in Models of Typed Languages (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Stavros S. Cosmadakis , Paris C. Kanellakis Equational Theories and Database Constraints [Citation Graph (6, 0)][DBLP ] Conf ] Samuel R. Buss The Polynomial Hierarchy and Fragments of Bounded Arithmetic (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Shafi Goldwasser , Silvio Micali , Charles Rackoff The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Ronald Fagin , Moshe Y. Vardi An Internal Semantics for Modal Logic: Preliminary Report [Citation Graph (0, 0)][DBLP ] Conf ] Gabriel Bracha An O(\mathop lg n) Expected Rounds Randomized Byzantine Generals Protocol [Citation Graph (0, 0)][DBLP ] Conf ] Paul Feldman Fault Tolerance of Minimal Path Routings in a Network [Citation Graph (0, 0)][DBLP ] Conf ] Brian A. Coan , Danny Dolev , Cynthia Dwork , Larry J. Stockmeyer The Distributed Firing Squad Problem (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Joseph Y. Halpern , Nimrod Megiddo , Ashfaq A. Munshi Optimal Precision in the Presence of Uncertainty (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Johan Håstad , Adi Shamir The Cryptographic Security of Truncated Linearly Related Variables [Citation Graph (0, 0)][DBLP ] Conf ] Leonid A. Levin One-Way Functions and Pseudorandom Generators [Citation Graph (0, 0)][DBLP ] Conf ] Umesh V. Vazirani Towards a Strong Communication Complexity Theory or Generating Quasi-Random Sequences from Two Communicating Slightly-random Sources (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Jonathan Goodman , Albert G. Greenberg , Neal Madras , Peter March On the Stability of the Ethernet [Citation Graph (0, 0)][DBLP ] Conf ] Péter Gács , John H. Reif A Simple Three-Dimensional Real-Time Reliable Cellular Array [Citation Graph (0, 0)][DBLP ] Conf ] Anna Lubiw Doubly Lexical Orderings of Matrices [Citation Graph (0, 0)][DBLP ] Conf ] Dung T. Huynh The Complexity of the Equivalence Problem for Commutative Semigroups and Symmetric Vector Addition Systems [Citation Graph (0, 0)][DBLP ] Conf ] Friedhelm Meyer auf der Heide Fast Algorithms for N-Dimensional Restrictions of Hard Problems [Citation Graph (0, 0)][DBLP ] Conf ] László Babai Trading Group Theory for Randomness [Citation Graph (0, 0)][DBLP ] Conf ] Béla Bollobás , Trevor I. Fenner , Alan M. Frieze An Algorithm for Finding Hamilton Cycles in a Random Graph [Citation Graph (0, 0)][DBLP ] Conf ] Andrew V. Goldberg , Michael Sipser Compression and Ranking [Citation Graph (0, 0)][DBLP ] Conf ] Larry Carter , Larry J. Stockmeyer , Mark N. Wegman The Complexity of Backtrack Searches (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Leslie G. Valiant , Vijay V. Vazirani NP Is as Easy as Detecting Unique Solutions [Citation Graph (0, 0)][DBLP ] Conf ] Richard M. Karp , Eli Upfal , Avi Wigderson Are Search and Decision Problems Computationally Equivalent? [Citation Graph (0, 0)][DBLP ] Conf ] Ron Aharoni , Paul Erdös , Nathan Linial Dual Integer Linear Programs and the Relationship between their Optima [Citation Graph (0, 0)][DBLP ] Conf ] 