Table of Contents

• Tight bounds for parallel randomized load balancing: extended abstractChristoph Lenzen, Roger Wattenhofer. 11-20 [doi]
• Social networks spread rumors in sublogarithmic timeBenjamin Doerr, Mahmoud Fouz, Tobias Friedrich. 21-30 [doi]
• Quantum one-way communication can be exponentially stronger than classical communicationOded Regev, Bo az Klartag. 31-40 [doi]
• Strong direct product theorems for quantum communication and query complexityAlexander A. Sherstov. 41-50 [doi]
• An optimal lower bound on the communication complexity of gap-hamming-distanceAmit Chakrabarti, Oded Regev. 51-60 [doi]
• Cover times, blanket times, and majorizing measuresJian Ding, James R. Lee, Yuval Peres. 61-70 [doi]
• A general framework for graph sparsificationWai Shing Fung, Ramesh Hariharan, Nicholas J. A. Harvey, Debmalya Panigrahi. 71-80 [doi]
• Breaking o(n:::1/2:::)-approximation algorithms for the edge-disjoint paths problem with congestion twoKen-ichi Kawarabayashi, Yusuke Kobayashi. 81-88 [doi]
• The equivalence of the random oracle model and the ideal cipher model, revisitedThomas Holenstein, Robin Künzler, Stefano Tessaro. 89-98 [doi]
• Separating succinct non-interactive arguments from all falsifiable assumptionsCraig Gentry, Daniel Wichs. 99-108 [doi]
• On optimal single-item auctionsChristos H. Papadimitriou, George Pierrakos. 119-128 [doi]
• Optimal auctions with correlated bidders are easyShahar Dobzinski, Hu Fu, Robert D. Kleinberg. 129-138 [doi]
• From convex optimization to randomized mechanisms: toward optimal combinatorial auctionsShaddin Dughmi, Tim Roughgarden, Qiqi Yan. 149-158 [doi]
• Towards coding for maximum errors in interactive communicationMark Braverman, Anup Rao. 159-166 [doi]
• High-rate codes with sublinear-time decodingSwastik Kopparty, Shubhangi Saraf, Sergey Yekhanin. 167-176 [doi]
• From affine to two-source extractors via approximate dualityNoga Zewi, Eli Ben-Sasson. 177-186 [doi]
• Correlation testing for affine invariant properties on F::p:::::n::: in the high error regimeHamed Hatami, Shachar Lovett. 187-194 [doi]
• Rank-1 bimatrix games: a homeomorphism and a polynomial time algorithmBharat Adsul, Jugal Garg, Ruta Mehta, Milind A. Sohoni. 195-204 [doi]
• Exact algorithms for solving stochastic games: extended abstractKristoffer Arnsfelt Hansen, Michal Koucký, Niels Lauritzen, Peter Bro Miltersen, Elias P. Tsigaridas. 205-214 [doi]
• Dueling algorithmsNicole Immorlica, Adam Tauman Kalai, Brendan Lucier, Ankur Moitra, Andrew Postlewaite, Moshe Tennenholtz. 215-224 [doi]
• Pareto optimal solutions for smoothed analystsAnkur Moitra, Ryan O Donnell. 225-234 [doi]
• Moser and tardos meet LovászKashyap Babu Rao Kolipaka, Mario Szegedy. 235-244 [doi]
• Pseudorandom generators for combinatorial shapesParikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman. 253-262 [doi]
• Pseudorandom generators for group products: extended abstractMichal Koucký, Prajakta Nimbhorkar, Pavel Pudlák. 263-272 [doi]
• Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphsPaul Christiano, Jonathan A. Kelner, Aleksander Madry, Daniel A. Spielman, Shang-Hua Teng. 273-282 [doi]
• Subexponential lower bounds for randomized pivoting rules for the simplex algorithmOliver Friedmann, Thomas Dueholm Hansen, Uri Zwick. 283-292 [doi]
• Improved algorithms for min cut and max flow in undirected planar graphsGiuseppe F. Italiano, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen. 313-322 [doi]
• Directed spanners via flow-based linear programsMichael Dinitz, Robert Krauthgamer. 323-332 [doi]
• The computational complexity of linear opticsScott Aaronson, Alex Arkhipov. 333-342 [doi]
• A quasipolynomial-time algorithm for the quantum separability problemFernando G. S. L. Brandão, Matthias Christandl, Jon Yard. 343-352 [doi]
• Parallel repetition of entangled gamesJulia Kempe, Thomas Vidick. 353-362 [doi]
• Distributed verification and hardness of distributed approximationAtish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, Roger Wattenhofer. 363-372 [doi]
• Linearizable implementations do not suffice for randomized distributed computationWojciech M. Golab, Lisa Higham, Philipp Woelfel. 373-382 [doi]
• The topology of wireless communicationErez Kantor, Zvi Lotker, Merav Parter, David Peleg. 383-392 [doi]
• Optimal path search in small worlds: dimension mattersGeorge Giakkoupis, Nicolas Schabanel. 393-402 [doi]
• An LLL-reduction algorithm with quasi-linear time complexity: extended abstractAndrew Novocin, Damien Stehlé, Gilles Villard. 403-412 [doi]
• NP-hardness of approximately solving linear equations over realsSubhash Khot, Dana Moshkovitz. 413-420 [doi]
• Black-box identity testing of depth-4 multilinear circuitsShubhangi Saraf, Ilya Volkovich. 421-430 [doi]
• Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn t matterNitin Saxena, C. Seshadhri. 431-440 [doi]
• Contraction decomposition in h-minor-free graphs and algorithmic applicationsErik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi. 441-450 [doi]
• A simpler algorithm and shorter proof for the graph minor decompositionKen-ichi Kawarabayashi, Paul Wollan. 451-458 [doi]
• Multicut is FPTNicolas Bousquet, Jean Daligault, Stéphan Thomassé. 459-468 [doi]
• Fixed-parameter tractability of multicut parameterized by the size of the cutsetDániel Marx, Igor Razgon. 469-478 [doi]
• Finding topological subgraphs is fixed-parameter tractableMartin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, Paul Wollan. 479-488 [doi]
• On the complexity of powering in finite fieldsSwastik Kopparty. 489-498 [doi]
• Almost settling the hardness of noncommutative determinantSteve Chien, Prahladh Harsha, Alistair Sinclair, Srikanth Srinivasan. 499-508 [doi]
• Geometric complexity theory and tensor rankPeter Bürgisser, Christian Ikenmeyer. 509-518 [doi]
• Rank bounds for design matrices with applications toc ombinatorial geometry and locally correctable codesBoaz Barak, Zeev Dvir, Amir Yehudayoff, Avi Wigderson. 519-528 [doi]
• Mechanisms for (mis)allocating scientific creditJon M. Kleinberg, Sigal Oren. 529-538 [doi]
• Inner product spaces for MinSum coordination mechanismsRichard Cole, José R. Correa, Vasilis Gkatzelis, Vahab S. Mirrokni, Neil Olver. 539-548 [doi]
• Mechanism design with uncertain inputs: (to err is human, to forgive divine)Uriel Feige, Moshe Tennenholtz. 549-558 [doi]
• Don t rush into a union: take time to find your rootsMihai Patrascu, Mikkel Thorup. 559-568 [doi]
• A unified framework for approximating and clustering dataDan Feldman, Michael Langberg. 569-578 [doi]
• Approximate polytope membership queriesSunil Arya, Guilherme Dias da Fonseca, David M. Mount. 579-586 [doi]
• Online bipartite matching with unknown distributionsChinmay Karande, Aranyak Mehta, Pushkar Tripathi. 587-596 [doi]
• Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPsMohammad Mahdian, Qiqi Yan. 597-606 [doi]
• Almost tight bounds for reordering buffer managementAnna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke. 607-616 [doi]
• Santa Claus schedules jobs on unrelated machinesOla Svensson. 617-626 [doi]
• K-median clustering, model-based compressive sensing, and sparse recovery for earth mover distancePiotr Indyk, Eric Price. 627-636 [doi]
• Breaking the k:::2::: barrier for explicit RIP matricesJean Bourgain, Stephen J. Dilworth, Kevin Ford, Sergei Konyagin, Denka Kutzarova. 637-644 [doi]
• Deterministic construction of a high dimensional l::p:: section in l::1:::::n::: for any ::::p::::<2Zohar Shay Karnin. 645-654 [doi]
• Schaefer s theorem for graphsManuel Bodirsky, Michael Pinsker. 655-664 [doi]
• Optimal constant-time approximation algorithms and (unconditional) inapproximability results for every bounded-degree CSPYuichi Yoshida. 665-674 [doi]
• Every property of hyperfinite graphs is testableIlan Newman, Christian Sohler. 675-684 [doi]
• Estimating the unseen: an n/log(n)-sample estimator for entropy and support size, shown optimal via new CLTsGregory Valiant, Paul Valiant. 685-694 [doi]
• Constant round non-malleable protocols using one way functionsVipul Goyal. 695-704 [doi]
• Constant-round non-malleable commitments from any one-way functionHuijia Lin, Rafael Pass. 705-714 [doi]
• Secure computation with information leaking to an adversaryMiklós Ajtai. 715-724 [doi]
• How to leak on key updatesAllison B. Lewko, Mark Lewko, Brent Waters. 725-734 [doi]
• Near-optimal private approximation protocols via a black box transformationDavid P. Woodruff. 735-744 [doi]
• Fast moment estimation in data streams in optimal spaceDaniel M. Kane, Jelani Nelson, Ely Porat, David P. Woodruff. 745-754 [doi]
• Subspace embeddings for the L::1::-norm with applicationsChristian Sohler, David P. Woodruff. 755-764 [doi]
• Near-optimal distortion bounds for embedding doubling spaces into L::1::James R. Lee, Anastasios Sidiropoulos. 765-772 [doi]
• From low-distortion norm embeddings to explicit uncertainty relations and efficient information lockingOmar Fawzi, Patrick Hayden, Pranab Sen. 773-782 [doi]
• Submodular function maximization via the multilinear relaxation and contention resolution schemesJan Vondrák, Chandra Chekuri, Rico Zenklusen. 783-792 [doi]
• Learning submodular functionsMaria-Florina Balcan, Nicholas J. A. Harvey. 793-802 [doi]
• Privately releasing conjunctions and the statistical query barrierAnupam Gupta, Moritz Hardt, Aaron Roth, Jonathan Ullman. 803-812 [doi]