Table of Contents

• Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractorsBoaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson. 1-10 [doi]
• Extractors with weak random seedsRan Raz. 11-20 [doi]
• Pseudorandom generators for low degree polynomialsAndrej Bogdanov. 21-30 [doi]
• On uniform amplification of hardness in NPLuca Trevisan. 31-38 [doi]
• Approximation techniques for utilitarian mechanism designPatrick Briest, Piotr Krysta, Berthold Vöcking. 39-48 [doi]
• Computing correlated equilibria in multi-player gamesChristos H. Papadimitriou. 49-56 [doi]
• Large the price of routing unsplittable flowBaruch Awerbuch, Yossi Azar, Amir Epstein. 57-66 [doi]
• The price of anarchy of finite congestion gamesGeorge Christodoulou, Elias Koutsoupias. 67-73 [doi]
• Market equilibrium via the excess demand functionBruno Codenotti, Benton McCune, Kasturi R. Varadarajan. 74-83 [doi]
• On lattices, learning with errors, random linear codes, and cryptographyOded Regev. 84-93 [doi]
• Representing hard lattices with O(n log n) bitsMiklós Ajtai. 94-103 [doi]
• On dynamic range reporting in one dimensionChristian Worm Mortensen, Rasmus Pagh, Mihai Patrascu. 104-111 [doi]
• Worst-case update times for fully-dynamic all-pairs shortest pathsMikkel Thorup. 112-119 [doi]
• Beyond NP: the work and legacy of Larry StockmeyerLance Fortnow. 120-127 [doi]
• Every monotone graph property is testableNoga Alon, Asaf Shapira. 128-137 [doi]
• Testing versus estimation of graph propertiesEldar Fischer, Ilan Newman. 138-146 [doi]
• Testing monotone high-dimensional distributionsRonitt Rubinfeld, Rocco A. Servedio. 147-156 [doi]
• Efficient testing of groupsKatalin Friedl, Gábor Ivanyos, Miklos Santha. 157-166 [doi]
• Approximation algorithms for network design with metric costsJoseph Cheriyan, Adrian Vetta. 167-175 [doi]
• On non-uniform multicommodity buy-at-bulk network designMoses Charikar, Adriana Karagiozova. 176-182 [doi]
• Multicommodity flow, well-linked terminals, and routing problemsChandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd. 183-192 [doi]
• Oblivious routing in directed graphs with random demandsMohammad Taghi Hajiaghayi, Jeong Han Kim, Tom Leighton, Harald Räcke. 193-201 [doi]
• Optimal approximations of the frequency moments of data streamsPiotr Indyk, David P. Woodruff. 202-208 [doi]
• Coresets in dynamic geometric data streamsGereon Frahling, Christian Sohler. 209-217 [doi]
• Low distortion embeddings for edit distanceRafail Ostrovsky, Yuval Rabani. 218-224 [doi]
• Low-distortion embeddings of general metrics into the lineMihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos. 225-233 [doi]
• Tree-walking automata do not recognize all regular languagesMikolaj Bojanczyk, Thomas Colcombet. 234-243 [doi]
• Balanced boolean functions that can be evaluated so that every input bit is unlikely to be readItai Benjamini, Oded Schramm, David Bruce Wilson. 244-250 [doi]
• Lower bounds for k-DNF resolution on random 3-CNFsMichael Alekhnovich. 251-256 [doi]
• Bounded-depth circuits: separating wires from gatesMichal Koucký, Pavel Pudlák, Denis Thérien. 257-265 [doi]
• Simple PCPs with poly-log rate and query complexityEli Ben-Sasson, Madhu Sudan. 266-275 [doi]
• Hardness of the undirected edge-disjoint paths problemMatthew Andrews, Lisa Zhang. 276-283 [doi]
• Hardness of the undirected congestion minimization problemMatthew Andrews, Lisa Zhang. 284-293 [doi]
• Towards strong nonapproximability results in the Lovasz-Schrijver hierarchyMichael Alekhnovich, Sanjeev Arora, Iannis Tourlakis. 294-303 [doi]
• Computing the first Betti number and the connected components of semi-algebraic setsSaugata Basu, Richard Pollack, Marie-Françoise Roy. 304-312 [doi]
• Polynomial time algorithm for computing the top Betti numbers of semi-algebraic sets defined by quadratic inequalitiesSaugata Basu. 313-322 [doi]
• On algorithms for discrete and approximate brouwer fixed pointsXi Chen, Xiaotie Deng. 323-330 [doi]
• Convex programming for scheduling unrelated parallel machinesYossi Azar, Amir Epstein. 331-337 [doi]
• The round complexity of two-party random selectionSaurabh Sanghvi, Salil P. Vadhan. 338-347 [doi]
• Hierarchies for semantic classesLance Fortnow, Rahul Santhanam, Luca Trevisan. 348-355 [doi]
• Learning with attribute costsHaim Kaplan, Eyal Kushilevitz, Yishay Mansour. 356-365 [doi]
• Learning nonsingular phylogenies and hidden Markov modelsElchanan Mossel, Sébastien Roch. 366-375 [doi]
• Undirected ST-connectivity in log-spaceOmer Reingold. 376-385 [doi]
• Universal approximations for TSP, Steiner tree, and set coverLujun Jia, Guolong Lin, Guevara Noubir, Rajmohan Rajaraman, Ravi Sundaram. 386-395 [doi]
• Saving an epsilon: a 2-approximation for the k-MST problem in graphsNaveen Garg. 396-402 [doi]
• The mixing time of the Thorp shuffleBen Morris. 403-412 [doi]
• Approximately counting integral flows and cell-bounded contingency tablesMary Cryan, Martin E. Dyer, Dana Randall. 413-422 [doi]
• Spectral norm of random matricesVan H. Vu. 423-430 [doi]
• On random pm 1 matrices: singularity and determinantTerence Tao, Van H. Vu. 431-440 [doi]
• On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problemAbraham Flaxman, Alan M. Frieze, Juan Carlos Vera. 441-449 [doi]
• Towards asymptotic optimality in probabilistic packet markingMicah Adler, Jeff Edmonds, Jirí Matousek. 450-459 [doi]
• Tensor norms and the classical communication complexity of nonlocal quantum measurementYaoyun Shi. 460-467 [doi]
• Fast quantum algorithms for computing the unit group and class group of a number fieldSean Hallgren. 468-474 [doi]
• Polynomial time quantum algorithm for the computation of the unit group of a number fieldArthur Schmidt, Ulrich Vollmer. 475-480 [doi]
• Fast quantum byzantine agreementMichael Ben-Or, Avinatan Hassidim. 481-485 [doi]
• Quadratic forms on graphsNoga Alon, Konstantin Makarychev, Yury Makarychev, Assaf Naor. 486-493 [doi]
• Lower-stretch spanning treesMichael Elkin, Yuval Emek, Daniel A. Spielman, Shang-Hua Teng. 494-503 [doi]
• Edge partition of planar sraphs into two outerplanar graphsDaniel Gonçalves. 504-512 [doi]
• Covert two-party computationLuis von Ahn, Nicholas J. Hopper, John Langford. 513-522 [doi]
• On obfuscating point functionsHoeteck Wee. 523-532 [doi]
• New and improved constructions of non-malleable cryptographic protocolsRafael Pass, Alon Rosen. 533-542 [doi]
• Collusion-free protocolsMatt Lepinski, Silvio Micali, Abhi Shelat. 543-552 [doi]
• Euclidean distortion and the sparsest cutSanjeev Arora, James R. Lee, Assaf Naor. 553-562 [doi]
• Improved approximation algorithms for minimum-weight vertex separatorsUriel Feige, Mohammad Taghi Hajiaghayi, James R. Lee. 563-572 [doi]
• O(sqrt(log n)) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problemsAmit Agarwal, Moses Charikar, Konstantin Makarychev, Yury Makarychev. 573-581 [doi]
• Balanced metric labelingJoseph Naor, Roy Schwartz. 582-591 [doi]
• Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuitsZeev Dvir, Amir Shpilka. 592-601 [doi]
• Limits to list decoding Reed-Solomon codesVenkatesan Guruswami, Atri Rudra. 602-609 [doi]
• Approximation algorithms for combinatorial auctions with complement-free biddersShahar Dobzinski, Noam Nisan, Michael Schapira. 610-618 [doi]
• Derandomization of auctionsGagan Aggarwal, Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, Nicole Immorlica, Madhu Sudan. 619-625 [doi]
• An O(log n log log n) space algorithm for undirected st-connectivityVladimir Trifonov. 626-633 [doi]
• The complexity of agreementScott Aaronson. 634-643 [doi]
• Concurrent general composition of secure protocols in the timing modelYael Tauman Kalai, Yehuda Lindell, Manoj Prabhakaran. 644-653 [doi]
• Correcting errors without leaking partial informationYevgeniy Dodis, Adam Smith. 654-663 [doi]
• Key agreement from weak bit agreementThomas Holenstein. 664-673 [doi]
• A new strategy for querying priced informationFerdinando Cicalese, Eduardo Sany Laber. 674-683 [doi]
• Aggregating inconsistent information: ranking and clusteringNir Ailon, Moses Charikar, Alantha Newman. 684-693 [doi]
• On the bias of traceroute sampling: or, power-law degree distributions in regular graphsDimitris Achlioptas, Aaron Clauset, David Kempe, Cristopher Moore. 694-703 [doi]
• How to spread adversarial nodes?: rotate!Christian Scheideler. 704-713 [doi]
• From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreementEli Gafni, Rachid Guerraoui, Bastian Pochon. 714-722 [doi]
• An optimal multi-writer snapshot algorithmPrasad Jayanti. 723-732 [doi]
• Cooperative asynchronous update of shared memoryBogdan S. Chlebus, Dariusz R. Kowalski. 733-739 [doi]
• Every 2-CSP allows nontrivial approximationJohan Håstad. 740-746 [doi]
• Tensor decomposition and approximation schemes for constraint satisfaction problemsWenceslas Fernandez de la Vega, Marek Karpinski, Ravi Kannan, Santosh Vempala. 747-754 [doi]
• On strip packing With rotationsKlaus Jansen, Rob van Stee. 755-761 [doi]