Conferences in DBLP
Eyal Kushilevitz , Nathan Linial , Rafail Ostrovsky The Linear-Array Conjecture in Communication Complexity is False. [Citation Graph (0, 0)][DBLP ] Conf ] Johan Håstad Testing of the Long Code and Hardness for Clique. [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Yossi Matias , Mario Szegedy The Space Complexity of Approximating the Frequency Moments. [Citation Graph (4, 0)][DBLP ] Conf ] Shiva Chaudhuri , Jaikumar Radhakrishnan Deterministic Restrictions in Circuit Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Joseph Cheriyan , Ramakrishna Thurimella Fast Algorithms for k -Shredders and k -Node Connectivity Augmentation (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] András A. Benczúr , David R. Karger Approximating s-t Minimum Cuts in Õ (n 2 ) Time. [Citation Graph (0, 0)][DBLP ] Conf ] David R. Karger Minimum Cuts in Near-Linear Time. [Citation Graph (0, 0)][DBLP ] Conf ] Hiroshi Nagamochi , Toshihide Ibaraki Deterministic Õ (nm) Time Edge-Splitting in Undirected Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Moni Naor Evaluation May Be Easier Than Generation (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Mitsunori Ogihara The PL Hierarchy Collapses. [Citation Graph (0, 0)][DBLP ] Conf ] Yehuda Afek , Yishay Mansour , Zvi Ostfeld Convergence Complexity of Optimistic Rate Based Flow Control Algorithms (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Miklós Ajtai Generating Hard Instances of Lattice Problems (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Victor Milenkovic Translational Polygon Containment and Minimal Enclosure using Linear Programming Based Restriction. [Citation Graph (0, 0)][DBLP ] Conf ] Marshall W. Bern , Amit Sahai Pushing Disks Together - The Continuous-Motion Case. [Citation Graph (0, 0)][DBLP ] Conf ] Francesco Bergadano , Dario Catalano , Stefano Varricchio Learning Sat-k -DNF Formulas from Membership Queries. [Citation Graph (0, 0)][DBLP ] Conf ] Nader H. Bshouty Towards the Learnability of DNF Formulae. [Citation Graph (0, 0)][DBLP ] Conf ] Nicolò Cesa-Bianchi , Eli Dichterman , Paul Fischer , Hans-Ulrich Simon Noise-Tolerant Learning Near the Information-Theoretic Bound. [Citation Graph (0, 0)][DBLP ] Conf ] Nader H. Bshouty , Sally A. Goldman , H. David Mathias , Subhash Suri , Hisao Tamaki Noise-Tolerant Distribution-Free Learning of General Geometric Concepts. [Citation Graph (0, 0)][DBLP ] Conf ] Eric Allender , Robert Beals , Mitsunori Ogihara The Complexity of Matrix Rank and Feasible Systems of Linear Equations (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Saugata Basu , Richard Pollack , Marie-Françoise Roy Computing Roadmaps of Semi-Algebraic Sets (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Matthew Clegg , Jeff Edmonds , Russell Impagliazzo Using the Groebner Basis Algorithm to Find Proofs of Unsatisfiability. [Citation Graph (0, 0)][DBLP ] Conf ] Deepak Kapur , Tushar Saxena Sparsity Considerations in Dixon Resultants. [Citation Graph (0, 0)][DBLP ] Conf ] Darren Erik Vengroff , Jeffrey Scott Vitter Efficient 3-D Range Searching in External Memory. [Citation Graph (2, 0)][DBLP ] Conf ] Haim Kaplan , Robert Endre Tarjan Purely Functional Representations of Catenable Sorted Lists. [Citation Graph (0, 0)][DBLP ] Conf ] Lov K. Grover A Fast Quantum Mechanical Algorithm for Database Search. [Citation Graph (0, 0)][DBLP ] Conf ] Maria Luisa Bonet , Cynthia A. Phillips , Tandy Warnow , Shibu Yooseph Constructing Evolutionary Trees in the Presence of Polymorphic Characters. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Farach , Sampath Kannan Efficient Algorithms for Inverting Evolution. [Citation Graph (0, 0)][DBLP ] Conf ] James Aspnes , Orli Waarts Modular Competitiveness for Distributed Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Michael T. Goodrich Communication-Efficient Parallel Sorting (Preliminary Version). [Citation Graph (0, 0)][DBLP ] Conf ] Matthew Andrews , Frank Thomson Leighton , Panagiotis Takis Metaxas , Lisa Zhang Automatic Methods for Hiding Latency in High Bandwidth Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Yuan Ma An O (n log n )-Size Fault-Tolerant Sorting Network (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Amnon Ta-Shma On Extracting Randomness From Weak Random Sources (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] David Zuckerman Randomness-Optimal Sampling, Extractors, and Constructive Leader Election. [Citation Graph (0, 0)][DBLP ] Conf ] David Bruce Wilson Generating Random Spanning Trees More Quickly than the Cover Time. [Citation Graph (0, 0)][DBLP ] Conf ] Tassos Dimitriou , Russell Impagliazzo Towards an Analysis of Local Optimization Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Uriel Feige A Threshold of ln n for Approximating Set Cover (Preliminary Version). [Citation Graph (2, 0)][DBLP ] Conf ] S. Thomas McCormick Fast Algorithms for Parametric Scheduling Come from Extensions to Parametric Maximum Flow. [Citation Graph (0, 0)][DBLP ] Conf ] Sanjeev Khanna , Rajeev Motwani Towards a Syntactic Characterization of PTAS. [Citation Graph (1, 0)][DBLP ] Conf ] Philip N. Klein , Hsueh-I Lu Efficient Approximation Algorithms for Semidefinite Programs Arising from MAX CUT and COLORING. [Citation Graph (0, 0)][DBLP ] Conf ] Andrei Z. Broder , Eli Upfal Dynamic Deflection Routing on Arrays (Preliminary Version). [Citation Graph (0, 0)][DBLP ] Conf ] Robert Cypher , Friedhelm Meyer auf der Heide , Christian Scheideler , Berthold Vöcking Universal Algorithms for Store-and-Forward and Wormhole Routing. [Citation Graph (0, 0)][DBLP ] Conf ] Yuval Rabani , Éva Tardos Distributed Packet Switching in Arbitrary Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Allan Borodin , Jon M. Kleinberg , Prabhakar Raghavan , Madhu Sudan , David P. Williamson Adversarial Queueing Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Joel Friedman Computing Betti Numbers via Combinatorial Laplacians. [Citation Graph (0, 0)][DBLP ] Conf ] Bojan Mohar Embedding Graphs in an Arbitrary Surface in Linear Time. [Citation Graph (0, 0)][DBLP ] Conf ] Tamal K. Dey , Sumanta Guha Algorithms for Manifolds and Simplicial Complexes in Euclidean 3-Space (Preliminary Version). [Citation Graph (0, 0)][DBLP ] Conf ] Saugata Basu On Bounding the Betti Numbers and Computing the Euler Characteristic of Semi-Algebraic Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Hans Kellerer , Thomas Tautenhahn , Gerhard J. Woeginger Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine. [Citation Graph (0, 0)][DBLP ] Conf ] Howard J. Karloff How Good is the Goemans-Williamson MAX CUT Algorithm? [Citation Graph (0, 0)][DBLP ] Conf ] Petr Slavík A Tight Analysis of the Greedy Algorithm for Set Cover. [Citation Graph (0, 0)][DBLP ] Conf ] Avrim Blum , R. Ravi , Santosh Vempala A Constant-factor Approximation Algorithm for the k MST Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Bonnie Berger , Jon M. Kleinberg , Frank Thomson Leighton Reconstructing a Three-Dimensional Model with Arbitrary Errors. [Citation Graph (0, 0)][DBLP ] Conf ] Michael J. Kearns , Yishay Mansour On the Boosting Ability of Top-Down Decision Tree Learning Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Dana Angluin , Jeffery Westbrook , Wenhong Zhu Robot Navigation with Range Queries. [Citation Graph (0, 0)][DBLP ] Conf ] Donald Beaver Correlated Pseudorandomness and the Complexity of Private Computations. [Citation Graph (0, 0)][DBLP ] Conf ] Cynthia Dwork , Jeffrey B. Lotspiech , Moni Naor Digital Signets: Self-Enforcing Protection of Digital Information (Preliminary Version). [Citation Graph (0, 0)][DBLP ] Conf ] Yair Frankel , Peter Gemmell , Moti Yung Witness-Based Cryptographic Program Checking and Robust Function Sharing. [Citation Graph (0, 0)][DBLP ] Conf ] Nathan Linial , Ori Sasson Non-Expansive Hashing. [Citation Graph (1, 0)][DBLP ] Conf ] Baruch Awerbuch , Yossi Azar , Amos Fiat , Frank Thomson Leighton Making Commitments in the Face of Uncertainty: How to Pick a Winner Almost Every Time (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Yair Bartal , Amos Fiat , Stefano Leonardi Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing. [Citation Graph (0, 0)][DBLP ] Conf ] Eyal Kushilevitz , Rafail Ostrovsky , Adi Rosén Characterizing Linear Size Circuits in Terms of Privacy. [Citation Graph (0, 0)][DBLP ] Conf ] Juraj Hromkovic , Georg Schnitger Nondeterministic Communication with a Limited Number of Advice Bits. [Citation Graph (0, 0)][DBLP ] Conf ] Ilan Newman , Mario Szegedy Public vs. Private Coin Flips in One Round Communication Games (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Neil Robertson , Daniel P. Sanders , Paul D. Seymour , Robin Thomas Efficiently Four-Coloring Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel A. Spielman Faster Isomorphism Testing of Strongly Regular Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Alok Aggarwal , Jon M. Kleinberg , David P. Williamson Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout. [Citation Graph (0, 0)][DBLP ] Conf ] Xudong Fu Modular Coloring Formulas Are Hard for Cutting Planes Proofs. [Citation Graph (0, 0)][DBLP ] Conf ] László Babai , Anna Gál , János Kollár , Lajos Rónyai , Tibor Szabó , Avi Wigderson Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Dima Grigoriev , Marek Karpinski , Friedhelm Meyer auf der Heide , Roman Smolensky A Lower Bound for Randomized Algebraic Decision Trees. [Citation Graph (0, 0)][DBLP ] Conf ] William S. Evans , Nicholas Pippenger Lower Bounds for Noisy Boolean Decision Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Donald Beaver Adaptive Zero Knowledge and Computational Equivocation (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Ran Canetti , Uriel Feige , Oded Goldreich , Moni Naor Adaptively Secure Multi-Party Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Tatsuaki Okamoto On Relationships between Statistical Zero-Knowledge Proofs. [Citation Graph (0, 0)][DBLP ] Conf ] S. Rao Kosaraju , Arthur L. Delcher Large-Scale Assembly of DNA Strings and Space-Efficient Construction of Suffix Trees (Correction). [Citation Graph (0, 0)][DBLP ] Conf ] 