Conferences in DBLP
László Babai , Noam Nisan , Mario Szegedy Multiparty Protocols and Logspace-hard Pseudorandom Sequences (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Russell Impagliazzo , Leonid A. Levin , Michael Luby Pseudo-random Generation from one-way functions (Extended Abstracts) [Citation Graph (0, 0)][DBLP ] Conf ] Oded Goldreich , Leonid A. Levin A Hard-Core Predicate for all One-Way Functions [Citation Graph (0, 0)][DBLP ] Conf ] Moni Naor , Moti Yung Universal One-Way Hash Functions and their Cryptographic Applications [Citation Graph (1, 0)][DBLP ] Conf ] Russell Impagliazzo , Steven Rudich Limits on the Provable Consequences of One-Way Permutations [Citation Graph (0, 0)][DBLP ] Conf ] Benny Chor , Eyal Kushilevitz A Zero-One Law for Boolean Privacy (extended abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Tal Rabin , Michael Ben-Or Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (Extended Abstract) [Citation Graph (1, 0)][DBLP ] Conf ] Manuel Blum , Sampath Kannan Designing Programs That Check Their Work [Citation Graph (0, 0)][DBLP ] Conf ] Brigitte Vallée Provably Fast Integer Factoring with Quasi-Uniform Small Quadratic Residues [Citation Graph (0, 0)][DBLP ] Conf ] Stephen A. Cook , Alasdair Urquhart Functional Interpretations of Feasibly Constructive Arithmetic (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Foto N. Afrati , Stavros S. Cosmadakis Expressiveness of Restricted Recursive Queries (Extended Abstract) [Citation Graph (9, 0)][DBLP ] Conf ] Shmuel Safra , Moshe Y. Vardi On omega-Automata and Temporal Logic (Preliminary Report) [Citation Graph (0, 0)][DBLP ] Conf ] Doug Ierardi Quantifier Elimination in the Theory of an Algebraically-closed Field [Citation Graph (0, 0)][DBLP ] Conf ] Lance Fortnow , Michael Sipser Probabilistic Computation and Linear Time [Citation Graph (0, 0)][DBLP ] Conf ] Stuart A. Kurtz , Stephen R. Mahaney , James S. Royer The Isomorphism Conjecture Fails Relative to a Random Oracle (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Alexander A. Razborov On the Method of Approximations [Citation Graph (0, 0)][DBLP ] Conf ] Nader H. Bshouty On the Extended Direct Sum Conjecture [Citation Graph (0, 0)][DBLP ] Conf ] Andrew Chi-Chih Yao Circuits and Local Computation [Citation Graph (0, 0)][DBLP ] Conf ] Paul Beame A General Sequential Time-Space Tradeoff for Finding Unique Elements [Citation Graph (0, 0)][DBLP ] Conf ] Shai Ben-David , Benny Chor , Oded Goldreich , Michael Luby On the Theory of Average Case Complexity [Citation Graph (0, 0)][DBLP ] Conf ] Tak Wah Lam , Prasoon Tiwari , Martin Tompa Tradeoffs Between Communication and Space [Citation Graph (0, 0)][DBLP ] Conf ] Richard R. Koch , Frank Thomson Leighton , Bruce M. Maggs , Satish Rao , Arnold L. Rosenberg Work-Preserving Emulations of Fixed-Connection Networks (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Eli Upfal An O(log N) Deterministic Packet Routing Scheme (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Johan Håstad , Frank Thomson Leighton , Mark Newman Fast Computation Using Faulty Hypercubes (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] John H. Reif , Stephen R. Tate Optimal Size Integer Division Circuits [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Amotz Bar-Noy , Nathan Linial , David Peleg On the Complexity of Radio Communication (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Ming-Yang Kao , Gregory E. Shannon Local Reorientation, Global Order, and Planar Topology (Preliminary Version) [Citation Graph (1, 0)][DBLP ] Conf ] Alok Aggarwal , Richard J. Anderson , Ming-Yang Kao Parallel Depth-First Search in General Directed Graphs (Preliminary Version) [Citation Graph (1, 0)][DBLP ] Conf ] Omer Berkman , Dany Breslauer , Zvi Galil , Baruch Schieber , Uzi Vishkin Highly Parallelizable Problems (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Ravi B. Boppana Optimal Separations Between Concurrent-Write Parallel Machines [Citation Graph (0, 0)][DBLP ] Conf ] Noam Nisan CREW PRAMs and Decision Trees [Citation Graph (0, 0)][DBLP ] Conf ] Amos Fiat , Moni Naor Implicit O(1) Probe Search [Citation Graph (1, 0)][DBLP ] Conf ] Michael L. Fredman , Michael E. Saks The Cell Probe Complexity of Dynamic Data Structures [Citation Graph (1, 0)][DBLP ] Conf ] Jeanette P. Schmidt , Alan Siegel On Aspects of Universality and Performance for Closed Hashing (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Claire Kenyon-Mathieu , Valerie King Verifying Partial Orders [Citation Graph (0, 0)][DBLP ] Conf ] Martin E. Dyer , Alan M. Frieze , Ravi Kannan A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Chazelle , Herbert Edelsbrunner , Leonidas J. Guibas , Micha Sharir Lines in Space-Combinatorics, Algorithms and Applications [Citation Graph (0, 0)][DBLP ] Conf ] John H. Reif , Sandeep Sen Polling: A New Randomized Sampling Technique for Computational Geometry [Citation Graph (0, 0)][DBLP ] Conf ] Jacob E. Goodman , Richard Pollack , Bernd Sturmfels Coordinate Representation of Order Types Requires Exponential Storage [Citation Graph (0, 0)][DBLP ] Conf ] Ronald L. Rivest , Robert E. Schapire Inference of Finite Automata Using Homing Sequences (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Leonard Pitt , Manfred K. Warmuth The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial [Citation Graph (0, 0)][DBLP ] Conf ] Michael J. Kearns , Leslie G. Valiant Cryptographic Limitations on Learning Boolean Formulae and Finite Automata [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Camille Birget Proof of a Conjecture of R. Kannan [Citation Graph (0, 0)][DBLP ] Conf ] Danny Dolev , Nir Shavit Bounded Concurrent Time-Stamp Systems Are Constructible [Citation Graph (0, 0)][DBLP ] Conf ] Ronald L. Graham , Andrew Chi-Chih Yao On the Improbability of Reaching Byzantine Agreements (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Amotz Bar-Noy , Nathan Linial , David Peleg Compact Distributed Data Structures for Adaptive Routing (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch Distributed Shortest Paths Algorithms (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Michael R. Fellows , Michael A. Langston On Search, Decision and the Efficiency of Polynomial-Time Algorithms (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Tomás Feder A New Fixed Point Approach for Stable Networks and Stable Marriages [Citation Graph (0, 0)][DBLP ] Conf ] Edith Cohen , Nimrod Megiddo Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Dynamic Graphs (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Avrim Blum An \tildeO(n^0.4)-Approximation Algorithm for 3-Coloring (and Improved Approximation Algorithm for k-Coloring) [Citation Graph (0, 0)][DBLP ] Conf ] Andrei Z. Broder , Anna R. Karlin , Prabhakar Raghavan , Eli Upfal Trading Space for Time in Undirected s-t Connectivity [Citation Graph (0, 0)][DBLP ] Conf ] Rajeev Motwani Expanding Graphs and the Average-case Analysis of Algorithms for Matchings and Related Problems [Citation Graph (0, 0)][DBLP ] Conf ] Allan Borodin , Walter L. Ruzzo , Martin Tompa Lower Bounds on the Length of Universal Traversal Sequences (Detailed Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Ashok K. Chandra , Prabhakar Raghavan , Walter L. Ruzzo , Roman Smolensky , Prasoon Tiwari The Electrical Resistance of a Graph Captures its Commute and Cover Times (Detailed Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Joel Friedman , Jeff Kahn , Endre Szemerédi On the Second Eigenvalue in Random Regular Graphs [Citation Graph (0, 0)][DBLP ] Conf ] 