Conferences in DBLP
Boaz Barak , Guy Kindler , Ronen Shaltiel , Benny Sudakov , Avi Wigderson Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors. [Citation Graph (0, 0)][DBLP ] Conf ] Ran Raz Extractors with weak random seeds. [Citation Graph (0, 0)][DBLP ] Conf ] Andrej Bogdanov Pseudorandom generators for low degree polynomials. [Citation Graph (0, 0)][DBLP ] Conf ] Luca Trevisan On uniform amplification of hardness in NP. [Citation Graph (0, 0)][DBLP ] Conf ] Patrick Briest , Piotr Krysta , Berthold Vöcking Approximation techniques for utilitarian mechanism design. [Citation Graph (0, 0)][DBLP ] Conf ] Christos H. Papadimitriou Computing correlated equilibria in multi-player games. [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Yossi Azar , Amir Epstein Large the price of routing unsplittable flow. [Citation Graph (0, 0)][DBLP ] Conf ] George Christodoulou , Elias Koutsoupias The price of anarchy of finite congestion games. [Citation Graph (0, 0)][DBLP ] Conf ] Bruno Codenotti , Benton McCune , Kasturi R. Varadarajan Market equilibrium via the excess demand function. [Citation Graph (0, 0)][DBLP ] Conf ] Oded Regev On lattices, learning with errors, random linear codes, and cryptography. [Citation Graph (0, 0)][DBLP ] Conf ] Miklós Ajtai Representing hard lattices with O(n log n) bits. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Worm Mortensen , Rasmus Pagh , Mihai Patrascu On dynamic range reporting in one dimension. [Citation Graph (0, 0)][DBLP ] Conf ] Mikkel Thorup Worst-case update times for fully-dynamic all-pairs shortest paths. [Citation Graph (0, 0)][DBLP ] Conf ] Lance Fortnow Beyond NP: the work and legacy of Larry Stockmeyer. [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Asaf Shapira Every monotone graph property is testable. [Citation Graph (0, 0)][DBLP ] Conf ] Eldar Fischer , Ilan Newman Testing versus estimation of graph properties. [Citation Graph (0, 0)][DBLP ] Conf ] Ronitt Rubinfeld , Rocco A. Servedio Testing monotone high-dimensional distributions. [Citation Graph (0, 0)][DBLP ] Conf ] Katalin Friedl , Gábor Ivanyos , Miklos Santha Efficient testing of groups. [Citation Graph (0, 0)][DBLP ] Conf ] Joseph Cheriyan , Adrian Vetta Approximation algorithms for network design with metric costs. [Citation Graph (0, 0)][DBLP ] Conf ] Moses Charikar , Adriana Karagiozova On non-uniform multicommodity buy-at-bulk network design. [Citation Graph (0, 0)][DBLP ] Conf ] Chandra Chekuri , Sanjeev Khanna , F. Bruce Shepherd Multicommodity flow, well-linked terminals, and routing problems. [Citation Graph (0, 0)][DBLP ] Conf ] Mohammad Taghi Hajiaghayi , Jeong Han Kim , Tom Leighton , Harald Räcke Oblivious routing in directed graphs with random demands. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Indyk , David P. Woodruff Optimal approximations of the frequency moments of data streams. [Citation Graph (0, 0)][DBLP ] Conf ] Gereon Frahling , Christian Sohler Coresets in dynamic geometric data streams. [Citation Graph (0, 0)][DBLP ] Conf ] Rafail Ostrovsky , Yuval Rabani Low distortion embeddings for edit distance. [Citation Graph (0, 0)][DBLP ] Conf ] Mihai Badoiu , Julia Chuzhoy , Piotr Indyk , Anastasios Sidiropoulos Low-distortion embeddings of general metrics into the line. [Citation Graph (0, 0)][DBLP ] Conf ] Mikolaj Bojanczyk , Thomas Colcombet Tree-walking automata do not recognize all regular languages. [Citation Graph (0, 0)][DBLP ] Conf ] Itai Benjamini , Oded Schramm , David Bruce Wilson Balanced boolean functions that can be evaluated so that every input bit is unlikely to be read. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Alekhnovich Lower bounds for k-DNF resolution on random 3-CNFs. [Citation Graph (0, 0)][DBLP ] Conf ] Michal Koucký , Pavel Pudlák , Denis Thérien Bounded-depth circuits: separating wires from gates. [Citation Graph (0, 0)][DBLP ] Conf ] Eli Ben-Sasson , Madhu Sudan Simple PCPs with poly-log rate and query complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Matthew Andrews , Lisa Zhang Hardness of the undirected edge-disjoint paths problem. [Citation Graph (0, 0)][DBLP ] Conf ] Matthew Andrews , Lisa Zhang Hardness of the undirected congestion minimization problem. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Alekhnovich , Sanjeev Arora , Iannis Tourlakis Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy. [Citation Graph (0, 0)][DBLP ] Conf ] Saugata Basu , Richard Pollack , Marie-Françoise Roy Computing the first Betti number and the connected components of semi-algebraic sets. [Citation Graph (0, 0)][DBLP ] Conf ] Saugata Basu Polynomial time algorithm for computing the top Betti numbers of semi-algebraic sets defined by quadratic inequalities. [Citation Graph (0, 0)][DBLP ] Conf ] Xi Chen , Xiaotie Deng On algorithms for discrete and approximate brouwer fixed points. [Citation Graph (0, 0)][DBLP ] Conf ] Yossi Azar , Amir Epstein Convex programming for scheduling unrelated parallel machines. [Citation Graph (0, 0)][DBLP ] Conf ] Saurabh Sanghvi , Salil P. Vadhan The round complexity of two-party random selection. [Citation Graph (0, 0)][DBLP ] Conf ] Lance Fortnow , Rahul Santhanam , Luca Trevisan Hierarchies for semantic classes. [Citation Graph (0, 0)][DBLP ] Conf ] Haim Kaplan , Eyal Kushilevitz , Yishay Mansour Learning with attribute costs. [Citation Graph (0, 0)][DBLP ] Conf ] Elchanan Mossel , Sébastien Roch Learning nonsingular phylogenies and hidden Markov models. [Citation Graph (0, 0)][DBLP ] Conf ] Omer Reingold Undirected ST-connectivity in log-space. [Citation Graph (0, 0)][DBLP ] Conf ] Lujun Jia , Guolong Lin , Guevara Noubir , Rajmohan Rajaraman , Ravi Sundaram Universal approximations for TSP, Steiner tree, and set cover. [Citation Graph (0, 0)][DBLP ] Conf ] Naveen Garg Saving an epsilon: a 2-approximation for the k-MST problem in graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Ben Morris The mixing time of the Thorp shuffle. [Citation Graph (0, 0)][DBLP ] Conf ] Mary Cryan , Martin E. Dyer , Dana Randall Approximately counting integral flows and cell-bounded contingency tables. [Citation Graph (0, 0)][DBLP ] Conf ] Van H. Vu Spectral norm of random matrices. [Citation Graph (0, 0)][DBLP ] Conf ] Terence Tao , Van H. Vu On random pm 1 matrices: singularity and determinant. [Citation Graph (0, 0)][DBLP ] Conf ] Abraham Flaxman , Alan M. Frieze , Juan C. Vera On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem. [Citation Graph (0, 0)][DBLP ] Conf ] Micah Adler , Jeff Edmonds , Jirí Matousek Towards asymptotic optimality in probabilistic packet marking. [Citation Graph (0, 0)][DBLP ] Conf ] Yaoyun Shi Tensor norms and the classical communication complexity of nonlocal quantum measurement. [Citation Graph (0, 0)][DBLP ] Conf ] Sean Hallgren Fast quantum algorithms for computing the unit group and class group of a number field. [Citation Graph (0, 0)][DBLP ] Conf ] Arthur Schmidt , Ulrich Vollmer Polynomial time quantum algorithm for the computation of the unit group of a number field. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Ben-Or , Avinatan Hassidim Fast quantum byzantine agreement. [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Konstantin Makarychev , Yury Makarychev , Assaf Naor Quadratic forms on graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Elkin , Yuval Emek , Daniel A. Spielman , Shang-Hua Teng Lower-stretch spanning trees. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Gonçalves Edge partition of planar sraphs into two outerplanar graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Luis von Ahn , Nicholas J. Hopper , John Langford Covert two-party computation. [Citation Graph (0, 0)][DBLP ] Conf ] Hoeteck Wee On obfuscating point functions. [Citation Graph (0, 0)][DBLP ] Conf ] Rafael Pass , Alon Rosen New and improved constructions of non-malleable cryptographic protocols. [Citation Graph (0, 0)][DBLP ] Conf ] Matt Lepinski , Silvio Micali , Abhi Shelat Collusion-free protocols. [Citation Graph (0, 0)][DBLP ] Conf ] Sanjeev Arora , James R. Lee , Assaf Naor Euclidean distortion and the sparsest cut. [Citation Graph (0, 0)][DBLP ] Conf ] Uriel Feige , Mohammad Taghi Hajiaghayi , James R. Lee Improved approximation algorithms for minimum-weight vertex separators. [Citation Graph (0, 0)][DBLP ] Conf ] Amit Agarwal , Moses Charikar , Konstantin Makarychev , Yury Makarychev O(sqrt(log n)) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems. [Citation Graph (0, 0)][DBLP ] Conf ] Joseph Naor , Roy Schwartz Balanced metric labeling. [Citation Graph (0, 0)][DBLP ] Conf ] Zeev Dvir , Amir Shpilka Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits. [Citation Graph (0, 0)][DBLP ] Conf ] Venkatesan Guruswami , Atri Rudra Limits to list decoding Reed-Solomon codes. [Citation Graph (0, 0)][DBLP ] Conf ] Shahar Dobzinski , Noam Nisan , Michael Schapira Approximation algorithms for combinatorial auctions with complement-free bidders. [Citation Graph (0, 0)][DBLP ] Conf ] Gagan Aggarwal , Amos Fiat , Andrew V. Goldberg , Jason D. Hartline , Nicole Immorlica , Madhu Sudan Derandomization of auctions. [Citation Graph (0, 0)][DBLP ] Conf ] Vladimir Trifonov An O(log n log log n) space algorithm for undirected st-connectivity. [Citation Graph (0, 0)][DBLP ] Conf ] Scott Aaronson The complexity of agreement. [Citation Graph (0, 0)][DBLP ] Conf ] Yael Tauman Kalai , Yehuda Lindell , Manoj Prabhakaran Concurrent general composition of secure protocols in the timing model. [Citation Graph (0, 0)][DBLP ] Conf ] Yevgeniy Dodis , Adam Smith Correcting errors without leaking partial information. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Holenstein Key agreement from weak bit agreement. [Citation Graph (0, 0)][DBLP ] Conf ] Ferdinando Cicalese , Eduardo Sany Laber A new strategy for querying priced information. [Citation Graph (0, 0)][DBLP ] Conf ] Nir Ailon , Moses Charikar , Alantha Newman Aggregating inconsistent information: ranking and clustering. [Citation Graph (0, 0)][DBLP ] Conf ] Dimitris Achlioptas , Aaron Clauset , David Kempe , Cristopher Moore On the bias of traceroute sampling: or, power-law degree distributions in regular graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Scheideler How to spread adversarial nodes?: rotate! [Citation Graph (0, 0)][DBLP ] Conf ] Eli Gafni , Rachid Guerraoui , Bastian Pochon From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement. [Citation Graph (0, 0)][DBLP ] Conf ] Prasad Jayanti An optimal multi-writer snapshot algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Bogdan S. Chlebus , Dariusz R. Kowalski Cooperative asynchronous update of shared memory. [Citation Graph (0, 0)][DBLP ] Conf ] Johan Håstad Every 2-CSP allows nontrivial approximation. [Citation Graph (0, 0)][DBLP ] Conf ] Wenceslas Fernandez de la Vega , Marek Karpinski , Ravi Kannan , Santosh Vempala Tensor decomposition and approximation schemes for constraint satisfaction problems. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Jansen , Rob van Stee On strip packing With rotations. [Citation Graph (0, 0)][DBLP ] Conf ] 