Conferences in DBLP
Don Coppersmith , Shmuel Winograd Matrix Multiplication via Arithmetic Progressions [Citation Graph (7, 0)][DBLP ] Conf ] Andrew V. Goldberg , Robert Endre Tarjan Solving Minimum-Cost Flow Problems by Successive Approximation [Citation Graph (0, 0)][DBLP ] Conf ] Greg N. Frederickson A New Approach to All Pairs Shortest Paths in Planar Graphs (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Pravin M. Vaidya An Algorithm for Linear Programming which Requires O(((m+n)n^2 + (m+n)^1.5 n)L) Arithmetic Operations [Citation Graph (0, 0)][DBLP ] Conf ] Alok Aggarwal , Leonidas J. Guibas , James B. Saxe , Peter W. Shor A Linear Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon [Citation Graph (0, 0)][DBLP ] Conf ] Kazuo Iwano , Kenneth Steiglitz Testing for Cycles in Infinite Graphs with Periodic Structure (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Kenneth L. Clarkson Approximation Algorithms for Shortest Path Motion Planning (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Chazelle , Herbert Edelsbrunner , Leonidas J. Guibas The Complexity of Cutting Convex Polytopes [Citation Graph (0, 0)][DBLP ] Conf ] Roman Smolensky Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity [Citation Graph (0, 0)][DBLP ] Conf ] Paul Beame , Johan Håstad Optimal Bounds for Decision Problems on the CRCW PRAM [Citation Graph (0, 0)][DBLP ] Conf ] Wolfgang Maass , Georg Schnitger , Endre Szemerédi Two Tapes Are Better than One for Off-Line Turing Machines [Citation Graph (0, 0)][DBLP ] Conf ] David A. Mix Barrington , Denis Thérien Finite Monoids and the Fine Structure of NC¹ [Citation Graph (0, 0)][DBLP ] Conf ] Lane A. Hemachandra The Strong Exponential Hierarchy Collapses [Citation Graph (0, 0)][DBLP ] Conf ] Samuel R. Buss The Boolean Formula Value Problem Is in ALOGTIME [Citation Graph (2, 0)][DBLP ] Conf ] Miklós Ajtai , János Komlós , Endre Szemerédi Deterministic Simulation in LOGSPACE [Citation Graph (0, 0)][DBLP ] Conf ] H. Venkateswaran Properties that Characterize LOGCFL [Citation Graph (0, 0)][DBLP ] Conf ] Eric Allender Some Consequences of the Existence of Pseudorandom Generators [Citation Graph (0, 0)][DBLP ] Conf ] Umesh V. Vazirani Efficiency Considerations in Using Semi-random Sources (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] David Lichtenstein , Nathan Linial , Michael E. Saks Imperfect Random Sources and Discrete Controlled Processes [Citation Graph (0, 0)][DBLP ] Conf ] Martin Fürer The Power of Randomness for Communication Complexity (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Oded Goldreich Towards a Theory of Software Protection and Simulation by Oblivious RAMs [Citation Graph (0, 0)][DBLP ] Conf ] Martín Abadi , Joan Feigenbaum , Joe Kilian On Hiding Information from an Oracle (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Lance Fortnow The Complexity of Perfect Zero-Knowledge (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Uriel Feige , Amos Fiat , Adi Shamir Zero Knowledge Proofs of Identity [Citation Graph (0, 0)][DBLP ] Conf ] Oded Goldreich , Silvio Micali , Avi Wigderson How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch Optimal Distributed Algorithms for Minimum Weight Spanning Tree, Counting, Leader Election and Related Problems (Detailed Summary) [Citation Graph (0, 0)][DBLP ] Conf ] Johan Håstad , Frank Thomson Leighton , Brian Rogoff Analysis of Backoff Protocols for Multiple Access Channels (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Gary L. Miller , Shang-Hua Teng Dynamic Parallel Complexity of Computational Circuits [Citation Graph (0, 0)][DBLP ] Conf ] David Peleg , Eli Upfal Constructing Disjoint Paths on Expander Graphs (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Johan Håstad , Frank Thomson Leighton , Mark Newman Reconfiguring a Hypercube in the Presence of Faults (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Michael J. Kearns , Ming Li , Leonard Pitt , Leslie G. Valiant On the Learnability of Boolean Formulae [Citation Graph (0, 0)][DBLP ] Conf ] B. K. Natarajan On Learning Boolean Functions [Citation Graph (0, 0)][DBLP ] Conf ] Alok Aggarwal , Bowen Alpern , Ashok K. Chandra , Marc Snir A Model for Hierarchical Memory [Citation Graph (1, 0)][DBLP ] Conf ] Andrew V. Goldberg , Serge A. Plotkin , Gregory E. Shannon Parallel Symmetry-Breaking in Sparse Graphs [Citation Graph (0, 0)][DBLP ] Conf ] Alok Aggarwal , Richard J. Anderson A Random NC Algorithm for Depth First Search [Citation Graph (0, 0)][DBLP ] Conf ] Gary L. Miller , Vijaya Ramachandran A New Graph Triconnectivity Algorithm and Its Parallelization [Citation Graph (0, 0)][DBLP ] Conf ] Ketan Mulmuley , Umesh V. Vazirani , Vijay V. Vazirani Matching Is as Easy as Matrix Inversion [Citation Graph (0, 0)][DBLP ] Conf ] Joseph Naor , Moni Naor , Alejandro A. Schäffer Fast Parallel Algorithms for Chordal Graphs (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Paul F. Dietz , Daniel Dominic Sleator Two Algorithms for Maintaining Order in a List [Citation Graph (2, 0)][DBLP ] Conf ] Allan Borodin , Nathan Linial , Michael E. Saks An Optimal Online Algorithm for Metrical Task Systems [Citation Graph (1, 0)][DBLP ] Conf ] J. Ian Munro Searching a Two Key Table Under a Single Key [Citation Graph (1, 0)][DBLP ] Conf ] Lenwood S. Heath , Sorin Istrail The Pagenumber of Genus g Graphs is O(g) [Citation Graph (0, 0)][DBLP ] Conf ] Lajos Rónyai Simple Algebras Are Difficult [Citation Graph (0, 0)][DBLP ] Conf ] László Babai , Eugene M. Luks , Ákos Seress Permutation Groups in NC [Citation Graph (0, 0)][DBLP ] Conf ] Saharon Shelah , Joel Spencer Threshold Spectra for Random Graphs [Citation Graph (0, 0)][DBLP ] Conf ] Phokion G. Kolaitis , Moshe Y. Vardi The Decision Problem for the Probabilities of Higher-Order Properties [Citation Graph (5, 0)][DBLP ] Conf ] Gianfranco Bilardi , Franco P. Preparata Size-Time Complexity of Boolean Networks for Prefix Computations [Citation Graph (0, 0)][DBLP ] Conf ] Erich Kaltofen Single-Factor Hensel Lifting and its Application to the Straight-Line Complexity of Certain Polynomials [Citation Graph (0, 0)][DBLP ] Conf ] Eric Bach Realistic Analysis of Some Randomized Algorithms [Citation Graph (0, 0)][DBLP ] Conf ] Leonard M. Adleman , Ming-Deh A. Huang Recognizing Primes in Random Polynomial Time [Citation Graph (0, 0)][DBLP ] Conf ] 