Conferences in DBLP
Pavol Duris , Zvi Galil Two Tapes are Better than One for Nondeterministic Machines [Citation Graph (0, 0)][DBLP ] Conf ] Martin Fürer The Tight Deterministic Time Hierarchy [Citation Graph (0, 0)][DBLP ] Conf ] Nicholas Pippenger Probabilistic Simulations (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Paul M. B. Vitányi Real-Time Simulation of Multicounters by Oblivious One-Tape Turing Machines [Citation Graph (0, 0)][DBLP ] Conf ] Katsushi Inoue , Itsuo Takanami , Hiroshi Taniguchi Two-Dimensional Alternating Turing Machines [Citation Graph (0, 0)][DBLP ] Conf ] Maurice Nivat , Dominique Perrin Ensembles Reconnaissables de Mots Biinfinis [Citation Graph (0, 0)][DBLP ] Conf ] Yuri Gurevich , Leo Harrington Trees, Automata, and Games [Citation Graph (0, 0)][DBLP ] Conf ] J. Lawrence Carter The Theory of Signature Testing for VLSI [Citation Graph (0, 0)][DBLP ] Conf ] Sandeep N. Bhatt , Charles E. Leiserson How to Assemble Tree Machines (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Frank Thomson Leighton A Layout Strategy for VLSI which Is Provably Good (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Gloria Kissin Measuring Energy Consumption in VLSI Circuits: a Foundation [Citation Graph (0, 0)][DBLP ] Conf ] Ronald L. Rivest , Adi Shamir How to Reuse a ``Write-Once'' Memory (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Dan E. Willard Maintaining Dense Sequential Files in a Dynamic Environment (Extended Abstract) [Citation Graph (1, 0)][DBLP ] Conf ] Paul F. Dietz Maintaining Order in a Linked List [Citation Graph (0, 0)][DBLP ] Conf ] Andrew Chi-Chih Yao Space-Time Tradeoff for Answering Range Queries (Extended Abstract) [Citation Graph (1, 0)][DBLP ] Conf ] Moshe Y. Vardi The Complexity of Relational Query Languages (Extended Abstract) [Citation Graph (108, 0)][DBLP ] Conf ] Neil Immerman Relational Queries Computable in Polynomial Time (Extended Abstract) [Citation Graph (14, 0)][DBLP ] Conf ] J. W. de Bakker , Jeffery I. Zucker Denotational Semantics of Concurrency [Citation Graph (0, 0)][DBLP ] Conf ] A. Prasad Sistla , Edmund M. Clarke The Complexity of Propositional Linear Temporal Logics [Citation Graph (0, 0)][DBLP ] Conf ] E. Allen Emerson , Joseph Y. Halpern Decision Procedures and Expressiveness in the Temporal Logic of Branching Time [Citation Graph (0, 0)][DBLP ] Conf ] Yishai A. Feldman , David Harel A Probabilistic Dynamic Logic [Citation Graph (0, 0)][DBLP ] Conf ] Christos H. Papadimitriou , Michael Sipser Communication Complexity [Citation Graph (0, 0)][DBLP ] Conf ] John H. Reif Symmetric Complementation [Citation Graph (0, 0)][DBLP ] Conf ] Walter L. Ruzzo , Janos Simon , Martin Tompa Space-Bounded Hierarchies and Probabilistic Computations [Citation Graph (0, 0)][DBLP ] Conf ] Stuart A. Kurtz On the Random Oracle Hypothesis [Citation Graph (0, 0)][DBLP ] Conf ] Stephen Cook , Cynthia Dwork Bounds on the Time for Parallel RAM's to Compute Simple Functions [Citation Graph (0, 0)][DBLP ] Conf ] Udi Manber , Martin Tompa Probabilistic, Nondeterministic, and Alternating Decision Trees [Citation Graph (0, 0)][DBLP ] Conf ] Takao Asano , Tomio Hirata Edge-Deletion and Edge-Contraction Problems [Citation Graph (0, 0)][DBLP ] Conf ] Christos H. Papadimitriou , Mihalis Yannakakis The Complexity of Facets (and Some Facets of Complexity) [Citation Graph (3, 0)][DBLP ] Conf ] Erich Kaltofen A Polynomial Reduction from Multivariate to Bivariate Integral Polynomial Factorization [Citation Graph (0, 0)][DBLP ] Conf ] S. Rao Kosaraju Decidability of Reachability in Vector Addition Systems (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] James E. Boyce , David P. Dobkin , Robert L. (Scot) Drysdale III , Leonidas J. Guibas Finding Extremal Polygons [Citation Graph (0, 0)][DBLP ] Conf ] Eric Bach Fast Algorithms under the Extended Riemann Hypothesis: A Concrete Estimate [Citation Graph (0, 0)][DBLP ] Conf ] Zhu Hong , Robert Sedgewick Notes on Merging Networks (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Reuven Bar-Yehuda , Shimon Even On Approximating a Vertex Cover for Planar Graphs [Citation Graph (0, 0)][DBLP ] Conf ] László Babai , D. Yu. Grigoryev , David M. Mount Isomorphism of Graphs with Bounded Eigenvalue Multiplicity [Citation Graph (0, 0)][DBLP ] Conf ] Avi Wigderson A New Approximate Graph Coloring Algorithm [Citation Graph (0, 0)][DBLP ] Conf ] Kurt Mehlhorn , Erik Meineche Schmidt Las Vegas Is better than Determinism in VLSI and Distributed Computing (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Allan Borodin , John E. Hopcroft Routing, Merging and Sorting on Parallel Models of Computation (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Mikhail J. Atallah , S. Rao Kosaraju Graph Problems on a Mesh-Connected Processor Array (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Albert G. Greenberg On the Time Complexity of Broadcast Communication Schemes (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Shafi Goldwasser , Silvio Micali Probabilistic Encryption and How to Play Mental Poker Keeping Secret All Partial Information [Citation Graph (0, 0)][DBLP ] Conf ] Jan K. Pachl , Ephraim Korach , Doron Rotem A Technique for Proving Lower Bounds for Distributed Maximum-Finding Algorithms [Citation Graph (0, 0)][DBLP ] Conf ] Richard A. DeMillo , Nancy A. Lynch , Michael Merritt Cryptographic Protocols [Citation Graph (1, 0)][DBLP ] Conf ] Danny Dolev , H. Raymond Strong Polynomial Algorithms for Multiple Processor Agreement [Citation Graph (5, 0)][DBLP ] Conf ] 