Table of Contents

• Robust pcps of proximity, shorter pcps and applications to codingEli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan. 1-10 [doi]
• A new PCP outer verifier with applications to homogeneous linear equations and max-bisectionJonas Holmerin, Subhash Khot. 11-20 [doi]
• Asymmetric k-center is log:::*::: ::::n::::-hard to approximateJulia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Joseph Naor. 21-27 [doi]
• New hardness results for congestion minimization and machine schedulingJulia Chuzhoy, Joseph Naor. 28-34 [doi]
• On the performance of greedy algorithms in packet bufferingSusanne Albers, Markus Schmidt. 35-44 [doi]
• Adaptive routing with end-to-end feedback: distributed learning and geometric approachesBaruch Awerbuch, Robert D. Kleinberg. 45-53 [doi]
• Know thy neighbor s neighbor: the power of lookahead in randomized P2P networksGurmeet Singh Manku, Moni Naor, Udi Wieder. 54-63 [doi]
• The zero-one principle for switching networksYossi Azar, Yossi Richter. 64-71 [doi]
• Approximating the cut-norm via Grothendieck s inequalityNoga Alon, Assaf Naor. 72-80 [doi]
• Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systemsDaniel A. Spielman, Shang-Hua Teng. 81-90 [doi]
• Dictionary matching and indexing with errors and don t caresRichard Cole, Lee-Ad Gottlieb, Moshe Lewenstein. 91-100 [doi]
• Sorting and searching in the presence of memory faults (without redundancy)Irene Finocchi, Giuseppe F. Italiano. 101-110 [doi]
• Quantum algorithms a decade after shorAndris Ambainis. 111 [doi]
• Graph entropy and quantum sorting problemsAndrew Chi-Chih Yao. 112-117 [doi]
• Multilinear formulas and skepticism of quantum computingScott Aaronson. 118-127 [doi]
• Exponential separation of quantum and classical one-way communication complexityZiv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis. 128-137 [doi]
• Approximation algorithm for k-node connected subgraphs via critical graphsGuy Kortsarz, Zeev Nutov. 138-145 [doi]
• Solving fractional packing problems in ::::O:::::::ast:::(1/?) iterationsDaniel Bienstock, Garud Iyengar. 146-155 [doi]
• The all-or-nothing multicommodity flow problemChandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd. 156-165 [doi]
• Approximation algorithms for deadline-TSP and vehicle routing with time-windowsNikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Meyerson. 166-174 [doi]
• Estimating the weight of metric minimum spanning trees in sublinear-timeArtur Czumaj, Christian Sohler. 175-183 [doi]
• A fully dynamic reachability algorithm for directed graphs with an almost linear update timeLiam Roditty, Uri Zwick. 184-191 [doi]
• Using nondeterminism to amplify hardnessAlexander Healy, Salil P. Vadhan, Emanuele Viola. 192-201 [doi]
• Visibly pushdown languagesRajeev Alur, P. Madhusudan. 202-211 [doi]
• Linear FPT reductions and computational lower boundsJianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia. 212-221 [doi]
• Expander flows, geometric embeddings and graph partitioningSanjeev Arora, Satish Rao, Umesh V. Vazirani. 222-231 [doi]
• Bounded-concurrent secure multi-party computation with a dishonest majorityRafael Pass. 232-241 [doi]
• New notions of security: achieving universal composability without trusted setupManoj Prabhakaran, Amit Sahai. 242-251 [doi]
• Completeness in two-party secure computation: a computational viewDanny Harnik, Moni Naor, Omer Reingold, Alon Rosen. 252-261 [doi]
• Batch codes and their applicationsYuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai. 262-271 [doi]
• Low distortion maps between point setsClaire Kenyon, Yuval Rabani, Alistair Sinclair. 272-280 [doi]
• Bypassing the embedding: algorithms for low dimensional metricsKunal Talwar. 281-290 [doi]
• On coresets for k-means and k-median clusteringSariel Har-Peled, Soham Mazumdar. 291-300 [doi]
• Isotopic implicit surface meshingJean-Daniel Boissonnat, David Cohen-Steiner, Gert Vegter. 301-309 [doi]
• Hit-and-run from a cornerLászló Lovász, Santosh Vempala. 310-314 [doi]
• A simple polynomial-time rescaling algorithm for solving linear programsJohn Dunagan, Santosh Vempala. 315-320 [doi]
• Collective asynchronous reading with polylogarithmic worst-case overheadBogdan S. Chlebus, Dariusz R. Kowalski, Alexander A. Shvartsman. 321-330 [doi]
• Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problemMichael Elkin. 331-340 [doi]
• Network gamesÉva Tardos. 341-342 [doi]
• Typical properties of winners and losers in discrete optimizationRené Beier, Berthold Vöcking. 343-352 [doi]
• Primal-dual algorithms for deterministic inventory problemsRetsef Levi, Robin Roundy, David B. Shmoys. 353-362 [doi]
• Multi-processor scheduling to minimize flow time with epsilon resource augmentationChandra Chekuri, Ashish Goel, Sanjeev Khanna, Amit Kumar. 363-372 [doi]
• Algorithms for dynamic geometric problems over data streamsPiotr Indyk. 373-380 [doi]
• Sublinear algorithms for testing monotone and unimodal distributionsTugkan Batu, Ravi Kumar, Ronitt Rubinfeld. 381-390 [doi]
• The difficulty of testing for isomorphism against a graph that is given in advanceEldar Fischer. 391-397 [doi]
• An approximate König s theorem for edge-coloring weighted bipartite graphsJosé R. Correa, Michel X. Goemans. 398-406 [doi]
• Finding paths and cycles of superpolylogarithmic lengthHarold N. Gabow. 407-416 [doi]
• Boosted sampling: approximation algorithms for stochastic optimizationAnupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha. 417-426 [doi]
• Derandomizing homomorphism testing in general groupsAmir Shpilka, Avi Wigderson. 427-435 [doi]
• Better extractors for better codes?Venkatesan Guruswami. 436-444 [doi]
• A new family of Cayley expanders (?)Eyal Rozenman, Aner Shalev, Avi Wigderson. 445-454 [doi]
• Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genusJonathan A. Kelner. 455-464 [doi]
• Lower bounds for local search by quantum argumentsScott Aaronson. 465-474 [doi]
• Counting complexity classes for numeric computations II: algebraic and semialgebraic setsPeter Bürgisser, Felipe Cucker. 475-485 [doi]
• A conjecture about polynomial time computable lattice-lattice functionsMiklós Ajtai. 486-493 [doi]
• Quantum and classical query complexities of local search are polynomially relatedMiklos Santha, Mario Szegedy. 494-501 [doi]
• The quantum adiabatic optimization algorithm and local minimaBen Reichardt. 502-510 [doi]
• Auction algorithms for market equilibriumRahul Garg, Sanjiv Kapoor. 511-518 [doi]
• The spending constraint model for market equilibrium: algorithmic, existence and uniqueness resultsNikhil R. Devanur. 519-528 [doi]
• (Almost) tight bounds and existence theorems for confluent flowsJiangzhuo Chen, Robert D. Kleinberg, László Lovász, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta. 529-538 [doi]
• Approximate max-integral-flow/min-multicut theoremsKenji Obata. 539-545 [doi]
• Lower bounds for dynamic connectivityMihai Patrascu, Erik D. Demaine. 546-553 [doi]
• Lower bounds for linear degeneracy testingNir Ailon, Bernard Chazelle. 554-560 [doi]
• A decentralized algorithm for spectral analysisDavid Kempe, Frank McSherry. 561-568 [doi]
• Using mixture models for collaborative filteringJon M. Kleinberg, Mark Sandler. 569-578 [doi]
• Depth through breadth, or why should we attend talks in other areas?Avi Wigderson. 579 [doi]
• Sharp thresholds For monotone properties in random geometric graphsAshish Goel, Sanatan Rai, Bhaskar Krishnamachari. 580-586 [doi]
• The two possible values of the chromatic number of a random graphDimitris Achlioptas, Assaf Naor. 587-593 [doi]
• On sums of independent random variables with unbounded variance, and estimating the average degree in a graphUriel Feige. 594-603 [doi]
• The complexity of pure Nash equilibriaAlex Fabrikant, Christos H. Papadimitriou, Kunal Talwar. 604-612 [doi]
• Computing Nash equilibria for scheduling on restricted parallel linksMartin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien. 613-622 [doi]
• Rational secret sharing and multiparty computation: extended abstractJoseph Y. Halpern, Vanessa Teague. 623-632 [doi]
• Multi-linear formulas for permanent and determinant are of super-polynomial sizeRan Raz. 633-641 [doi]