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