Table of Contents

• Statistically-hiding commitment from any one-way functionIftach Haitner, Omer Reingold. 1-10 [doi]
• On achieving the best of both worlds in secure multiparty computationJonathan Katz. 11-20 [doi]
• Zero-knowledge from secure multiparty computationYuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai. 21-30 [doi]
• Voronoi diagrams in n·2:::osqrt(lg lg n)::: timeTimothy M. Chan, Mihai Patrascu. 31-39 [doi]
• Lower bounds for 2-dimensional range countingMihai Patrascu. 40-46 [doi]
• Combinatorial complexity in O-minimal geometrySaugata Basu. 47-56 [doi]
• Faster integer multiplicationMartin Fürer. 57-66 [doi]
• Fourier meets möbius: fast subset convolutionAndreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto. 67-74 [doi]
• Smooth sensitivity and sampling in private data analysisKobbi Nissim, Sofya Raskhodnikova, Adam Smith. 75-84 [doi]
• The price of privacy and the limits of LP decodingCynthia Dwork, Frank McSherry, Kunal Talwar. 85-94 [doi]
• How to rank with few errorsClaire Kenyon-Mathieu, Warren Schudy. 95-103 [doi]
• Approximation algorithms for budgeted learning problemsSudipto Guha, Kamesh Munagala. 104-113 [doi]
• An approximation algorithm for max-min fair allocation of indivisible goodsArash Asadpour, Amin Saberi. 114-121 [doi]
• Simple deterministic approximation algorithms for counting matchingsMohsen Bayati, David Gamarnik, Dimitriy A. Katz, Chandra Nair, Prasad Tetali. 122-127 [doi]
• On the submodularity of influence in social networksElchanan Mossel, Sébastien Roch. 128-134 [doi]
• First to market is not everything: an analysis of preferential attachment with fitnessChristian Borgs, Jennifer T. Chayes, Constantinos Daskalakis, Sébastien Roch. 135-144 [doi]
• Stability of the max-weight routing and scheduling protocol in dynamic networks and at critical loadsMatthew Andrews, Kyomin Jung, Alexander L. Stolyar. 145-154 [doi]
• Tight bounds for asynchronous randomized consensusHagit Attiya, Keren Censor. 155-164 [doi]
• Hardness of routing with congestion in directed graphsJulia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar. 165-178 [doi]
• Polynomial flow-cut gaps and hardness of directed cut problemsJulia Chuzhoy, Sanjeev Khanna. 179-188 [doi]
• Balanced max 2-sat might not be the hardestPer Austrin. 189-197 [doi]
• A 3-query PCP over integersVenkatesan Guruswami, Prasad Raghavendra. 198-206 [doi]
• Iteratively constructing preconditioners via the conjugate gradient methodJohn Dunagan, Nicholas J. A. Harvey. 207-216 [doi]
• On the convergence of Newton s method for monotone systems of polynomial equationsStefan Kiefer, Michael Luttenberger, Javier Esparza. 217-226 [doi]
• A combinatorial, primal-dual approach to semidefinite programsSanjeev Arora, Satyen Kale. 227-236 [doi]
• One sketch for all: fast algorithms for compressed sensingAnna C. Gilbert, Martin J. Strauss, Joel A. Tropp, Roman Vershynin. 237-246 [doi]
• Distributed computing theory: algorithms, impossibility results, models, and proofsNancy A. Lynch. 247 [doi]
• The condition number of a randomly perturbed matrixVan H. Vu, Terence Tao. 248-255 [doi]
• Balanced allocations: the weighted caseKunal Talwar, Udi Wieder. 256-265 [doi]
• Towards 3-query locally decodable codes of subexponential lengthSergey Yekhanin. 266-274 [doi]
• Circuit lower bounds for Merlin-Arthur classesRahul Santhanam. 275-283 [doi]
• Interpolation of depth-3 arithmetic circuits with two multiplication gatesAmir Shpilka. 284-293 [doi]
• Separating AC:::0::: from depth-2 majority circuitsAlexander A. Sherstov. 294-301 [doi]
• Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cutGrant Schoenebeck, Luca Trevisan, Madhur Tulsiani. 302-310 [doi]
• Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systemsStefan S. Dantchev. 311-317 [doi]
• Linear probing with constant independenceAnna Pagh, Rasmus Pagh, Milan Ruzic. 318-327 [doi]
• Optimal suffix selectionGianni Franceschini, S. Muthukrishnan. 328-337 [doi]
• Limitations of VCG-based mechanismsShahar Dobzinski, Noam Nisan. 338-344 [doi]
• The communication complexity of uncoupled nash equilibrium proceduresSergiu Hart, Yishay Mansour. 345-353 [doi]
• Proportional response dynamics leads to market equilibriumFang Wu, Li Zhang. 354-363 [doi]
• Eisenberg-Gale markets: algorithms and structural propertiesKamal Jain, Vijay V. Vazirani. 364-373 [doi]
• Interval completion with few edgesPinar Heggernes, Christophe Paul, Jan Arne Telle, Yngve Villanger. 374-381 [doi]
• Computing crossing number in linear timeKen-ichi Kawarabayashi, Bruce A. Reed. 382-390 [doi]
• Terminal backup, 3D matching, and covering cubic graphsElliot Anshelevich, Adriana Karagiozova. 391-400 [doi]
• Holographic algorithms: from art to scienceJin-yi Cai, Pinyan Lu. 401-410 [doi]
• Parallel repetition: simplifications and the no-signaling caseThomas Holenstein. 411-419 [doi]
• An efficient parallel repetition theorem for Arthur-Merlin gamesRafael Pass, Muthuramakrishnan Venkitasubramaniam. 420-429 [doi]
• Low-end uniform hardness vs. randomness tradeoffs for AMRonen Shaltiel, Christopher Umans. 430-439 [doi]
• Verifying and decoding in constant depthShafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum. 440-449 [doi]
• Randomly coloring planar graphs with fewer colors than the maximum degreeThomas P. Hayes, Juan Carlos Vera, Eric Vigoda. 450-458 [doi]
• Inapproximability of the Tutte polynomialLeslie Ann Goldberg, Mark Jerrum. 459-468 [doi]
• Tensor-based hardness of the shortest vector problem to within almost polynomial factorsIshay Haviv, Oded Regev. 469-477 [doi]
• Lattices that admit logarithmic worst-case to average-case connection factorsChris Peikert, Alon Rosen. 478-487 [doi]
• Property testing in hypergraphs and the removal lemmaVojtech Rödl, Mathias Schacht. 488-495 [doi]
• Testing k-wise and almost k-wise independenceNoga Alon, Alexandr Andoni, Tali Kaufman, Kevin Matulef, Ronitt Rubinfeld, Ning Xie. 496-505 [doi]
• Low-degree tests at large distancesAlex Samorodnitsky. 506-515 [doi]
• Exponential separations for one-way quantum communication complexity, with applications to cryptographyDmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald de Wolf. 516-525 [doi]
• Negative weights make adversaries strongerPeter Høyer, Troy Lee, Robert Spalek. 526-535 [doi]
• On the impossibility of a quantum sieve algorithm for graph isomorphismCristopher Moore, Alexander Russell, Piotr Sniady. 536-545 [doi]
• Playing games with approximation algorithmsSham M. Kakade, Adam Tauman Kalai, Katrina Ligett. 546-555 [doi]
• Reordering buffers for general metric spacesMatthias Englert, Harald Räcke, Matthias Westermann. 556-564 [doi]
• Toward a general theory of quantum gamesGus Gutoski, John Watrous. 565-574 [doi]
• Search via quantum walkFrédéric Magniez, Ashwin Nayak, Jeremie Roland, Miklos Santha. 575-584 [doi]
• All-pairs bottleneck paths for general graphs in truly sub-cubic timeVirginia Vassilevska, Ryan Williams, Raphael Yuster. 585-589 [doi]
• More algorithms for all-pairs shortest paths in weighted graphsTimothy M. Chan. 590-598 [doi]
• Some new results on node-capacitated packing of A-pathsGyula Pap. 599-604 [doi]
• An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphsRamesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Anand Bhalgat. 605-614 [doi]
• Uncertainty principles, extractors, and explicit embeddings of l2 into l1Piotr Indyk. 615-620 [doi]
• Vertex cuts, random walks, and dimension reduction in series-parallel graphsBo Brinkman, Adriana Karagiozova, James R. Lee. 621-630 [doi]
• Local embeddings of metric spacesIttai Abraham, Yair Bartal, Ofer Neiman. 631-640 [doi]
• Sampling-based dimension reduction for subspace approximationAmit Deshpande, Kasturi R. Varadarajan. 641-650 [doi]
• Survivable network design with degree or order constraintsLap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh. 651-660 [doi]
• Approximating minimum bounded degree spanning trees to within one of optimalMohit Singh, Lap Chi Lau. 661-670 [doi]
• Improved approximation for directed cut problemsAmit Agarwal, Noga Alon, Moses Charikar. 671-680 [doi]
• Degree-constrained network flowsP. Donovan, F. Bruce Shepherd, Adrian Vetta, Gordon T. Wilfong. 681-688 [doi]
• Lower bounds for randomized read/write stream algorithmsPaul Beame, T. S. Jayram, Atri Rudra. 689-698 [doi]
• Lower bounds in communication complexity based on factorization normsNati Linial, Adi Shraibman. 699-708 [doi]
• Constructing non-computable Julia setsMark Braverman, Michael Yampolsky. 709-716 [doi]