Table of Contents

• Fingerprinting codes and the price of approximate differential privacyMark Bun, Jonathan Ullman, Salil P. Vadhan. 1-10 [doi]
• Analyze gauss: optimal bounds for privacy-preserving principal component analysisCynthia Dwork, Kunal Talwar, Abhradeep Thakurta, Li Zhang 0001. 11-20 [doi]
• Private matchings and allocationsJustin Hsu, Zhiyi Huang, Aaron Roth, Tim Roughgarden, Zhiwei Steven Wu. 21-30 [doi]
• Rounding sum-of-squares relaxationsBoaz Barak, Jonathan A. Kelner, David Steurer. 31-40 [doi]
• Constant factor approximation for balanced cut in the PIE modelKonstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan. 41-49 [doi]
• Entropy, optimization and countingMohit Singh, Nisheeth K. Vishnoi. 50-59 [doi]
• Polynomial bounds for the grid-minor theoremChandra Chekuri, Julia Chuzhoy. 60-69 [doi]
• An excluded half-integral grid theorem for digraphs and the directed disjoint paths problemKen-ichi Kawarabayashi, Yusuke Kobayashi, Stephan Kreutzer. 70-78 [doi]
• Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphsIttai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, Kunal Talwar. 79-88 [doi]
• Deciding first-order properties of nowhere dense graphsMartin Grohe, Stephan Kreutzer, Sebastian Siebertz. 89-98 [doi]
• Pseudorandom generators with optimal seed length for non-boolean poly-size circuitsSergei Artemenko, Ronen Shaltiel. 99-108 [doi]
• On derandomizing algorithms that err extremely rarelyOded Goldreich, Avi Wigderson. 109-118 [doi]
• Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulasNeeraj Kayal, Nutan Limaye, Chandan Saha, Srikanth Srinivasan. 119-127 [doi]
• Lower bounds for depth 4 formulas computing iterated matrix multiplicationHervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan. 128-135 [doi]
• The limits of depth reduction for arithmetic formulas: it's all about the top fan-inMrinal Kumar, Shubhangi Saraf. 136-145 [doi]
• A super-polynomial lower bound for regular arithmetic formulasNeeraj Kayal, Chandan Saha, Ramprasad Saptharishi. 146-153 [doi]
• Linear time construction of compressed text indices in compact spaceDjamal Belazzougui. 148-193 [doi]
• A characterization of locally testable affine-invariant properties via decomposition theoremsYuichi Yoshida. 154-163 [doi]
• p-testingPiotr Berman, Sofya Raskhodnikova, Grigory Yaroslavtsev. 164-173 [doi]
• Turnstile streaming algorithms might as well be linear sketchesYi Li, Huy L. Nguyen, David P. Woodruff. 174-183 [doi]
• New algorithms and lower bounds for circuits with linear threshold gatesRyan Williams. 194-202 [doi]
• Formulas vs. circuits for small distance connectivityBenjamin Rossman. 203-212 [doi]
• Toward better formula lower bounds: an information complexity approach to the KRW composition conjectureDmitry Gavinsky, Or Meir, Omri Weinstein, Avi Wigderson. 213-222 [doi]
• Breaking the minsky-papert barrier for constant-depth circuitsAlexander A. Sherstov. 223-232 [doi]
• Economic efficiency requires interactionShahar Dobzinski, Noam Nisan, Sigal Oren. 233-242 [doi]
• The sample complexity of revenue maximizationRichard Cole, Tim Roughgarden. 243-252 [doi]
• Optimal competitive auctionsNing Chen, Nick Gravin, Pinyan Lu. 253-262 [doi]
• The matching polytope has exponential extension complexityThomas Rothvoß. 263-272 [doi]
• Homological product codesSergey Bravyi, Matthew B. Hastings. 273-282 [doi]
• Exponential improvement in precision for simulating sparse HamiltoniansDominic W. Berry, Andrew M. Childs, Richard Cleve, Robin Kothari, Rolando D. Somma. 283-292 [doi]
• A quantum algorithm for computing the unit group of an arbitrary degree number fieldKirsten Eisenträger, Sean Hallgren, Alexei Kitaev, Fang Song 0001. 293-302 [doi]
• Primal beats dual on online packing LPs in the random-order modelThomas Kesselheim, Andreas Tönnis, Klaus Radke, Berthold Vöcking. 303-312 [doi]
• Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraintsSungjin Im, Janardhan Kulkarni, Kamesh Munagala. 313-322 [doi]
• Minimum bisection is fixed parameter tractableMarek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh. 323-332 [doi]
• An efficient parallel solver for SDD linear systemsRichard Peng, Daniel A. Spielman. 333-342 [doi]
• n timeMichael B. Cohen, Rasmus Kyng, Gary L. Miller, Jakub W. Pachocki, Richard Peng, Anup Rao, Shen Chen Xu. 343-352 [doi]
• Optimal CUR matrix decompositionsChristos Boutsidis, David P. Woodruff. 353-362 [doi]
• From hierarchical partitions to hierarchical covers: optimal fault-tolerant spanners for doubling metricsShay Solomon. 363-372 [doi]
• Shortest paths on polyhedral surfaces and terrainsSiu-Wing Cheng, Jiongxin Jin. 373-382 [doi]
• Embedding and canonizing graphs of bounded genus in logspaceMichael Elberfeld, Ken-ichi Kawarabayashi. 383-392 [doi]
• Testing surface area with arbitrary accuracyJoe Neeman. 393-397 [doi]
• any constant bias implies one-way functionsItay Berman, Iftach Haitner, Aris Tentes. 398-407 [doi]
• An almost-optimally fair three-party coin-flipping protocolIftach Haitner, Eliad Tsfadia. 408-416 [doi]
• Robust protocols for securely expanding randomness and distributing keys using untrusted quantum devicesCarl A. Miller, Yaoyun Shi. 417-426 [doi]
• Infinite randomness expansion with a constant number of devicesMatthew Coudron, Henry Yuen. 427-436 [doi]
• The average sensitivity of an intersection of half spacesDaniel M. Kane. 437-440 [doi]
• From average case complexity to improper learning complexityAmit Daniely, Nati Linial, Shai Shalev-Shwartz. 441-448 [doi]
• The power of localization for efficiently learning linear separators with noisePranjal Awasthi, Maria-Florina Balcan, Philip M. Long. 449-458 [doi]
• 2/3 regretOfer Dekel, Jian Ding, Tomer Koren, Yuval Peres. 459-467 [doi]
• Online local learning via semidefinite programmingPaul Christiano. 468-474 [doi]
• How to use indistinguishability obfuscation: deniable encryption, and moreAmit Sahai, Brent Waters. 475-484 [doi]
• How to delegate computations: the power of no-signaling proofsYael Tauman Kalai, Ran Raz, Ron D. Rothblum. 485-494 [doi]
• Circuits resilient to additive attacks with applications to secure computationDaniel Genkin, Yuval Ishai, Manoj Prabhakaran, Amit Sahai, Eran Tromer. 495-504 [doi]
• On the existence of extractable one-way functionsNir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen. 505-514 [doi]
• Black-box non-black-box zero knowledgeVipul Goyal, Rafail Ostrovsky, Alessandra Scafuro, Ivan Visconti. 515-524 [doi]
• Dichotomies in equilibrium computation, and complementary pivot algorithms for a new class of non-separable utility functionsJugal Garg, Ruta Mehta, Vijay V. Vazirani. 525-534 [doi]
• Query complexity of approximate nash equilibriaYakov Babichenko. 535-544 [doi]
• Constant rank bimatrix games are PPAD-hardRuta Mehta. 545-554 [doi]
• Approximation algorithms for bipartite matching with metric and geometric costsPankaj K. Agarwal, R. Sharathkumar. 555-564 [doi]
• Distributed approximation algorithms for weighted shortest pathsDanupon Nanongkai. 565-573 [doi]
• Parallel algorithms for geometric graph problemsAlexandr Andoni, Aleksandar Nikolov, Krzysztof Onak, Grigory Yaroslavtsev. 574-583 [doi]
• Fourier PCA and robust tensor decompositionNavin Goyal, Santosh Vempala, Ying Xiao. 584-593 [doi]
• Smoothed analysis of tensor decompositionsAditya Bhaskara, Moses Charikar, Ankur Moitra, Aravindan Vijayaraghavan. 594-603 [doi]
• Efficient density estimation via piecewise polynomial approximationSiu On Chan, Ilias Diakonikolas, Rocco A. Servedio, Xiaorui Sun. 604-613 [doi]
• Super-polylogarithmic hypergraph coloring hardness via low-degree long codesVenkatesan Guruswami, Prahladh Harsha, Johan Håstad, Srikanth Srinivasan, Girish Varma. 614-623 [doi]
• Analytical approach to parallel repetitionIrit Dinur, David Steurer. 624-633 [doi]
• A characterization of strong approximation resistanceSubhash Khot, Madhur Tulsiani, Pratik Worah. 634-643 [doi]
• A strongly polynomial algorithm for generalized flow maximizationLászló A. Végh. 644-653 [doi]
• Approximate distance oracles with constant query timeShiri Chechik. 654-663 [doi]
• Faster all-pairs shortest paths via circuit complexityRyan Williams. 664-673 [doi]
• Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphsMonika Henzinger, Sebastian Krinninger, Danupon Nanongkai. 674-683 [doi]
• Zig-zag sort: a simple deterministic data-oblivious sorting algorithm running in O(n log n) timeMichael T. Goodrich. 684-693 [doi]
• Community detection thresholds and the weak Ramanujan propertyLaurent Massoulié. 694-703 [doi]
• Distributed computability in Byzantine asynchronous systemsHammurabi Mendes, Christine Tasson, Maurice Herlihy. 704-713 [doi]
• Are lock-free concurrent algorithms practically wait-free?Dan Alistarh, Keren Censor Hillel, Nir Shavit. 714-723 [doi]
• Multiway cut, pairwise realizable distributions, and descending thresholdsAnkit Sharma, Jan Vondrák. 724-733 [doi]
• Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routingRavishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein. 734-743 [doi]
• Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routingZachary Friggstad, Chaitanya Swamy. 744-753 [doi]
• Improved approximation algorithms for degree-bounded network design problems with node connectivity requirementsAlina Ene, Ali Vakilian. 754-763 [doi]
• Every list-decodable code for high noise has abundant near-optimal rate puncturingsAtri Rudra, Mary Wootters. 764-773 [doi]
• Non-malleable codes from additive combinatoricsDivesh Aggarwal, Yevgeniy Dodis, Shachar Lovett. 774-783 [doi]
• Breaking the quadratic barrier for 3-LCC's over the realsZeev Dvir, Shubhangi Saraf, Avi Wigderson. 784-793 [doi]
• Optimal error rates for interactive coding I: adaptivity and other settingsMohsen Ghaffari, Bernhard Haeupler, Madhu Sudan. 794-803 [doi]
• The asymptotic k-SAT thresholdAmin Coja-Oghlan. 804-813 [doi]
• Satisfiability threshold for random regular NAE-SATJian Ding, Allan Sly, Nike Sun. 814-822 [doi]
• Inapproximability for antiferromagnetic spin systems in the tree non-uniqueness regionAndreas Galanis, Daniel Stefankovic, Eric Vigoda. 823-831 [doi]
• Efficient deterministic approximate counting for low-degree polynomial threshold functionsAnindya De, Rocco A. Servedio. 832-841 [doi]
• Communication is bounded by root of rankShachar Lovett. 842-846 [doi]
• Communication lower bounds via critical block sensitivityMika Göös, Toniann Pitassi. 847-856 [doi]
• Computing with a full memory: catalytic spaceHarry Buhrman, Richard Cleve, Michal Koucký, Bruno Loff, Florian Speelman. 857-866 [doi]
• Hitting sets for multilinear read-once algebraic branching programs, in any orderMichael A. Forbes, Ramprasad Saptharishi, Amir Shpilka. 867-875 [doi]