Conferences in DBLP
Venkatesan Guruswami , Atri Rudra Explicit capacity-achieving list-decodable codes. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:1-10 [Conf ] Alex Samorodnitsky , Luca Trevisan Gowers uniformity, influence of variables, and PCPs. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:11-20 [Conf ] Dana Moshkovitz , Ran Raz Sub-constant error low degree test of almost-linear size. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:21-30 [Conf ] Nikhil Bansal , Maxim Sviridenko The Santa Claus problem. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:31-40 [Conf ] Uriel Feige On maximizing welfare when utility functions are subadditive. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:41-50 [Conf ] Jonathan A. Kelner , Daniel A. Spielman A randomized polynomial-time simplex algorithm for linear programming. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:51-60 [Conf ] Paul W. Goldberg , Christos H. Papadimitriou Reducibility among equilibrium problems. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:61-70 [Conf ] Constantinos Daskalakis , Paul W. Goldberg , Christos H. Papadimitriou The complexity of computing a Nash equilibrium. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:71-78 [Conf ] Tim Roughgarden , Mukund Sundararajan New trade-offs in cost-sharing mechanisms. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:79-88 [Conf ] Ara Hayrapetyan , Éva Tardos , Tom Wexler The effect of collusion in congestion games. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:89-98 [Conf ] Yuval Ishai , Eyal Kushilevitz , Yehuda Lindell , Erez Petrank Black-box constructions for secure computation. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:99-108 [Conf ] Eyal Kushilevitz , Yehuda Lindell , Tal Rabin Information-theoretically secure protocols and security under composition. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:109-118 [Conf ] Amos Beimel , Paz Carmi , Kobbi Nissim , Enav Weinreb Private approximation of search problems. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:119-128 [Conf ] Prabhakar Raghavan The changing face of web search: algorithms, auctions and advertising. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:129- [Conf ] Dimitris Achlioptas , Federico Ricci-Tersenghi On the solution-space geometry of random constraint satisfaction problems. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:130-139 [Conf ] Dror Weitz Counting independent sets up to the tree threshold. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:140-149 [Conf ] Mario Szegedy The DLT priority sampling is essentially optimal. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:150-158 [Conf ] Constantinos Daskalakis , Elchanan Mossel , Sébastien Roch Optimal phylogenetic reconstruction. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:159-168 [Conf ] Panagiota Fatourou , Faith Ellen Fich , Eric Ruppert Time-space tradeoffs for implementations of snapshots. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:169-178 [Conf ] Michael Ben-Or , Elan Pavlov , Vinod Vaikuntanathan Byzantine agreement in the full-information model in O(log n) rounds. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:179-186 [Conf ] Spyridon Antonakopoulos Fast leader-election protocols with bounded cheaters' edge. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:187-196 [Conf ] Sung-woo Cho , Ashish Goel Pricing for fairness: distributed resource allocation for multiple objectives. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:197-204 [Conf ] Moses Charikar , Konstantin Makarychev , Yury Makarychev Near-optimal algorithms for unique games. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:205-214 [Conf ] Sanjeev Arora , Eden Chlamtac New approximation guarantee for chromatic number. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:215-224 [Conf ] Virginia Vassilevska , Ryan Williams Finding a maximum weight triangle in n^{3-Delta} time, with applications. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:225-231 [Conf ] Mihai Patrascu , Mikkel Thorup Time-space trade-offs for predecessor search. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:232-240 [Conf ] Irit Dinur The PCP theorem by gap amplification. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:241-250 [Conf ] Noga Alon , Eldar Fischer , Ilan Newman , Asaf Shapira A combinatorial characterization of the testable graph properties: it's all about regularity. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:251-260 [Conf ] Christian Borgs , Jennifer T. Chayes , László Lovász , Vera T. Sós , Balázs Szegedy , Katalin Vesztergombi Graph limits and parameter testing. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:261-270 [Conf ] Ittai Abraham , Yair Bartal , Ofer Neiman Advances in metric embedding theory. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:271-286 [Conf ] Minh-Huyen Nguyen , Salil P. Vadhan Zero knowledge with efficient provers. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:287-295 [Conf ] John Watrous Zero-knowledge against quantum attacks. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:296-305 [Conf ] Silvio Micali , Rafael Pass Local zero knowledge. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:306-315 [Conf ] Jan Remy , Angelika Steger A quasi-polynomial time approximation scheme for minimum weight triangulation. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:316-325 [Conf ] Kenneth L. Clarkson Building triangulations using epsilon-nets. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:326-335 [Conf ] Tetsuo Asano , Jirí Matousek , Takeshi Tokuyama The distance trisector curve. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:336-343 [Conf ] Irit Dinur , Elchanan Mossel , Oded Regev Conditional hardness for approximate coloring. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:344-353 [Conf ] Michael R. Fellows , Frances A. Rosamond , Udi Rotics , Stefan Szeider Clique-width minimization is NP-hard. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:354-362 [Conf ] Vitaly Feldman Hardness of approximate two-level logic minimization and PAC learning with membership queries. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:363-372 [Conf ] Russell Impagliazzo Can every randomized algorithm be derandomized? [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:373-374 [Conf ] Uriel Feige , Mohammad Mahdian Finding small balanced separators. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:375-384 [Conf ] Rohit Khandekar , Satish Rao , Umesh V. Vazirani Graph partitioning using single commodity flows. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:385-390 [Conf ] Jaroslav Nesetril , Patrice Ossona de Mendez Linear time low tree-width partitions and algorithmic consequences. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:391-400 [Conf ] Ken-ichi Kawarabayashi , Bojan Mohar Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:401-416 [Conf ] Leonid Gurvits Hyperbolic polynomials approach to Van der Waerden/Schrijver-Valiant like conjectures: sharper bounds, simpler proofs and algorithmic applications. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:417-426 [Conf ] Dorit Aharonov , Vaughan Jones , Zeph Landau A polynomial quantum algorithm for approximating the Jones polynomial. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:427-436 [Conf ] Irit Dinur , Ehud Friedgut , Guy Kindler , Ryan O'Donnell On the fourier tails of bounded functions over the discrete cube. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:437-446 [Conf ] Oded Regev , Ricky Rosen Lattice problems and norm embeddings. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:447-456 [Conf ] Omer Reingold , Luca Trevisan , Salil P. Vadhan Pseudorandom walks on regular digraphs and the RL vs. L problem. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:457-466 [Conf ] Wojciech Plandowski An efficient algorithm for solving word equations. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:467-476 [Conf ] Peter DeMarzo , Ilan Kremer , Yishay Mansour Online trading algorithms and robust option pricing. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:477-486 [Conf ] Konstantinos Panagiotou , Alexander Souza On adequate performance measures for paging. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:487-496 [Conf ] Anup Rao Extractors for a constant number of polynomially small min-entropy independent sources. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:497-506 [Conf ] Jakob Nordström Narrow proofs may be spacious: separating space and width in resolution. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:507-516 [Conf ] Matthew Andrews , Lisa Zhang Logarithmic hardness of the directed congestion minimization problem. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:517-526 [Conf ] Julia Chuzhoy , Sanjeev Khanna Hardness of cut problems in directed graphs. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:527-536 [Conf ] Nikhil R. Devanur , Subhash Khot , Rishi Saket , Nisheeth K. Vishnoi Integrality gaps for sparsest cut and minimum linear arrangement problems. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:537-546 [Conf ] Howard J. Karloff , Subhash Khot , Aranyak Mehta , Yuval Rabani On earthmover distance, metric labeling, and 0-extension. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:547-556 [Conf ] Nir Ailon , Bernard Chazelle Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:557-563 [Conf ] Sunil Arya , Theocharis Malamatos , David M. Mount On the importance of idempotence. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:564-573 [Conf ] Richard Cole , Lee-Ad Gottlieb Searching dynamic point sets in spaces with bounded doubling dimension. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:574-583 [Conf ] Dana Angluin , James Aspnes , Jiang Chen , Yinghua Wu Learning a circuit by injecting values. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:584-593 [Conf ] Dmitry Gavinsky , Julia Kempe , Oded Regev , Ronald de Wolf Bounded-error quantum state identification and exponential separations in communication complexity. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:594-603 [Conf ] Sean Hallgren , Cristopher Moore , Martin Rötteler , Alexander Russell , Pranab Sen Limitations of quantum coset states for graph isomorphism. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:604-617 [Conf ] Andris Ambainis , Robert Spalek , Ronald de Wolf A new quantum lower bound method, : with applications to direct product theorems and time-space tradeoffs. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:618-633 [Conf ] Shengyu Zhang New upper and lower bounds for randomized and quantum local search. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:634-643 [Conf ] Shahar Dobzinski , Noam Nisan , Michael Schapira Truthful randomized mechanisms for combinatorial auctions. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:644-652 [Conf ] Simon Fischer , Harald Räcke , Berthold Vöcking Fast convergence to Wardrop equilibria by adaptive sampling methods. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:653-662 [Conf ] Lisa Fleischer , Jochen Könemann , Stefano Leonardi , Guido Schäfer Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:663-670 [Conf ] Boaz Barak , Anup Rao , Ronen Shaltiel , Avi Wigderson 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:671-680 [Conf ] David Zuckerman Linear degree extractors and the inapproximability of max clique and chromatic number. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:681-690 [Conf ] Jesse Kamp , Anup Rao , Salil P. Vadhan , David Zuckerman Deterministic extractors for small-space sources. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:691-700 [Conf ] Adi Akavia , Oded Goldreich , Shafi Goldwasser , Dana Moshkovitz On basing one-way functions on NP-hardness. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:701-710 [Conf ] Bella Dubrov , Yuval Ishai On the randomness complexity of efficient sampling. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:711-720 [Conf ] Nikhil Bansal , Amit Chakrabarti , Amir Epstein , Baruch Schieber A quasi-PTAS for unsplittable flow on line graphs. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:721-729 [Conf ] Naveen Garg , Amit Kumar Minimizing average flow time on related machines. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:730-738 [Conf ] Retsef Levi , Robin Roundy , David B. Shmoys Provably near-optimal sampling-based algorithms for Stochastic inventory control models. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:739-748 [Conf ] Philip N. Klein A subset spanner for Planar graphs, : with application to subset TSP. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:749-756 [Conf ] Chandra Chekuri , Sanjeev Khanna , F. Bruce Shepherd Edge-disjoint paths in Planar graphs with constant congestion. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:757-766 [Conf ]