Conferences in DBLP
Samir Khuller , Balaji Raghavachari Improved approximation algorithms for uniform connectivity problems. [Citation Graph (0, 0)][DBLP ] Conf ] David R. Karger A randomized fully polynomial time approximation scheme for the all terminal network reliability problem. [Citation Graph (0, 0)][DBLP ] Conf ] David R. Karger , Serge A. Plotkin Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flows. [Citation Graph (0, 0)][DBLP ] Conf ] Jon M. Kleinberg , Éva Tardos Approximations for the disjoint paths problem in high-diameter planar networks. [Citation Graph (0, 0)][DBLP ] Conf ] Matthew K. Franklin , Moti Yung Secure hypergraphs: privacy from partial broadcast (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Mihir Bellare , Oded Goldreich , Shafi Goldwasser Incremental cryptography and application to virus protection. [Citation Graph (0, 0)][DBLP ] Conf ] Mihir Bellare , Phillip Rogaway Provably secure session key distribution: the three party case. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew Chi-Chih Yao Security of quantum protocols against coherent measurements. [Citation Graph (0, 0)][DBLP ] Conf ] László Lovász , Peter Winkler Efficient stopping rules for Markov chains. [Citation Graph (0, 0)][DBLP ] Conf ] Yuval Rabani , Yuri Rabinovich , Alistair Sinclair A computational view of population genetics. [Citation Graph (0, 0)][DBLP ] Conf ] Haim Kaplan , Robert Endre Tarjan Persistent lists with catenation via recursive slow-down. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Bro Miltersen , Noam Nisan , Shmuel Safra , Avi Wigderson On data structures and asymmetric communication complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Persi Diaconis , Laurent Saloff-Coste What do we know about the Metropolis algorithm? [Citation Graph (0, 0)][DBLP ] Conf ] Stephen Ponzio A lower bound for integer multiplication with read-once branching programs. [Citation Graph (0, 0)][DBLP ] Conf ] Noam Nisan , Amnon Ta-Shma Symmetric logspace is closed under complement. [Citation Graph (0, 0)][DBLP ] Conf ] Jeff Edmonds , Chung Keung Poon A nearly optimal time-space lower bound for directed st -connectivity on the NNJAG model. [Citation Graph (0, 0)][DBLP ] Conf ] William E. Hart , Sorin Istrail Fast protein folding in the hydrophobic-hydrophilic model within three-eights of optimal (Extended Abstract). [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. [Citation Graph (0, 0)][DBLP ] Conf ] Sridhar Hannenhalli , Pavel A. Pevzner Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. [Citation Graph (0, 0)][DBLP ] Conf ] Lisa Hellerstein , Krishnan Pillaipakkamnatt , Vijay V. Raghavan , Dawn Wilkins How many queries are needed to learn? [Citation Graph (0, 0)][DBLP ] Conf ] Marek Karpinski , Angus Macintyre Polynomial bounds for VC dimension of sigmoidal neural networks. [Citation Graph (0, 0)][DBLP ] Conf ] Jyrki Kivinen , Manfred K. Warmuth Additive versus exponentiated gradient updates for linear prediction. [Citation Graph (0, 0)][DBLP ] Conf ] Nader H. Bshouty , Christino Tamon On the Fourier spectrum of monotone functions (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Prabhakar Raghavan , Eli Upfal Stochastic contention resolution with short delays. [Citation Graph (0, 0)][DBLP ] Conf ] Micah Adler , Soumen Chakrabarti , Michael Mitzenmacher , Lars Eilstrup Rasmussen Parallel randomized load balancing (Preliminary Version). [Citation Graph (0, 0)][DBLP ] Conf ] Mor Harchol-Balter , David Wolfe Bounding delays in packet-routing networks. [Citation Graph (0, 0)][DBLP ] Conf ] Yishay Mansour , Boaz Patt-Shamir Many-to-one packet routing on grids (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Aravind Srinivasan Improved approximations of packing and covering problems. [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Yossi Azar , Avrim Blum , Santosh Vempala Improved approximation guarantees for minimum-weight k -trees and prize-collecting salesmen. [Citation Graph (0, 0)][DBLP ] Conf ] Sanjeev Arora , David R. Karger , Marek Karpinski Polynomial time approximation schemes for dense instances of NP -hard problems. [Citation Graph (0, 0)][DBLP ] Conf ] Avrim Blum , Prasad Chalasani , Santosh Vempala A constant-factor approximation for the k -MST problem in the plane. [Citation Graph (0, 0)][DBLP ] Conf ] Paul Beame , Stephen A. Cook , Jeff Edmonds , Russell Impagliazzo , Toniann Pitassi The relative complexity of NP search problems. [Citation Graph (0, 0)][DBLP ] Conf ] Erich Grädel , Klaus Meer Descriptive complexity theory over the real numbers. [Citation Graph (1, 0)][DBLP ] Conf ] Jie Wang Average-case completeness of a word problem for groups. [Citation Graph (0, 0)][DBLP ] Conf ] Felipe Cucker , Marek Karpinski , Pascal Koiran , Thomas Lickteig , Kai Werther On real Turing machines that toss coins. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Prabhakar Raghavan , Hisao Tamaki Motion planning for a steering-constrained robot through moderate obstacles. [Citation Graph (0, 0)][DBLP ] Conf ] Lydia E. Kavraki , Jean-Claude Latombe , Rajeev Motwani , Prabhakar Raghavan Randomized query processing in robot path planning (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Rajeev Alur , Costas Courcoubetis , Mihalis Yannakakis Distinguishing tests for nondeterministic and probabilistic machines. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas A. Henzinger , Peter W. Kopke , Anuj Puri , Pravin Varaiya What's decidable about hybrid automata? [Citation Graph (0, 0)][DBLP ] Conf ] William R. Pulleyblank Two Steiner tree packing problems (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Daniel A. Spielman Linear-time encodable and decodable error-correcting codes. [Citation Graph (0, 0)][DBLP ] Conf ] Erich Kaltofen , Victor Shoup Subquadratic-time factoring of polynomials over finite fields. [Citation Graph (0, 0)][DBLP ] Conf ] Funda Ergün Testing multivariate linear functions: overcoming the generator bottleneck. [Citation Graph (0, 0)][DBLP ] Conf ] Arne Andersson , Johan Håstad , Ola Petersson A tight lower bound for searching a sorted array. [Citation Graph (0, 0)][DBLP ] Conf ] Arne Andersson , Torben Hagerup , Stefan Nilsson , Rajeev Raman Sorting in linear time? [Citation Graph (0, 0)][DBLP ] Conf ] Nabil Kahale , Frank Thomson Leighton , Yuan Ma , C. Greg Plaxton , Torsten Suel , Endre Szemerédi Lower bounds for sorting networks. [Citation Graph (0, 0)][DBLP ] Conf ] Ran Raz A parallel repetition theorem. [Citation Graph (0, 0)][DBLP ] Conf ] Uriel Feige , Joe Kilian Impossibility results for recycling random bits in two-prover proof systems. [Citation Graph (0, 0)][DBLP ] Conf ] William Aiello , Mihir Bellare , Ramarathnam Venkatesan Knowledge on the average-perfect, statistical and logarithmic. [Citation Graph (0, 0)][DBLP ] Conf ] Michael E. Saks , Aravind Srinivasan , Shiyu Zhou Explicit dispersers with polylog degree. [Citation Graph (0, 0)][DBLP ] Conf ] Sunil Arya , Gautam Das , David M. Mount , Jeffrey S. Salowe , Michiel H. M. Smid Euclidean spanners: short, thin, and lanky. [Citation Graph (0, 0)][DBLP ] Conf ] Zvi Galil , Xiangdong Yu Short length versions of Menger's theorem (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Yefim Dinitz , Zeev Nutov A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenance. [Citation Graph (0, 0)][DBLP ] Conf ] Monika Rauch Henzinger , Valerie King Randomized dynamic graph algorithms with polylogarithmic time per operation. [Citation Graph (0, 0)][DBLP ] Conf ] Shlomi Dolev , Evangelos Kranakis , Danny Krizanc , David Peleg Bubbles: adaptive routing scheme for high-speed dynamic networks (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Yehuda Afek , Dalia Dauber , Dan Touitou Wait-free made fast (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Bhaskar Ghosh , Frank Thomson Leighton , Bruce M. Maggs , S. Muthukrishnan , C. Greg Plaxton , Rajmohan Rajaraman , Andréa W. Richa , Robert Endre Tarjan , David Zuckerman Tight analyses of two local load balancing algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Eyal Kushilevitz , Rafail Ostrovsky , Adi Rosén Log-space polynomial end-to-end communication. [Citation Graph (0, 0)][DBLP ] Conf ] Mikael Goldmann , Johan Håstad Monotone circuits for connectivity have depth (log n)2-o(1) (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Maria Luisa Bonet , Toniann Pitassi , Ran Raz Lower bounds for cutting planes proofs with small coefficients. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Beals , Tetsuro Nishino , Keisuke Tanaka More on the complexity of negation-limited circuits. [Citation Graph (0, 0)][DBLP ] Conf ] Ilan Kremer , Noam Nisan , Dana Ron On randomized one-round communication complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Ran Canetti , Sandy Irani Bounding the power of preemption in randomized scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Amotz Bar-Noy , Ran Canetti , Shay Kutten , Yishay Mansour , Baruch Schieber Bandwidth allocation with preemption. [Citation Graph (1, 0)][DBLP ] Conf ] Amos Fiat , Anna R. Karlin Randomized and multipointer paging with locality of reference. [Citation Graph (0, 0)][DBLP ] Conf ] Uriel Feige Randomized graph products, chromatic numbers, and Lovasz theta-function. [Citation Graph (0, 0)][DBLP ] Conf ] Al Borchers , Ding-Zhu Du The k-Steiner ratio in graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Raschle , Klaus Simon Recognition of graphs with threshold dimension two. [Citation Graph (0, 0)][DBLP ] Conf ] David Eppstein Geometric lower bounds for parametric matroid optimization. [Citation Graph (0, 0)][DBLP ] Conf ] Nancy M. Amato , Michael T. Goodrich , Edgar A. Ramos Computing faces in segment and simplex arrangements (Preliminary Version). [Citation Graph (0, 0)][DBLP ] Conf ] Gary L. Miller , Dafna Talmor , Shang-Hua Teng , Noel Walkington A Delaunay based numerical method for three dimensions: generation, formulation, and partition. [Citation Graph (0, 0)][DBLP ] Conf ] Paolo Ferragina , Roberto Grossi A fully-dynamic data structure for external substring search (Extended Abstract). [Citation Graph (2, 0)][DBLP ] Conf ] Martin Farach , Mikkel Thorup String matching in Lempel-Ziv compressed strings. [Citation Graph (0, 0)][DBLP ] Conf ] Artur Czumaj , Zvi Galil , Leszek Gasieniec , Kunsoo Park , Wojciech Plandowski Work-time-optimal parallel algorithms for string problems. [Citation Graph (0, 0)][DBLP ] Conf ] Noam Nisan , Avi Wigderson On the complexity of bilinear forms: dedicated to the memory of Jacques Morgenstern. [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Chazelle Lower bounds for off-line range searching. [Citation Graph (0, 0)][DBLP ] Conf ] Victor Y. Pan Optimal (up to polylog factors) sequential and parallel algorithms for approximating complex polynomial zeros. [Citation Graph (0, 0)][DBLP ] Conf ] John H. Reif Work efficient parallel solution of Toeplitz systems and polynomial GCD. [Citation Graph (0, 0)][DBLP ] Conf ] 