Conferences in DBLP
Andrew V. Goldberg , Satish Rao Beyond the Flow Decomposition Barrier. [Citation Graph (0, 0)][DBLP ] Conf ] Mikkel Thorup Undirected Single Source Shortest Path in Linear Time. [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Chazelle A Faster Deterministic Algorithm for Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew V. Goldberg , Satish Rao Flows in Undirected Unit Capacity Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Pascal Koiran Randomized and Deterministic Algorithms for the Dimension of Algebraic Varieties. [Citation Graph (0, 0)][DBLP ] Conf ] Tomas Sander , Mohammad Amin Shokrollahi Deciding Properties of Polynomials Without Factoring. [Citation Graph (0, 0)][DBLP ] Conf ] Saugata Basu An Improved Algorithm for Quantifier Elimination Over Real Closed Fields. [Citation Graph (0, 0)][DBLP ] Conf ] Attila Kondacs , John Watrous On the Power of Quantum Finite State Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Amir Pnueli Two Decades of Temporal Logic: Achievements and Challenges (Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] John Havlicek Computable Obstructions to Wait-free Computability. [Citation Graph (0, 0)][DBLP ] Conf ] Péter Gács Reliable Cellular Automata with Self-Organization. [Citation Graph (0, 0)][DBLP ] Conf ] Rajeev Alur , Thomas A. Henzinger , Orna Kupferman Alternating-time Temporal Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Richard J. Lipton , Paul J. Martino , Andy Neitzke On the Complexity of a Set-Union Problem. [Citation Graph (0, 0)][DBLP ] Conf ] J. Ian Munro , Venkatesh Raman Succinct Representation of Balanced Parentheses, Static Trees and Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Indyk Deterministic Superimposed Coding with Applications to Pattern Matching. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Farach Optimal Suffix Tree Construction with Large Alphabets. [Citation Graph (0, 0)][DBLP ] Conf ] Amihood Amir , Yonatan Aumann , Gad M. Landau , Moshe Lewenstein , Noa Lewenstein Pattern Matching with Swaps. [Citation Graph (0, 0)][DBLP ] Conf ] Leonid Khachiyan , Lorant Porkolab Computing Integral Points in Convex Semi-algebraic Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Tamal K. Dey Improved Bounds on Planar k-sets and k-levels. [Citation Graph (0, 0)][DBLP ] Conf ] Joel Hass , J. C. Lagarias , Nicholas Pippenger The Computational Complexity of Knot and Link Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Kasturi R. Varadarajan , Pankaj K. Agarwal Approximating Shortest Paths on an Nonconvex Polyhedron. [Citation Graph (0, 0)][DBLP ] Conf ] Artur Czumaj , Volker Stemann Randomized Allocation Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Dimitris Achlioptas , Michael S. O. Molloy The Analysis of a List-Coloring Algorithm on a Random Graph. [Citation Graph (0, 0)][DBLP ] Conf ] Leslie Ann Goldberg , Philip D. MacKenzie Contention Resolution with Guaranteed Constant Expected Delay. [Citation Graph (0, 0)][DBLP ] Conf ] Russ Bubley , Martin E. Dyer Path Coupling: A Technique for Proving Rapid Mixing in Markov Chains. [Citation Graph (0, 0)][DBLP ] Conf ] Ran Raz , Pierre McKenzie Separation of the Monotone NC Hierarchy. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Reinhardt , Eric Allender Making Nondeterminism Unambiguous. [Citation Graph (0, 0)][DBLP ] Conf ] Maria Luisa Bonet , Toniann Pitassi , Ran Raz No Feasible Interpolation for TC0-Frege Proofs. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander E. Andreev , Andrea E. F. Clementi , José D. P. Rolim , Luca Trevisan Weak Random Sources, Hitting Sets, and BPP Simulations. [Citation Graph (0, 0)][DBLP ] Conf ] Claudson F. Bornstein , Bruce M. Maggs , Gary L. Miller , R. Ravi Parallelizing Elimination Orders with Linear Fill. [Citation Graph (0, 0)][DBLP ] Conf ] Bruce M. Maggs , Friedhelm Meyer auf der Heide , Berthold Vöcking , Matthias Westermann Exploiting Locality for Data Management in Systems of Limited Bandwidth. [Citation Graph (0, 0)][DBLP ] Conf ] Matthew Andrews , Antonio Fernández , Mor Harchol-Balter , Frank Thomson Leighton , Lisa Zhang General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate). [Citation Graph (0, 0)][DBLP ] Conf ] Yair Bartal , John W. Byers , Danny Raz Global Optimization Using Local Information with Applications to Flow Control. [Citation Graph (0, 0)][DBLP ] Conf ] Shafi Goldwasser New Directions in Cryptography: Twenty Some Years Later. [Citation Graph (0, 0)][DBLP ] Conf ] Amos Fiat , Manor Mendel Truly Online Paging with Locality of Reference. [Citation Graph (0, 0)][DBLP ] Conf ] Sabah al-Binali The Competitive Analysis of Risk Taking with Applications to Online Trading. [Citation Graph (0, 0)][DBLP ] Conf ] Bala Kalyanasundaram , Kirk Pruhs Minimizing Flow Time Nonclairvoyantly. [Citation Graph (0, 0)][DBLP ] Conf ] Jon M. Kleinberg , Rajeev Motwani , Prabhakar Raghavan , Suresh Venkatasubramanian Storage Management for Evolving Databases. [Citation Graph (0, 0)][DBLP ] Conf ] Eyal Kushilevitz , Rafail Ostrovsky Replication is NOT Needed: SINGLE Database, Computationally-Private Information Retrieval. [Citation Graph (0, 0)][DBLP ] Conf ] Mihir Bellare , Russell Impagliazzo , Moni Naor Does Parallel Repetition Lower the Error in Computationally Sound Protocols? [Citation Graph (0, 0)][DBLP ] Conf ] Yair Frankel , Peter Gemmell , Philip D. MacKenzie , Moti Yung Optimal Resilience Proactive Public-Key Cryptosystems. [Citation Graph (0, 0)][DBLP ] Conf ] Mihir Bellare , Anand Desai , E. Jokipii , Phillip Rogaway A Concrete Security Treatment of Symmetric Encryption. [Citation Graph (0, 0)][DBLP ] Conf ] Howard J. Karloff , Uri Zwick A 7/8-Approximation Algorithm for MAX 3SAT? [Citation Graph (0, 0)][DBLP ] Conf ] Aravind Srinivasan Improved Approximations for Edge-Disjoint Paths, Unsplittable Flow, and Related Routing Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Stavros G. Kolliopoulos , Clifford Stein Improved Approximation Algorithms for Unsplittable Flow Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Marc Fischlin Lower Bounds for the Signature Size of Incremental Schemes. [Citation Graph (0, 0)][DBLP ] Conf ] Amit Sahai , Salil P. Vadhan A Complete Promise Problem for Statistical Zero-Knowledge. [Citation Graph (0, 0)][DBLP ] Conf ] Moni Naor , Omer Reingold Number-theoretic Constructions of Efficient Pseudo-random Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Jin-yi Cai , Ajay Nerurkar An Improved Worst-Case to Average-Case Connection for Lattice Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Michele Conforti , Gérard Cornuéjols , Ajai Kapoor , Kristina Vuskovic Finding an Even Hole in a Graph. [Citation Graph (0, 0)][DBLP ] Conf ] Jørgen Bang-Jensen , Tibor Jordán Edge-Connectivity Augmentation Preserving Simplicity. [Citation Graph (0, 0)][DBLP ] Conf ] Christopher Umans , William Lenhart Hamiltonian Cycles in Solid Grid Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Santosh Vempala A Random Sampling Based Algorithm for Learning the Intersection of Half-spaces. [Citation Graph (0, 0)][DBLP ] Conf ] Edith Cohen Learning Noisy Perceptrons by a Perceptron in Polynomial Time. [Citation Graph (0, 0)][DBLP ] Conf ] Andris Ambainis , Richard Desper , Martin Farach , Sampath Kannan Nearly Tight Bounds on the Learnability of Evolution. [Citation Graph (0, 0)][DBLP ] Conf ] Joseph Naor , Baruch Schieber Improved Approximations for Shallow-Light Spanning Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Yossi Azar Buy-at-Bulk Network Design. [Citation Graph (0, 0)][DBLP ] Conf ] Joseph Naor , Leonid Zosin A 2-Approximation Algorithm for the Directed Multiway Cut Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Sanjeev Arora Nearly Linear Time Approximation Schemes for Euclidean TSP and other Geometric Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Ramamohan Paturi , Pavel Pudlák , Francis Zane Satisfiability Coding Lemma. [Citation Graph (0, 0)][DBLP ] Conf ] Edith Hemaspaandra , Gerd Wechsung The Minimization Problem for Boolean Formulas. [Citation Graph (0, 0)][DBLP ] Conf ] Jaikumar Radhakrishnan , Amnon Ta-Shma Tight Bounds for Depth-two Superconcentrators. [Citation Graph (0, 0)][DBLP ] Conf ] Jin-yi Cai , D. Sivakumar , Martin Strauss Constant Depth Circuits and the Lutz Hypothesis. [Citation Graph (0, 0)][DBLP ] Conf ] 