Conferences in DBLP
Michael Ben-Or , Shafi Goldwasser , Avi Wigderson Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] David Chaum , Claude Crépeau , Ivan Damgård Multiparty Unconditionally Secure Protocols (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Joe Kilian Founding Cryptography on Oblivious Transfer [Citation Graph (0, 0)][DBLP ] Conf ] Mihir Bellare , Silvio Micali How to Sign Given Any Trapdoor Function (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] David Peleg , Eli Upfal A Tradeoff between Space and Efficiency for Routing Tables (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Joseph Y. Halpern , Moshe Y. Vardi Reasoning about Knowledge and Time in Asynchronous Systems [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Berman , Janos Simon Investigations of Fault-Tolerant Networks of Computers (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Danny Dolev , Eli Gafni , Nir Shavit Toward a Non-Atomic Era: \ell-Exclusion as a Test Case [Citation Graph (0, 0)][DBLP ] Conf ] Danny Krizanc , David Peleg , Eli Upfal A Time-Randomness Tradeoff for Oblivious Routing (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Manuel Blum , Paul Feldman , Silvio Micali Non-Interactive Zero-Knowledge and Its Applications (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Michael Ben-Or , Shafi Goldwasser , Joe Kilian , Avi Wigderson Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions [Citation Graph (0, 0)][DBLP ] Conf ] Joseph Y. Halpern , Yoram Moses , Mark R. Tuttle A Knowledge-Based Analysis of Zero Knowledge (Preliminary Report) [Citation Graph (0, 0)][DBLP ] Conf ] Paul Feldman , Silvio Micali Optimal Algorithms for Byzantine Agreement [Citation Graph (0, 0)][DBLP ] Conf ] Bernd Halstenberg , Rüdiger Reischuk On Different Modes of Communication (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Alok Aggarwal , Ashok K. Chandra Virtual Memory Algorithms (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] András Hajnal , Wolfgang Maass , György Turán On the Communication Complexity of Graph Properties [Citation Graph (0, 0)][DBLP ] Conf ] Sandeep N. Bhatt , Fan R. K. Chung , Jia-Wei Hong , Frank Thomson Leighton , Arnold L. Rosenberg Optimal Simulations by Butterfly Networks (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Alok Aggarwal , Ashok K. Chandra , Prabhakar Raghavan Energy Consumption in VLSI Circuits (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Ramarathnam Venkatesan , Leonid A. Levin Random Instances of a Graph Coloring Problem Are Hard [Citation Graph (0, 0)][DBLP ] Conf ] Mihalis Yannakakis Expressing Combinatorial Optimization Problems by Linear Programs (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Christos H. Papadimitriou , Mihalis Yannakakis Optimization, Approximation, and Complexity Classes (Extended Abstract) [Citation Graph (1, 0)][DBLP ] Conf ] Mark Jerrum , Alistair Sinclair Conductance and the Rapid Mixing Property for Markov Chains: the Approximation of the Permanent Resolved (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Ker-I Ko Relativized Polynominal Time Hierarchies Having Exactly K Levels [Citation Graph (0, 0)][DBLP ] Conf ] Michael Ben-Or , Richard Cleve Computing Algebraic Formulas Using a Constant Number of Registers [Citation Graph (0, 0)][DBLP ] Conf ] Bala Kalyanasundaram , Georg Schnitger On the Power of White Pebbles (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Michael J. Kearns , Ming Li Learning in the Presence of Malicious Errors (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Yuri Gurevich , Saharon Shelah Nondeterministic Linear-Time Tasks May Require Substantially Nonlinear Deterministic Time in the Case of Sublinear Work Space [Citation Graph (0, 0)][DBLP ] Conf ] Richard M. Karp , Yanjun Zhang A Randomized Parallel Branch-and-Bound Procedure [Citation Graph (0, 0)][DBLP ] Conf ] Michael Ben-Or , Prasoon Tiwari A Deterministic Algorithm for Sparse Multivariate Polynominal Interpolation (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Howard J. Karloff , Prabhakar Raghavan Randomized Algorithms and Pseudorandom Numbers [Citation Graph (0, 0)][DBLP ] Conf ] Mark S. Manasse , Lyle A. McGeoch , Daniel Dominic Sleator Competitive Algorithms for On-line Problems [Citation Graph (3, 0)][DBLP ] Conf ] Sampath Kannan , Moni Naor , Steven Rudich Implicit Representation of Graphs [Citation Graph (0, 0)][DBLP ] Conf ] Amos Fiat , Moni Naor , Alejandro A. Schäffer , Jeanette P. Schmidt , Alan Siegel Storing and Searching a Multikey Table (Extended Abstract) [Citation Graph (1, 0)][DBLP ] Conf ] George S. Lueker , Mariko Molodowitch More Analysis of Double Hashing [Citation Graph (0, 0)][DBLP ] Conf ] Martin Loebl , Jaroslav Nesetril Linearity and Unprovability of Set Union Problem Strategies [Citation Graph (0, 0)][DBLP ] Conf ] Amos Fiat , Moni Naor , Jeanette P. Schmidt , Alan Siegel Non-Oblivious Hashing (Extended Abstract) [Citation Graph (1, 0)][DBLP ] Conf ] James B. Orlin A Faster Strongly Polynominal Minimum Cost Flow Algorithm [Citation Graph (1, 0)][DBLP ] Conf ] Andrew V. Goldberg , Robert Endre Tarjan Finding Minimum-Cost Circulations by Canceling Negative Cycles [Citation Graph (0, 0)][DBLP ] Conf ] S. Rao Kosaraju , Gregory F. Sullivan Detecting Cycles in Dynamic Graphs in Polynomial Time (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Harold N. Gabow , Herbert H. Westermann Forests, Frames and Games: Algorithms for Matroid Sums and Applications [Citation Graph (0, 0)][DBLP ] Conf ] Pravin M. Vaidya Geometry Helps in Matching (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Hubert de Fraysseix , János Pach , Richard Pollack Small Sets Supporting Fáry Embeddings of Planar Graphs [Citation Graph (1, 0)][DBLP ] Conf ] Tomás Feder , Daniel H. Greene Optimal Algorithms for Approximate Clustering [Citation Graph (0, 0)][DBLP ] Conf ] Steven Fortune , Gordon T. Wilfong Planning Constrained Motion [Citation Graph (0, 0)][DBLP ] Conf ] John F. Canny Some Algebraic and Geometric Computations in PSPACE [Citation Graph (0, 0)][DBLP ] Conf ] Valerie King Lower Bounds on the Complexity of Graph Properties [Citation Graph (0, 0)][DBLP ] Conf ] Stavros S. Cosmadakis , Haim Gaifman , Paris C. Kanellakis , Moshe Y. Vardi Decidable Optimization Problems for Database Logic Programs (Preliminary Report) [Citation Graph (20, 0)][DBLP ] Conf ] Sorin Istrail Polynomial Universal Traversing Sequences for Cycles Are Constructible (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Janos Pintz , William L. Steiger , Endre Szemerédi Two Infinite Sets of Primes with Fast Primality Tests [Citation Graph (0, 0)][DBLP ] Conf ] Christos H. Papadimitriou , Mihalis Yannakakis Towards an Architecture-Independent Analysis of Parallel Algorithms (Extended Abstract) [Citation Graph (1, 0)][DBLP ] Conf ] Harold N. Gabow , Robert Endre Tarjan Almost-Optimum Speed-ups of Algorithms for Bipartite Matching and Related Problems [Citation Graph (0, 0)][DBLP ] Conf ] Leonard M. Adleman , Kireeti Kompella Using Smoothness to Achieve Parallelism (Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Mauricio Karchmer , Avi Wigderson Monotone Circuits for Connectivity Require Super-logarithmic Depth [Citation Graph (0, 0)][DBLP ] Conf ] Andrei Z. Broder Errata to ``How hard is to marry at random? (On the approximation of the permanent)'' [Citation Graph (0, 0)][DBLP ] Conf ] 