Conferences in DBLP
Sanjeev Arora , Shmuel Safra Probabilistic Checking of Proofs; A New Characterization of NP [Citation Graph (0, 0)][DBLP ] Conf ] Sanjeev Arora , Carsten Lund , Rajeev Motwani , Madhu Sudan , Mario Szegedy Proof Verification and Hardness of Approximation Problems [Citation Graph (0, 0)][DBLP ] Conf ] Noam Nisan , Endre Szemerédi , Avi Wigderson Undirected Connectivity in O(log ^1.5 n) Space [Citation Graph (0, 0)][DBLP ] Conf ] Stephen A. Fenner , Lance Fortnow , Stuart A. Kurtz The Isomorphism Conjecture Holds Relative to an Oracle [Citation Graph (0, 0)][DBLP ] Conf ] Adam L. Buchsbaum , Rajamani Sundar , Robert Endre Tarjan Data Structural Bootstrapping, Linear Path Compression, and Catenable Heap Ordered Double Ended Queues [Citation Graph (0, 0)][DBLP ] Conf ] Monika Rauch Fully Dynamic Biconnectivity in Graphs [Citation Graph (1, 0)][DBLP ] Conf ] David Eppstein , Zvi Galil , Giuseppe F. Italiano , Amnon Nissenzweig Sparsification-A Technique for Speeding up Dynamic Graph Algorithms (Extended Abstract) [Citation Graph (1, 0)][DBLP ] Conf ] Tsan-sheng Hsu On Four-Connecting a Triconnected Graph (Extended Abstract) [Citation Graph (1, 0)][DBLP ] Conf ] Pankaj K. Agarwal , David Eppstein , Jirí Matousek Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees [Citation Graph (0, 0)][DBLP ] Conf ] Ketan Mulmuley Randomized Geometric Algorithms and Pseudo-Random Generators (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Goos Kant Drawing Planar Graphs Using the lmc-Ordering (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Eugene M. Luks Computing in Solvable Matrix Groups [Citation Graph (0, 0)][DBLP ] Conf ] Mark Giesbrecht Fast Algorithms for Matrix Normal Forms [Citation Graph (0, 0)][DBLP ] Conf ] Dario Bini , Victor Y. Pan Improved Parallel Polynomial Division and Its Extensions [Citation Graph (0, 0)][DBLP ] Conf ] James Aspnes , Orli Waarts Randomized Consensus in Expected O(n log ^2 n) Operations Per Processor [Citation Graph (0, 0)][DBLP ] Conf ] Yonatan Aumann , Michael O. Rabin Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Prasad Jayanti , Tushar Deepak Chandra , Sam Toueg Fault-tolerant Wait-free Shared Objects [Citation Graph (0, 0)][DBLP ] Conf ] Erich Grädel , Gregory L. McColm Hierarchies in Transitive Closure Logic, Stratified Datalog and Infinitary Logic [Citation Graph (0, 0)][DBLP ] Conf ] Rajeev Alur , Thomas A. Henzinger Back to the Future: Towards a Theory of Timed Regular Languages [Citation Graph (0, 0)][DBLP ] Conf ] Toniann Pitassi , Alasdair Urquhart The Complexity of the Hajós Calculus [Citation Graph (0, 0)][DBLP ] Conf ] Avrim Blum , Howard J. Karloff , Yuval Rabani , Michael E. Saks A Decomposition Theorem and Bounds for Randomized Server Problems [Citation Graph (0, 0)][DBLP ] Conf ] Anna R. Karlin , Steven J. Phillips , Prabhakar Raghavan Markov Paging (Extended Abstract) [Citation Graph (3, 0)][DBLP ] Conf ] Yossi Azar , Andrei Z. Broder , Anna R. Karlin On-line Load Balancing (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] C. Greg Plaxton , Bjorn Poonen , Torsten Suel Improved Lower Bounds for Shellsort [Citation Graph (0, 0)][DBLP ] Conf ] Peter Bro Miltersen , Mike Paterson , Jun Tarui The Asymptotic Complexity of Merging Networks [Citation Graph (0, 0)][DBLP ] Conf ] Zvi Galil , Kunsoo Park Truly Alphabet-Independent Two-Dimensional Pattern Matching [Citation Graph (0, 0)][DBLP ] Conf ] Moshe Dubiner , Uri Zwick Amplification and Percolation [Citation Graph (0, 0)][DBLP ] Conf ] Andrew Chi-Chih Yao Algebraic Decision Trees and Euler Characteristics [Citation Graph (0, 0)][DBLP ] Conf ] Vince Grolmusz Separating the Communication Complexities of MOD m and MOD p Circuits [Citation Graph (0, 0)][DBLP ] Conf ] Don Coppersmith , Baruch Schieber Lower Bounds on the Depth of Monotone Arithmetic Computations (Extended Summary) [Citation Graph (0, 0)][DBLP ] Conf ] Nabil Kahale On the Second Eigenvalue and Linear Expansion of Regular Graphs [Citation Graph (0, 0)][DBLP ] Conf ] Yuri Rabinovich , Alistair Sinclair , Avi Wigderson Quadratic Dynamical Systems (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Joel Friedman On the Bit Extraction Problem [Citation Graph (0, 0)][DBLP ] Conf ] Mark Jerrum , Umesh V. Vazirani A Mildly Exponential Approximation Algorithm for the Permanent [Citation Graph (0, 0)][DBLP ] Conf ] Ran El-Yaniv , Amos Fiat , Richard M. Karp , G. Turpin Competitive Analysis of Financial Games [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Gil Kalai , Moty Ricklin , Larry J. Stockmeyer Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Yair Bartal , Adi Rosén The Distributed k-Server Problem-A Competitive Distributed Translator for k-Server Algorithms [Citation Graph (0, 0)][DBLP ] Conf ] Jerzy Marcinkowski , Leszek Pacholski Undecidability of the Horn-Clause Implication Problem [Citation Graph (0, 0)][DBLP ] Conf ] Dexter Kozen , Jens Palsberg , Michael I. Schwartzbach Efficient Inference of Partial Types [Citation Graph (0, 0)][DBLP ] Conf ] Jan Van den Bussche , Dirk Van Gucht , Marc Andries , Marc Gyssens On the Completeness of Object-Creating Query Languages (Extended Abstract) [Citation Graph (7, 0)][DBLP ] Conf ] Hans-Peter Lenhof , Michiel H. M. Smid Enumerating the k Closest Pairs Optimally [Citation Graph (0, 0)][DBLP ] Conf ] Kenneth L. Clarkson Safe and Effective Determinant Evaluation [Citation Graph (0, 0)][DBLP ] Conf ] Naoki Katoh , Takeshi Tokuyama , Kazuo Iwano On Minimum and Maximum Spanning Trees of Linearly Moving Points [Citation Graph (0, 0)][DBLP ] Conf ] Manuel Blum , Oded Goldreich Towards a Computational Theory of Statistical Tests (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Zvi Galil , Oded Margalit , Moni Naor Witnesses for Boolean Matrix Multiplication and for Shortest Paths [Citation Graph (0, 0)][DBLP ] Conf ] Alfredo De Santis , Giuseppe Persiano Zero-Knowledge Proofs of Knowledge Without Interaction (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Chee-Keng Yap Fast Unimodular Reduction: Planar Integer Lattices (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Johannes Blömer How to Denest Ramanujan's Nested Radicals [Citation Graph (0, 0)][DBLP ] Conf ] Wayne Eberly On Efficient Band Matrix Arithmetic [Citation Graph (0, 0)][DBLP ] Conf ] Bernd Gärtner A Subexponential Algorithm for Abstract Optimization Problems [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Richard A. Duke , Hanno Lefmann , Vojtech Rödl , Raphael Yuster The Algorithmic Aspects of the Regularity Lemma (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] László Lovász , Miklós Simonovits On the Randomized Complexity of Volume and Diameter [Citation Graph (0, 0)][DBLP ] Conf ] David P. Helmbold , Nick Littlestone , Philip M. Long Apple Tasting and Nearly One-Sided Learning [Citation Graph (0, 0)][DBLP ] Conf ] Sigal Ar , Richard J. Lipton , Ronitt Rubinfeld , Madhu Sudan Reconstructing Algebraic Functions from Mixed Data [Citation Graph (0, 0)][DBLP ] Conf ] Nader H. Bshouty , Richard Cleve On the Exact Learning of Formulas in Parallel (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Howard Aizenstein , Lisa Hellerstein , Leonard Pitt Read-Thrice DNF Is Hard to Learn With Membership and Equivalence Queries [Citation Graph (0, 0)][DBLP ] Conf ] Hisao Tamaki Efficient Self-Embedding of Butterfly Networks with Random Faults [Citation Graph (0, 0)][DBLP ] Conf ] Frank Thomson Leighton , Bruce M. Maggs , Ramesh K. Sitaraman On the Fault Tolerance of Some Popular Bounded-Degree Networks [Citation Graph (0, 0)][DBLP ] Conf ] Uriel Feige , Prabhakar Raghavan Exact Analysis of Hot-Potato Routing (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Sergio A. Felperin , Prabhakar Raghavan , Eli Upfal A Theory of Wormhole Routing in Parallel Computers (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Joseph S. B. Mitchell , Christine D. Piatko , Esther M. Arkin Computing a Shortest k-Link Path in a Polygon [Citation Graph (0, 0)][DBLP ] Conf ] Alok Aggarwal , Amotz Bar-Noy , Samir Khuller , Dina Kravets , Baruch Schieber Efficient Minimum Cost Matching Using Quadrangle Inequality [Citation Graph (0, 0)][DBLP ] Conf ] Hubert Wagener Optimal Parallel Hull Construction for Simple Polygons in \calO(log log n) Time [Citation Graph (0, 0)][DBLP ] Conf ] Richard Cole , Ramesh Hariharan Tighter Bounds on the Exact Complexity of String Matching (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Claire Kenyon , Richard Kenyon Tiling a Polygon with Rectangles [Citation Graph (0, 0)][DBLP ] Conf ] Vasek Chvátal , B. Reed Mick Gets Some (the Odds Are on His Side) [Citation Graph (0, 0)][DBLP ] Conf ] Torben Hagerup , Rajeev Raman Waste Makes Haste: Tight Bounds for Loose Parallel Sorting [Citation Graph (0, 0)][DBLP ] Conf ] Shiva Chaudhuri , Jaikumar Radhakrishnan The Complexity of Parallel Prefix Problems on Small Domains [Citation Graph (0, 0)][DBLP ] Conf ] Edith Cohen Approximate Max Flow on Small Depth Networks [Citation Graph (0, 0)][DBLP ] Conf ] Tomasz Radzik Newton's Method for Fractional Combinatorial Optimization [Citation Graph (0, 0)][DBLP ] Conf ] Michele Conforti , Gérard Cornuéjols A Class of Logic Problems Solvable by Linear Programming [Citation Graph (0, 0)][DBLP ] Conf ] Sivan Toledo Maximizing Non-Linear Concave Functions in Fixed Dimension [Citation Graph (0, 0)][DBLP ] Conf ] Miklós Ajtai , János Komlós , Endre Szemerédi Halvers and Expanders [Citation Graph (0, 0)][DBLP ] Conf ] Miklós Ajtai , Noga Alon , Jehoshua Bruck , Robert Cypher , Ching-Tien Ho , Moni Naor , Endre Szemerédi Fault Tolerant Graphs, Perfect Hash Functions and Disjoint Paths [Citation Graph (0, 0)][DBLP ] Conf ] Victor Y. Pan , John H. Reif , Stephen R. Tate The Power of Combining the Techiques of Algebraic and Numerical Computing: Improved Approximate Multipoint Polynomial Evaluation and Improved Multipole Algorithms [Citation Graph (0, 0)][DBLP ] Conf ] Erich Kaltofen , Victor Y. Pan Processor-Efficient Parallel Solution of Linear Systems II: The Positive Characteristic and Singular Cases (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Leonard J. Schulman Communication on Noisy Channels: A Coding Theorem for Computation [Citation Graph (0, 0)][DBLP ] Conf ] 