Table of Contents

• Faster approximate multicommodity flow using quadratically coupled flowsJonathan A. Kelner, Gary L. Miller, Richard Peng. 1-18 [doi]
• When the cut condition is enough: a complete characterization for multiflow problems in series-parallel networksAmit Chakrabarti, Lisa Fleischer, Christophe Weibel. 19-26 [doi]
• Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectivesLászló A. Végh. 27-40 [doi]
• Quantum money from hidden subspacesScott Aaronson, Paul Christiano. 41-60 [doi]
• Certifiable quantum dice: or, true random number generation secure against quantum adversariesUmesh V. Vazirani, Thomas Vidick. 61-76 [doi]
• Span programs for functions with constant-sized 1-certificates: extended abstractAleksandrs Belovs. 77-84 [doi]
• The cell probe complexity of dynamic range countingKasper Green Larsen. 85-94 [doi]
• Linear vs. semidefinite extended formulations: exponential separation and strong lower boundsSamuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, Ronald de Wolf. 95-106 [doi]
• Polyhedral clinching auctions and the adwords polytopeGagan Goel, Vahab S. Mirrokni, Renato Paes Leme. 107-122 [doi]
• Matroid prophet inequalitiesRobert Kleinberg, S. Matthew Weinberg. 123-136 [doi]
• Online matching with concave returnsNikhil R. Devanur, Kamal Jain. 137-144 [doi]
• Computing a nonnegative matrix factorization - provablySanjeev Arora, Rong Ge, Ravindran Kannan, Ankur Moitra. 145-162 [doi]
• On identity testing of tensors, low-rank recovery and compressed sensingMichael A. Forbes, Amir Shpilka. 163-172 [doi]
• Structure theorem and isomorphism test for graphs with excluded topological subgraphsMartin Grohe, Dániel Marx. 173-192 [doi]
• Short proofs for the determinant identitiesPavel Hrubes, Iddo Tzameret. 193-212 [doi]
• Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear spacePaul Beame, Christopher Beck, Russell Impagliazzo. 213-232 [doi]
• On the virtue of succinct proofs: amplifying communication complexity hardness to time-space trade-offs in proof complexityTrinh Huynh, Jakob Nordström. 233-248 [doi]
• Determinism versus nondeterminism with arithmetic tests and computation: extended abstractMiklós Ajtai. 249-268 [doi]
• 3Steven Heilman, Aukosh Jagannath, Assaf Naor. 269-276 [doi]
• n hardness for the closest vector problem with preprocessingSubhash Khot, Preyas Popat, Nisheeth K. Vishnoi. 277-288 [doi]
• A new point of NP-hardness for unique gamesRyan O'Donnell, John Wright. 289-306 [doi]
• Hypercontractivity, sum-of-squares proofs, and their applicationsBoaz Barak, Fernando G. S. L. Brandão, Aram Wettroth Harrow, Jonathan A. Kelner, David Steurer, Yuan Zhou. 307-326 [doi]
• From irreducible representations to locally decodable codesKlim Efremenko. 327-338 [doi]
• Folded codes from function field towers and improved optimal rate list decodingVenkatesan Guruswami, Chaoping Xing. 339-350 [doi]
• Subspace evasive setsZeev Dvir, Shachar Lovett. 351-358 [doi]
• Edge transitive ramanujan graphs and symmetric LDPC good codesTali Kaufman, Alexander Lubotzky. 359-366 [doi]
• Approximation algorithms for semi-random partitioning problemsKonstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan. 367-384 [doi]
• A near-linear time ε-approximation algorithm for geometric bipartite matchingR. Sharathkumar, Pankaj K. Agarwal. 385-394 [doi]
• Using petal-decompositions to build a low stretch spanning treeIttai Abraham, Ofer Neiman. 395-406 [doi]
• Improved smoothed analysis of multiobjective optimizationTobias Brunsch, Heiko Röglin. 407-426 [doi]
• Prior-free auctions with ordered biddersStefano Leonardi, Tim Roughgarden. 427-434 [doi]
• On the limits of black-box reductions in mechanism designShuchi Chawla, Nicole Immorlica, Brendan Lucier. 435-448 [doi]
• Budget feasible mechanism design: from prior-free to bayesianXiaohui Bei, Ning Chen, Nick Gravin, Pinyan Lu. 449-458 [doi]
• An algorithmic characterization of multi-dimensional mechanismsYang Cai, Constantinos Daskalakis, S. Matthew Weinberg. 459-478 [doi]
• Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gatesAnna Gál, Kristoffer Arnsfelt Hansen, Michal Koucký, Pavel Pudlák, Emanuele Viola. 479-494 [doi]
• Tight bounds for monotone switching networks via fourier analysisSiu Man Chan, Aaron Potechin. 495-504 [doi]
• Interactive information complexityMark Braverman. 505-524 [doi]
• The multiparty communication complexity of set disjointnessAlexander A. Sherstov. 525-548 [doi]
• Fast matrix rank algorithms and applicationsHo Yee Cheung, Tsz Chiu Kwok, Lap Chi Lau. 549-562 [doi]
• Nearly optimal sparse fourier transformHaitham Hassanieh, Piotr Indyk, Dina Katabi, Eric Price. 563-578 [doi]
• Polynomial time algorithms for multi-type branching processesand stochastic context-free grammarsKousha Etessami, Alistair Stewart, Mihalis Yannakakis. 579-588 [doi]
• Optimal online buffer scheduling for block devicesAnna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke. 589-598 [doi]
• Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuitsManindra Agrawal, Chandan Saha, Ramprasad Saptharishi, Nitin Saxena. 599-614 [doi]
• Separating multilinear branching programs and formulasZeev Dvir, Guillaume Malod, Sylvain Perifel, Amir Yehudayoff. 615-624 [doi]
• Reconstruction of depth-4 multilinear circuits with top fan-in 2Ankit Gupta 0001, Neeraj Kayal, Satyanarayana V. Lokam. 625-642 [doi]
• Affine projections of polynomials: extended abstractNeeraj Kayal. 643-662 [doi]
• The traveling salesman problem: low-dimensionality implies a polynomial time approximation schemeYair Bartal, Lee-Ad Gottlieb, Robert Krauthgamer. 663-672 [doi]
• On vertex sparsifiers with Steiner nodesJulia Chuzhoy. 673-688 [doi]
• Approximation algorithms and hardness of integral concurrent flowParinya Chalermsook, Julia Chuzhoy, Alina Ene, Shi Li. 689-708 [doi]
• Learning poisson binomial distributionsConstantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio. 709-728 [doi]
• Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspacesAnindya De, Ilias Diakonikolas, Vitaly Feldman, Rocco A. Servedio. 729-746 [doi]
• Making polynomials robust to noiseAlexander A. Sherstov. 747-758 [doi]
• Competitive contagion in networksSanjeev Goyal, Michael Kearns. 759-774 [doi]
• Finding red balloons with split contracts: robustness to individuals' selfishnessManuel Cebrián, Lorenzo Coviello, Andrea Vattani, Panagiotis Voulgaris. 775-788 [doi]
• An analysis of one-dimensional schelling segregationChristina Brandt, Nicole Immorlica, Gautam Kamath, Robert Kleinberg. 789-804 [doi]
• Pseudorandom generators with long stretch and low locality from random local one-way functionsBenny Applebaum. 805-816 [doi]
• Characterizing pseudoentropy and simplifying pseudorandom generator constructionsSalil P. Vadhan, Colin Jia Zheng. 817-836 [doi]
• Design extractors, non-malleable condensers and privacy amplificationXin Li. 837-854 [doi]
• Routing in undirected graphs with constant congestionJulia Chuzhoy. 855-874 [doi]
• Improving christofides' algorithm for the s-t path TSPHyung-Chan An, Robert Kleinberg, David B. Shmoys. 875-886 [doi]
• Multiplying matrices faster than coppersmith-winogradVirginia Vassilevska Williams. 887-898 [doi]
• Catching the k-NAESAT thresholdAmin Coja-Oghlan, Konstantinos Panagiotou. 899-908 [doi]
• Complexity of counting CSP with complex weightsJin-yi Cai, Xi Chen. 909-920 [doi]
• The freezing threshold for k-colourings of a random graphMichael Molloy. 921-930 [doi]
• Robust satisfiability of constraint satisfaction problemsLibor Barto, Marcin Kozik. 931-940 [doi]
• Tight bounds for distributed functional monitoringDavid P. Woodruff, Qin Zhang. 941-960 [doi]
• Global computation in a poorly connected world: fast rumor spreading with no dependence on conductanceKeren Censor Hillel, Bernhard Haeupler, Jonathan A. Kelner, Petar Maymounkov. 961-970 [doi]
• Tight time-space tradeoff for mutual exclusionNikhil Bansal, Vibhor Bhatt, Prasad Jayanti, Ranganath Kondapally. 971-982 [doi]
• A tight RMR lower bound for randomized mutual exclusionGeorge Giakkoupis, Philipp Woelfel. 983-1002 [doi]
• A complementary pivot algorithm for markets under separable, piecewise-linear concave utilitiesJugal Garg, Ruta Mehta, Milind A. Sohoni, Vijay V. Vazirani. 1003-1016 [doi]
• Rational proofsPablo Daniel Azar, Silvio Micali. 1017-1028 [doi]
• Minimax option pricing meets black-scholes in the limitJacob Abernethy, Rafael M. Frongillo, Andre Wibisono. 1029-1040 [doi]
• A quantitative gibbard-satterthwaite theorem without neutralityElchanan Mossel, Miklós Z. Rácz. 1041-1060 [doi]
• Monotone expansionJean Bourgain, Amir Yehudayoff. 1061-1078 [doi]
• Nearly complete graphs decomposable into large induced matchings and their applicationsNoga Alon, Ankur Moitra, Benny Sudakov. 1079-1090 [doi]
• Probabilistic existence of rigid combinatorial structuresGreg Kuperberg, Shachar Lovett, Ron Peled. 1091-1106 [doi]
• From query complexity to computational complexityShahar Dobzinski, Jan Vondrák. 1107-1116 [doi]
• Multi-way spectral partitioning and higher-order cheeger inequalitiesJames R. Lee, Shayan Oveis Gharan, Luca Trevisan. 1117-1130 [doi]
• Many sparse cuts via higher eigenvaluesAnand Louis, Prasad Raghavendra, Prasad Tetali, Santosh Vempala. 1131-1140 [doi]
• m)-time spectral algorithm for balanced separatorLorenzo Orecchia, Sushant Sachdeva, Nisheeth K. Vishnoi. 1141-1160 [doi]
• Matroids and integrality gaps for hypergraphic steiner tree relaxationsMichel X. Goemans, Neil Olver, Thomas Rothvoß, Rico Zenklusen. 1161-1176 [doi]
• Strict fibonacci heapsGerth Stølting Brodal, George Lagogiannis, Robert Endre Tarjan. 1177-1184 [doi]
• Tight lower bounds for the online labeling problemJan Bulánek, Michal Koucký, Michael Saks. 1185-1198 [doi]
• Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labelsIttai Abraham, Shiri Chechik, Cyril Gavoille. 1199-1218 [doi]
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryptionAdriana López-Alt, Eran Tromer, Vinod Vaikuntanathan. 1219-1234 [doi]
• Multiparty computation secure against continual memory leakageElette Boyle, Shafi Goldwasser, Abhishek Jain 0002, Yael Tauman Kalai. 1235-1254 [doi]
• Beating randomized response on incoherent matricesMoritz Hardt, Aaron Roth. 1255-1268 [doi]
• Unconditional differentially private mechanisms for linear queriesAditya Bhaskara, Daniel Dadush, Ravishankar Krishnaswamy, Kunal Talwar. 1269-1284 [doi]
• Optimal private halfspace counting via discrepancyS. Muthukrishnan, Aleksandar Nikolov. 1285-1292 [doi]