Conferences in DBLP
David A. Mix Barrington Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC¹ [Citation Graph (0, 0)][DBLP ] Conf ] Johan Håstad Almost Optimal Lower Bounds for Small Depth Circuits [Citation Graph (0, 0)][DBLP ] Conf ] Jin-yi Cai With Probability One, A Random Oracle Separates PSPACE from the Polynomial-Time Hierarchy [Citation Graph (0, 0)][DBLP ] Conf ] Miklós Ajtai , László Babai , Péter Hajnal , János Komlós , Pavel Pudlák , Vojtech Rödl , Endre Szemerédi , György Turán Two lower bounds for branching programs [Citation Graph (0, 0)][DBLP ] Conf ] Zvi Galil , Ravi Kannan , Endre Szemerédi On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines [Citation Graph (0, 0)][DBLP ] Conf ] Andrei Z. Broder How hard is to marry at random? (On the approximation of the permanent) [Citation Graph (0, 0)][DBLP ] Conf ] Shafi Goldwasser , Michael Sipser Private Coins versus Public Coins in Interactive Proof Systems [Citation Graph (0, 0)][DBLP ] Conf ] Mark W. Krentel The Complexity of Optimization Problems [Citation Graph (0, 0)][DBLP ] Conf ] Edward G. Coffman Jr. , Frank Thomson Leighton A Provably Efficient Algorithm for Dynamic Storage Allocation [Citation Graph (0, 0)][DBLP ] Conf ] Frank Thomson Leighton , Peter W. Shor Tight Bounds for Minimax Grid Matching, With Applications to the Average Case Analysis of Algorithms [Citation Graph (0, 0)][DBLP ] Conf ] Mihalis Yannakakis Four Pages are Necessary and Sufficient for Planar Graphs (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] James R. Driscoll , Neil Sarnak , Daniel Dominic Sleator , Robert Endre Tarjan Making Data Structures Persistent [Citation Graph (3, 0)][DBLP ] Conf ] Daniel Dominic Sleator , Robert Endre Tarjan , William P. Thurston Rotation Distance, Triangulations, and Hyperbolic Geometry [Citation Graph (0, 0)][DBLP ] Conf ] Andrew V. Goldberg , Robert Endre Tarjan A New Approach to the Maximum Flow Problem [Citation Graph (0, 0)][DBLP ] Conf ] Sanjiv Kapoor , Pravin M. Vaidya Fast Algorithms for Convex Quadratic Programming and Multicommodity Flows [Citation Graph (0, 0)][DBLP ] Conf ] Anna R. Karlin , Eli Upfal Parallel Hashing-An Efficient Implementation of Shared Memory (Preliminary Version) [Citation Graph (2, 0)][DBLP ] Conf ] Paul Beame Limits on the Power of Concurrent-Write Parallel Machines [Citation Graph (0, 0)][DBLP ] Conf ] Ming Li , Yaacov Yesha New Lower Bounds for Parallel Computation [Citation Graph (0, 0)][DBLP ] Conf ] Miklós Ajtai , János Komlós , William L. Steiger , Endre Szemerédi Deterministic Selection in O(log log N) Parallel Time [Citation Graph (0, 0)][DBLP ] Conf ] George S. Lueker , Nimrod Megiddo , Vijaya Ramachandran Linear Programming with Two Variables per Inequality in Poly-Log Time (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Richard Cole , Uzi Vishkin Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms [Citation Graph (1, 0)][DBLP ] Conf ] Gad M. Landau , Uzi Vishkin Introducing Efficient Parallelism into Approximate String Matching and a New Serial Algorithm [Citation Graph (1, 0)][DBLP ] Conf ] S. Rao Kosaraju Parallel Evaluation of Division-Free Arithmetic Expressions [Citation Graph (0, 0)][DBLP ] Conf ] Alexander Lubotzky , R. Phillips , P. Sarnak Explicit Expanders and the Ramanujan Conjectures [Citation Graph (0, 0)][DBLP ] Conf ] Paul Feldman , Joel Friedman , Nicholas Pippenger Non-Blocking Networks (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Claus-Peter Schnorr , Adi Shamir An Optimal Sorting Algorithm for Mesh Connected Computers [Citation Graph (0, 0)][DBLP ] Conf ] S. Rao Kosaraju , Mikhail J. Atallah Optimal Simulations between Mesh-Connected Arrays of Processors (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Anselm Blumer , Andrzej Ehrenfeucht , David Haussler , Manfred K. Warmuth Classifying Learnable Geometric Concepts with the Vapnik-Chervonenkis Dimension (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Costas Courcoubetis , Moshe Y. Vardi , Pierre Wolper Reasoning about Fair Concurrent Programs [Citation Graph (0, 0)][DBLP ] Conf ] Ker-I Ko , Timothy J. Long , Ding-Zhu Du A Note on One-Way Functions and Polynomial-Time Isomorphisms (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Joseph Y. Halpern , Moshe Y. Vardi The Complexity of Reasoning about Knowledge and Time: Extended Abstract [Citation Graph (0, 0)][DBLP ] Conf ] Shafi Goldwasser , Joe Kilian Almost All Primes Can Be Quickly Certified [Citation Graph (0, 0)][DBLP ] Conf ] Erich Kaltofen Uniform Closure Properties of P-Computable Functions [Citation Graph (0, 0)][DBLP ] Conf ] Ketan Mulmuley A Fast Parallel Algorithm to Compute the Rank of a Matrix over an Arbitrary Field [Citation Graph (0, 0)][DBLP ] Conf ] Michael Ben-Or , Ephraim Feig , Dexter Kozen , Prasoon Tiwari A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots [Citation Graph (0, 0)][DBLP ] Conf ] Leonard M. Adleman , Hendrik W. Lenstra Jr. Finding Irreducible Polynomials over Finite Fields [Citation Graph (0, 0)][DBLP ] Conf ] Michael Luby , Charles Rackoff Pseudo-random Permutation Generators and Cryptographic Composition [Citation Graph (0, 0)][DBLP ] Conf ] Richard Cleve Limits on the Security of Coin Flips when Half the Processors Are Faulty (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Cynthia Dwork , David Peleg , Nicholas Pippenger , Eli Upfal Fault Tolerance in Networks of Bounded Degree (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Robert Endre Tarjan , Christopher J. Van Wyk A Linear-Time Algorithm for Triangulating Simple Polygons [Citation Graph (0, 0)][DBLP ] Conf ] Herbert Edelsbrunner , Leonidas J. Guibas Topologically Sweeping an Arrangement [Citation Graph (0, 0)][DBLP ] Conf ] Raimund Seidel Constructing Higher-Dimensional Convex Hulls at Logarithmic Cost per Face [Citation Graph (0, 0)][DBLP ] Conf ] Kenneth L. Clarkson Further Applications of Random Sampling to Computational Geometry [Citation Graph (0, 0)][DBLP ] Conf ] David P. Dobkin , Herbert Edelsbrunner , Chee-Keng Yap Probing Convex Polytopes [Citation Graph (2, 0)][DBLP ] Conf ] Marshall W. Bern Two Probabilistic Results on Rectilinear Steiner Trees [Citation Graph (0, 0)][DBLP ] Conf ] Imre Bárány , Zoltán Füredi Computing the Volume Is Difficult [Citation Graph (1, 0)][DBLP ] Conf ] Alan Siegel Aspects of Information Flow in VLSI Circuits (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] 