Table of Contents

• An Improved Competitive Algorithm for Reordering Buffer ManagementNoa Avigdor-Elgrabli, Yuval Rabani. 1-10 [doi]
• On Randomized Memoryless Algorithms for the Weighted K-Server ProblemAshish Chiplunkar, Sundar Vishwanathan. 11-19 [doi]
• Approximating Bin Packing within O(log OPT * Log Log OPT) BinsThomas Rothvoß. 20-29 [doi]
• Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free GraphsJoseph Cheriyan, László A. Végh. 30-39 [doi]
• Candidate Indistinguishability Obfuscation and Functional Encryption for all CircuitsSanjam Garg, Craig Gentry, Shai Halevi, Mariana Raykova 0001, Amit Sahai, Brent Waters. 40-49 [doi]
• Constant-Round Concurrent Zero Knowledge from P-CertificatesKai-Min Chung, Huijia Lin, Rafael Pass. 50-59 [doi]
• Simultaneous Resettability from One-Way FunctionsKai-Min Chung, Rafail Ostrovsky, Rafael Pass, Ivan Visconti. 60-69 [doi]
• From Unprovability to Environmentally Friendly ProtocolsRan Canetti, Huijia Lin, Rafael Pass. 70-79 [doi]
• How to Approximate a Set without Knowing Its Size in AdvanceRasmus Pagh, Gil Segev, Udi Wieder. 80-89 [doi]
• Simple Tabulation, Fast Expanders, Double Tabulation, and High IndependenceMikkel Thorup. 90-99 [doi]
• Extractors for a Constant Number of Independent Sources with Polylogarithmic Min-EntropyXin Li. 100-109 [doi]
• A Polynomial Time Algorithm for Lossy Population RecoveryAnkur Moitra, Michael Saks. 110-116 [doi]
• OSNAP: Faster Numerical Linear Algebra Algorithms via Sparser Subspace EmbeddingsJelani Nelson, Huy L. Nguyen. 117-126 [doi]
• Iterative Row SamplingMu Li, Gary L. Miller, Richard Peng. 127-136 [doi]
• Algebraic Algorithms for B-Matching, Shortest Undirected Paths, and F-FactorsHarold N. Gabow, Piotr Sankowski. 137-146 [doi]
• Efficient Accelerated Coordinate Descent Methods and Faster Algorithms for Solving Linear SystemsYin Tat Lee, Aaron Sidford. 147-156 [doi]
• Faster Canonical Forms for Strongly Regular GraphsLászló Babai, Xi Chen, Xiaorui Sun, Shang-Hua Teng, John Wilmes. 157-166 [doi]
• Approximation Algorithms for Euler Genus and Related ProblemsChandra Chekuri, Anastasios Sidiropoulos. 167-176 [doi]
• Non-positive Curvature and the Planar Embedding ConjectureAnastasios Sidiropoulos. 177-186 [doi]
• All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar GraphsKen-ichi Kawarabayashi, Yusuke Kobayashi. 187-196 [doi]
• The Planar Directed K-Vertex-Disjoint Paths Problem Is Fixed-Parameter TractableMarek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk. 197-206 [doi]
• Bandits with KnapsacksAshwinkumar Badanidiyuru, Robert Kleinberg, Aleksandrs Slivkins. 207-216 [doi]
• Learning Sums of Independent Integer Random VariablesConstantinos Daskalakis, Ilias Diakonikolas, Ryan O'Donnell, Rocco A. Servedio, Li-Yang Tan. 217-226 [doi]
• Optimal Bounds on Approximation of Submodular and XOS Functions by JuntasVitaly Feldman, Jan Vondrák. 227-236 [doi]
• Estimating the Distance from Testable Affine-Invariant PropertiesHamed Hatami, Shachar Lovett. 237-242 [doi]
• Quasipolynomial-Time Identity Testing of Non-commutative and Read-Once Oblivious Algebraic Branching ProgramsMichael A. Forbes, Amir Shpilka. 243-252 [doi]
• Navigating Central Path with Electrical Flows: From Flows to Matchings, and BackAleksander Madry. 253-262 [doi]
• Nearly Maximum Flows in Nearly Linear TimeJonah Sherman. 263-269 [doi]
• Towards a Better Approximation for Sparsest Cut?Sanjeev Arora, Rong Ge, Ali Kemal Sinop. 270-279 [doi]
• Layered Separators for Queue Layouts, 3D Graph Drawing and Nonrepetitive ColoringVida Dujmovic, Pat Morin, David R. Wood. 280-289 [doi]
• Element Distinctness, Frequency Moments, and Sliding WindowsPaul Beame, Raphaël Clifford, Widad Machmouchi. 290-299 [doi]
• Spatial Mixing and Approximation Algorithms for Graphs with Bounded Connective ConstantAlistair Sinclair, Piyush Srivastava, Yitong Yin. 300-309 [doi]
• Polar Codes: Speed of Polarization and Polynomial Gap to CapacityVenkatesan Guruswami, Patrick Xia. 310-319 [doi]
• Constant Rate PCPs for Circuit-SAT with Sublinear Query ComplexityEli Ben-Sasson, Yohay Kaplan, Swastik Kopparty, Or Meir, Henning Stichtenoth. 320-329 [doi]
• Strong LTCs with Inverse Poly-Log Rate and Constant SoundnessMichael Viderman. 330-339 [doi]
• PCPs via Low-Degree Long Code and Hardness for Constrained Hypergraph ColoringIrit Dinur, Venkatesan Guruswami. 340-349 [doi]
• Approximate Constraint Satisfaction Requires Large LP RelaxationsSiu On Chan, James R. Lee, Prasad Raghavendra, David Steurer. 350-359 [doi]
• The Complexity of Approximating Vertex ExpansionAnand Louis, Prasad Raghavendra, Santosh Vempala. 360-369 [doi]
• Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation HardnessesParinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai. 370-379 [doi]
• Chasing the K-Colorability ThresholdAmin Coja-Oghlan, Dan Vilenchik. 380-389 [doi]
• On Clustering Induced Voronoi DiagramsDanny Z. Chen, Ziyun Huang, Yangwei Liu, Jinhui Xu. 390-399 [doi]
• Approximation Schemes for Maximum Weight Independent Set of RectanglesAnna Adamaszek, Andreas Wiese. 400-409 [doi]
• Klee's Measure Problem Made EasyTimothy M. Chan. 410-419 [doi]
• Playing Non-linear Games with Linear OraclesDan Garber, Elad Hazan. 420-428 [doi]
• Local Privacy and Statistical Minimax RatesJohn C. Duchi, Michael I. Jordan, Martin J. Wainwright. 429-438 [doi]
• Coupled-Worlds Privacy: Exploiting Adversarial Uncertainty in Statistical Data PrivacyRaef Bassily, Adam Groce, Jonathan Katz, Adam Smith. 439-448 [doi]
• Knowledge-Preserving Interactive CodingKai-Min Chung, Rafael Pass, Sidharth Telang. 449-458 [doi]
• Adaptive Seeding in Social NetworksLior Seeman, Yaron Singer. 459-468 [doi]
• The Moser-Tardos Framework with Partial ResamplingDavid G. Harris, Aravind Srinivasan. 469-478 [doi]
• A Satisfiability Algorithm for Sparse Depth Two Threshold CircuitsRussell Impagliazzo, Ramamohan Paturi, Stefan Schneider. 479-488 [doi]
• Strong Backdoors to Bounded Treewidth SATSerge Gaspers, Stefan Szeider. 489-498 [doi]
• An O(c^k n) 5-Approximation Algorithm for TreewidthHans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk. 499-508 [doi]
• Improved Approximation for 3-Dimensional Matching via Bounded Pathwidth Local SearchMarek Cygan. 509-518 [doi]
• On Kinetic Delaunay Triangulations: A Near Quadratic Bound for Unit Speed MotionsNatan Rubin. 519-528 [doi]
• Interlacing Families I: Bipartite Ramanujan Graphs of All DegreesAdam Marcus, Daniel A. Spielman, Nikhil Srivastava. 529-537 [doi]
• Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and DerandomizationMonika Henzinger, Sebastian Krinninger, Danupon Nanongkai. 538-547 [doi]
• Fully Dynamic (1+ e)-Approximate MatchingsManoj Gupta, Richard Peng. 548-557 [doi]
• Online Node-Weighted Steiner Forest and Extensions via Disk PaintingsMohammad Taghi Hajiaghayi, Vahid Liaghat, Debmalya Panigrahi. 558-567 [doi]
• An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner TreeJochen Könemann, Sina Sadeghian Sadeghabad, Laura Sanità. 568-577 [doi]
• Arithmetic Circuits: A Chasm at Depth ThreeAnkit Gupta 0001, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi. 578-587 [doi]
• Improved Average-Case Lower Bounds for DeMorgan Formula SizeIlan Komargodski, Ran Raz, Avishay Tal. 588-597 [doi]
• Average Case Lower Bounds for Monotone Switching NetworksYuval Filmus, Toniann Pitassi, Robert Robere, Stephen A. Cook. 598-607 [doi]
• Explicit Subspace DesignsVenkatesan Guruswami, Swastik Kopparty. 608-617 [doi]
• Understanding Incentives: Mechanism Design Becomes Algorithm DesignYang Cai, Constantinos Daskalakis, S. Matthew Weinberg. 618-627 [doi]
• The Simple Economics of Approximately Optimal AuctionsSaeed Alaei, Hu Fu, Nima Haghpanah, Jason D. Hartline. 628-637 [doi]
• The Price of Stability for Undirected Broadcast Network Design with Fair Cost Allocation Is ConstantVittorio Bilò, Michele Flammini, Luca Moscardelli. 638-647 [doi]
• Rational Protocol Design: Cryptography against Incentive-Driven AdversariesJuan A. Garay, Jonathan Katz, Ueli Maurer, Björn Tackmann, Vassilis Zikas. 648-657 [doi]
• Fourier Sparsity, Spectral Norm, and the Log-Rank ConjectureHing Yin Tsang, Chung Hoi Wong, Ning Xie, Shengyu Zhang. 658-667 [doi]
• A Tight Bound for Set Disjointness in the Message-Passing ModelMark Braverman, Faith Ellen, Rotem Oshman, Toniann Pitassi, Vinod Vaikuntanathan. 668-677 [doi]
• On the Communication Complexity of Sparse Set Disjointness and Exists-Equal ProblemsMert Saglam, Gábor Tardos. 678-687 [doi]
• Common Information and Unique DisjointnessGábor Braun, Sebastian Pokutta. 688-697 [doi]
• A Linear Time Approximation Scheme for Euclidean TSPYair Bartal, Lee-Ad Gottlieb. 698-706 [doi]
• A Forward-Backward Single-Source Shortest Paths AlgorithmDavid B. Wilson, Uri Zwick. 707-716 [doi]
• Approximating Minimization Diagrams and Generalized Proximity SearchSariel Har-Peled, Nirman Kumar. 717-726 [doi]
• The Parity of Directed Hamiltonian CyclesAndreas Björklund, Thore Husfeldt. 727-735 [doi]
• Nondeterministic Direct Product Reductions and the Success Probability of SAT SolversAndrew Drucker. 736-745 [doi]
• Direct Products in Communication ComplexityMark Braverman, Anup Rao, Omri Weinstein, Amir Yehudayoff. 746-755 [doi]
• Quantum 3-SAT Is QMA1-CompleteDavid Gosset, Daniel Nagaj. 756-765 [doi]
• Three-Player Entangled XOR Games Are NP-Hard to ApproximateThomas Vidick. 766-775 [doi]