Conferences in DBLP
Katalin Friedl , Gábor Ivanyos , Frédéric Magniez , Miklos Santha , Pranab Sen Hidden translation and orbit coset in quantum computing. [Citation Graph (0, 0)][DBLP ] Conf ] Leonid Gurvits Classical deterministic complexity of Edmonds' Problem and quantum entanglement. [Citation Graph (0, 0)][DBLP ] Conf ] Dorit Aharonov , Amnon Ta-Shma Adiabatic quantum state generation and statistical zero knowledge. [Citation Graph (0, 0)][DBLP ] Conf ] Moses Charikar , Liadan O'Callaghan , Rina Panigrahy Better streaming algorithms for clustering problems. [Citation Graph (0, 0)][DBLP ] Conf ] C. Greg Plaxton Approximation algorithms for hierarchical location problems. [Citation Graph (0, 0)][DBLP ] Conf ] Wenceslas Fernandez de la Vega , Marek Karpinski , Claire Kenyon , Yuval Rabani Approximation schemes for clustering problems. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew M. Childs , Richard Cleve , Enrico Deotto , Edward Farhi , Sam Gutmann , Daniel A. Spielman Exponential algorithmic speedup by a quantum walk. [Citation Graph (0, 0)][DBLP ] Conf ] Hartmut Klauck Quantum time-space tradeoffs for sorting. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew Chi-Chih Ya On the power of quantum fingerprinting. [Citation Graph (0, 0)][DBLP ] Conf ] Yossi Azar , Yossi Richter Management of multi-queue switches in QoS networks. [Citation Graph (0, 0)][DBLP ] Conf ] Eyal Amir , Robert Krauthgamer , Satish Rao Constant factor approximation of vertex-cuts in planar graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Baruch Awerbuch , Yossi Azar , Niv Buchbinder , Joseph Naor The online set cover problem. [Citation Graph (0, 0)][DBLP ] Conf ] Iordanis Kerenidis , Ronald de Wolf Exponential lower bound for 2-query locally decodable codes via a quantum argument. [Citation Graph (0, 0)][DBLP ] Conf ] Gábor Tardos Optimal probabilistic fingerprint codes. [Citation Graph (0, 0)][DBLP ] Conf ] Venkatesan Guruswami , Piotr Indyk Linear time encodable and list decodable codes. [Citation Graph (0, 0)][DBLP ] Conf ] Don Coppersmith , Madhu Sudan Reconstructing curves in three (and higher) dimensional space from noisy data. [Citation Graph (0, 0)][DBLP ] Conf ] Lukasz Kowalik , Maciej Kurowski Short path queries in planar graphs in constant time. [Citation Graph (0, 0)][DBLP ] Conf ] Mikkel Thorup Integer priority queues with decrease key in constant time and the single source shortest paths problem. [Citation Graph (0, 0)][DBLP ] Conf ] Camil Demetrescu , Giuseppe F. Italiano A new approach to dynamic all pairs shortest paths. [Citation Graph (0, 0)][DBLP ] Conf ] Richard Cole , Ramesh Hariharan A fast algorithm for computing steiner edge connectivity. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Rettinger , Klaus Weihrauch The computational complexity of some julia sets. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Sauerhoff , Philipp Woelfel Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions. [Citation Graph (0, 0)][DBLP ] Conf ] Adam Kalai , Rocco A. Servedio Boosting in the presence of noise. [Citation Graph (0, 0)][DBLP ] Conf ] Elchanan Mossel , Ryan O'Donnell , Rocco A. Servedio Learning juntas. [Citation Graph (0, 0)][DBLP ] Conf ] Jeong Han Kim , Van H. Vu Generating random regular graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Dimitris Achlioptas , Yuval Peres The threshold for random k-SAT is 2k (ln 2 - O(k)). [Citation Graph (0, 0)][DBLP ] Conf ] René Beier , Berthold Vöcking Random knapsack in expected polynomial time. [Citation Graph (0, 0)][DBLP ] Conf ] Nikhil Bansal , Kirk Pruhs Server scheduling in the Lp norm: a rising tide lifts all boat. [Citation Graph (0, 0)][DBLP ] Conf ] Chryssis Georgiou , Alexander Russell , Alexander A. Shvartsman Work-competitive scheduling for cooperative computing with dynamic groups. [Citation Graph (0, 0)][DBLP ] Conf ] Panagiota Fatourou , Faith Ellen Fich , Eric Ruppert A tight time lower bound for space-optimal implementations of multi-writer snapshots. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas P. Hayes Randomly coloring graphs of girth at least five. [Citation Graph (0, 0)][DBLP ] Conf ] Ben Morris , Yuval Peres Evolving sets and mixin. [Citation Graph (0, 0)][DBLP ] Conf ] Sergey Bobkov , Prasad Tetali Modified log-sobolev inequalities, mixing and hypercontractivity. [Citation Graph (0, 0)][DBLP ] Conf ] Anna C. Gilbert , Howard J. Karloff On the fractal behavior of TCP. [Citation Graph (0, 0)][DBLP ] Conf ] Gerth Stølting Brodal , Rolf Fagerberg On the limits of cache-obliviousness. [Citation Graph (0, 0)][DBLP ] Conf ] Tugkan Batu , Funda Ergün , Joe Kilian , Avner Magen , Sofya Raskhodnikova , Ronitt Rubinfeld , Rahul Sami A sublinear algorithm for weakly approximating edit distance. [Citation Graph (0, 0)][DBLP ] Conf ] Ryan O'Donnell , Rocco A. Servedio New degree bounds for polynomial threshold functions. [Citation Graph (0, 0)][DBLP ] Conf ] Ziv Bar-Yossef Sampling lower bounds via information theory. [Citation Graph (0, 0)][DBLP ] Conf ] Eli Ben-Sasson , Prahladh Harsha , Sofya Raskhodnikova Some 3CNF properties are hard to test. [Citation Graph (0, 0)][DBLP ] Conf ] Valentine Kabanets , Russell Impagliazzo Derandomizing polynomial identity tests means proving circuit lower bounds. [Citation Graph (0, 0)][DBLP ] Conf ] Anupam Gupta , Amit Kumar , Tim Roughgarden Simpler and better approximation algorithms for network design. [Citation Graph (0, 0)][DBLP ] Conf ] Jiangzhuo Chen , Rajmohan Rajaraman , Ravi Sundaram Meet and merge: approximation algorithms for confluent flows. [Citation Graph (0, 0)][DBLP ] Conf ] Yossi Azar , Edith Cohen , Amos Fiat , Haim Kaplan , Harald Räcke Optimal oblivious routing in polynomial time. [Citation Graph (0, 0)][DBLP ] Conf ] Jochen Könemann , R. Ravi Primal-dual meets local search: approximating MST's with nonuniform degree bounds. [Citation Graph (0, 0)][DBLP ] Conf ] Miklós Ajtai The worst-case behavior of schnorr's algorithm approximating the shortest nonzero vector in a lattice. [Citation Graph (0, 0)][DBLP ] Conf ] Oded Regev New lattice based cryptographic constructions. [Citation Graph (0, 0)][DBLP ] Conf ] Rosario Gennaro , Yael Gertner , Jonathan Katz Lower bounds on the efficiency of encryption and digital signature schemes. [Citation Graph (0, 0)][DBLP ] Conf ] Ivan Damgård , Jens Groth Non-interactive and reusable non-malleable commitment schemes. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Krauthgamer , James R. Lee The intrinsic dimensionality of graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Jittat Fakcharoenphol , Satish Rao , Kunal Talwar A tight bound on approximating arbitrary metrics by tree metrics. [Citation Graph (0, 0)][DBLP ] Conf ] Yuri Rabinovich On average distortion of embedding metrics into the line and into L1. [Citation Graph (0, 0)][DBLP ] Conf ] Yair Bartal , Nathan Linial , Manor Mendel , Assaf Naor On metric ramsey-type phenomena. [Citation Graph (0, 0)][DBLP ] Conf ] Moshe Dror , Alon Efrat , Anna Lubiw , Joseph S. B. Mitchell Touring a sequence of polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Jie Gao , Li Zhang Well-separated pair decomposition for the unit-disk graph metric and its applications. [Citation Graph (0, 0)][DBLP ] Conf ] Tamal K. Dey , Joachim Giesen , Matthias John Alpha-shapes and flow shapes are homotopy equivalent. [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Yossi Azar , Adam Meyerson Reducing truth-telling online mechanisms to online optimization. [Citation Graph (0, 0)][DBLP ] Conf ] Elliot Anshelevich , Anirban Dasgupta , Éva Tardos , Tom Wexler Near-optimal network design with selfish agents. [Citation Graph (0, 0)][DBLP ] Conf ] Richard Cole , Yevgeniy Dodis , Tim Roughgarden Pricing network edges for heterogeneous selfish users. [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Chazelle , Ding Liu , Avner Magen Sublinear geometric algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Boris Aronov , János Pach , Micha Sharir , Gábor Tardos Distinct distances in three and higher dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Boris Aronov , Vladlen Koltun , Micha Sharir Cutting triangular cycles of lines in space. [Citation Graph (0, 0)][DBLP ] Conf ] Adam L. Buchsbaum , Howard J. Karloff , Claire Kenyon , Nick Reingold , Mikkel Thorup OPT versus LOAD in dynamic storage allocation. [Citation Graph (0, 0)][DBLP ] Conf ] Robert D. Kleinberg , Frank Thomson Leighton Consistent load balancing via spread minimization. [Citation Graph (0, 0)][DBLP ] Conf ] Micah Adler , Eran Halperin , Richard M. Karp , Vijay V. Vazirani A stochastic process on the hypercube with applications to peer-to-peer networks. [Citation Graph (0, 0)][DBLP ] Conf ] Eran Halperin , Robert Krauthgamer Polylogarithmic inapproximability. [Citation Graph (0, 0)][DBLP ] Conf ] Irit Dinur , Venkatesan Guruswami , Subhash Khot , Oded Regev A new multilayered PCP and the hardness of hypergraph vertex cover. [Citation Graph (0, 0)][DBLP ] Conf ] Chi-Jen Lu , Omer Reingold , Salil P. Vadhan , Avi Wigderson Extractors: optimal up to constant factors. [Citation Graph (0, 0)][DBLP ] Conf ] Eli Ben-Sasson , Madhu Sudan , Salil P. Vadhan , Avi Wigderson Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. [Citation Graph (0, 0)][DBLP ] Conf ] Anna Östlin , Rasmus Pagh Uniform hashing in constant time and linear space. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Dietzfelbinger , Philipp Woelfel Almost random graphs with simple hash functions. [Citation Graph (0, 0)][DBLP ] Conf ] Haim Kaplan , Eyal Molad , Robert Endre Tarjan Dynamic rectangular intersection with priorities. [Citation Graph (0, 0)][DBLP ] Conf ] Mikkel Thorup Space efficient dynamic stabbing with fast queries. [Citation Graph (0, 0)][DBLP ] Conf ] Anna Gál , Adi Rosén Lower bounds on the amount of randomness in private computation. [Citation Graph (0, 0)][DBLP ] Conf ] T. S. Jayram , Subhash Khot , Ravi Kumar , Yuval Rabani Cell-probe lower bounds for the partial match problem. [Citation Graph (0, 0)][DBLP ] Conf ] T. S. Jayram , Ravi Kumar , D. Sivakumar Two applications of information complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Yehuda Lindell Bounded-concurrent secure two-party computation without setup assumptions. [Citation Graph (0, 0)][DBLP ] Conf ] Martin E. Dyer Approximate counting by dynamic programming. [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Asaf Shapira Testing subgraphs in directed graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Toshiya Itoh , Yoshinori Takei , Jun Tarui On the sample size of k-restricted min-wise independent permutations and other k-wise distributions. [Citation Graph (0, 0)][DBLP ] Conf ] Joel Friedman A proof of Alon's second eigenvalue conjecture. [Citation Graph (0, 0)][DBLP ] Conf ] 