Table of Contents

• Statistical Randomized Encodings: A Complexity Theoretic ViewShweta Agrawal, Yuval Ishai, Dakshita Khurana, Anat Paskin-Cherniavsky. 1-13 [doi]
• Tighter Fourier Transform Lower BoundsNir Ailon. 14-25 [doi]
• Quantifying Competitiveness in Paging with Locality of ReferenceSusanne Albers, Dario Frascaria. 26-38 [doi]
• Approximation Algorithms for Computing Maximin Share AllocationsGeorgios Amanatidis, Evangelos Markakis, Afshin Nikzad, Amin Saberi. 39-51 [doi]
• Envy-Free Pricing in Large Markets: Approximating Revenue and WelfareElliot Anshelevich, Koushik Kar, Shreyas Sekar. 52-64 [doi]
• Batched Point Location in SINR Diagrams via Algebraic ToolsBoris Aronov, Matthew J. Katz. 65-77 [doi]
• On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform CostsNoa Avigdor-Elgrabli, Sungjin Im, Benjamin Moseley, Yuval Rabani. 78-90 [doi]
• Serving in the Dark should be done Non-UniformlyYossi Azar, Ilan Reuven Cohen. 91-102 [doi]
• Finding the Median (Obliviously) with Bounded SpacePaul Beame, Vincent Liew, Mihai Patrascu. 103-115 [doi]
• Approximation Algorithms for Min-Sum k-Clustering and Balanced k-MedianBabak Behsaz, Zachary Friggstad, Mohammad R. Salavatipour, Rohit Sivakumar. 116-128 [doi]
• Solving Linear Programming with Constraints UnknownXiaohui Bei, Ning Chen, Shengyu Zhang. 129-142 [doi]
• Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani SourcesSalman Beigi, Omid Etesami, Amin Gohari. 143-154 [doi]
• Limitations of Algebraic Approaches to Graph Isomorphism TestingChristoph Berkholz, Martin Grohe. 155-166 [doi]
• Fully Dynamic Matching in Bipartite GraphsAaron Bernstein, Cliff Stein. 167-179 [doi]
• Feasible Interpolation for QBF Resolution CalculiOlaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla. 180-192 [doi]
• Simultaneous Approximation of Constraint Satisfaction ProblemsAmey Bhangale, Swastik Kopparty, Sushant Sachdeva. 193-205 [doi]
• Design of Dynamic Algorithms via Primal-Dual MethodSayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano. 206-218 [doi]
• What Percentage of Programs Halt?Laurent Bienvenu, Damien Desfontaines, Alexander Shen. 219-230 [doi]
• The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time ProblemsAndreas Björklund, Holger Dell, Thore Husfeldt. 231-242 [doi]
• Spotting Trees with Few LeavesAndreas Björklund, Vikram Kamat, Lukasz Kowalik, Meirav Zehavi. 243-255 [doi]
• Constraint Satisfaction Problems over the Integers with SuccessorManuel Bodirsky, Barnaby Martin, Antoine Mottet. 256-267 [doi]
• Hardness Amplification and the Approximate Degree of Constant-Depth CircuitsMark Bun, Justin Thaler. 268-280 [doi]
• Algorithms and Complexity for Turaev-Viro InvariantsBenjamin A. Burton, Clément Maria, Jonathan Spreer. 281-293 [doi]
• Big Data on the Rise? - Testing Monotonicity of DistributionsClément L. Canonne. 294-305 [doi]
• Unit Interval Editing is Fixed-Parameter TractableYixin Cao. 306-317 [doi]
• Streaming Algorithms for Submodular Function MaximizationChandra Chekuri, Shalmoli Gupta, Kent Quanrud. 318-330 [doi]
• Multilinear Pseudorandom FunctionsAloni Cohen, Justin Holmgren. 331-342 [doi]
• Zero-Fixing Extractors for Sub-Logarithmic EntropyGil Cohen, Igor Shinkar. 343-354 [doi]
• Interactive Proofs with Approximately Commuting ProversMatthew Coudron, Thomas Vidick. 355-366 [doi]
• Popular Matchings with Two-Sided Preferences and One-Sided TiesÁgnes Cseh, Chien-Chung Huang, Telikepalli Kavitha. 367-379 [doi]
• Block Interpolation: A Framework for Tight Exponential-Time Counting ComplexityRadu Curticapean. 380-392 [doi]
• On Convergence and Threshold Properties of Discrete Lotka-Volterra Population ProtocolsJurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis, Paul G. Spirakis, Przemyslaw Uznanski. 393-405 [doi]
• Scheduling Bidirectional Traffic on a PathYann Disser, Max Klimm, Elisabeth Lübbecke. 406-418 [doi]
• On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic LogspaceDean Doron, Amnon Ta-Shma. 419-431 [doi]
• On Planar Boolean CSPZdenek Dvorak, Martin Kupec. 432-443 [doi]
• On Temporal Graph ExplorationThomas Erlebach, Michael Hoffmann 0002, Frank Kammer. 444-455 [doi]
• Mind Your Coins: Fully Leakage-Resilient Signatures with Graceful DegradationAntonio Faonio, Jesper Buus Nielsen, Daniele Venturi. 456-468 [doi]
• A (1+ε ) ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth GraphsAndreas Emil Feldmann, Wai Shing Fung, Jochen Könemann, Ian Post. 469-480 [doi]
• Lower Bounds for the Graph Homomorphism ProblemFedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin. 481-493 [doi]
• Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner TreeFedor V. Fomin, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh. 494-505 [doi]
• Relative Discrepancy Does not Separate Information and Communication ComplexityLila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurière, Jérémie Roland. 506-516 [doi]
• A Galois Connection for Valued Constraint Languages of Infinite SizePeter Fulla, Stanislav Zivny. 517-528 [doi]
• Approximately Counting H-Colourings is #\mathrm BIS # BIS -HardAndreas Galanis, Leslie Ann Goldberg, Mark Jerrum. 529-541 [doi]
• Taylor Polynomial Estimator for Estimating Frequency MomentsSumit Ganguly. 542-553 [doi]
• ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash EquilibriaJugal Garg, Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod. 554-566 [doi]
• Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating SetsSerge Gaspers, Gregory B. Sorkin. 567-579 [doi]
• Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor SearchPawel Gawrychowski, Shay Mozes, Oren Weimann. 580-592 [doi]
• Optimal Encodings for Range Top- k k , Selection, and Min-MaxPawel Gawrychowski, Patrick K. Nicholson. 593-604 [doi]
• 2-Vertex Connectivity in Directed GraphsLoukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis. 605-616 [doi]
• Ground State Connectivity of Local HamiltoniansSevag Gharibian, Jamie Sikora. 617-628 [doi]
• Uniform Kernelization Complexity of Hitting Forbidden MinorsArchontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh. 629-641 [doi]
• Counting Homomorphisms to Square-Free Graphs, Modulo 2Andreas Göbel 0001, Leslie Ann Goldberg, David Richerby. 642-653 [doi]
• Approximately Counting Locally-Optimal StructuresLeslie Ann Goldberg, Rob Gysel, John Lapinskas. 654-665 [doi]
• Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs - (Extended Abstract)Oded Goldreich, Tom Gur, Ron D. Rothblum. 666-677 [doi]
• Fast Algorithms for Diameter-Optimally Augmenting PathsUlrike Große, Joachim Gudmundsson, Christian Knauer, Michiel H. M. Smid, Fabian Stehn. 678-688 [doi]
• Hollow HeapsThomas Dueholm Hansen, Haim Kaplan, Robert Endre Tarjan, Uri Zwick. 689-700 [doi]
• Linear-Time List Recovery of High-Rate Expander CodesBrett Hemenway, Mary Wootters. 701-712 [doi]
• Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic TimeMonika Henzinger, Sebastian Krinninger, Veronika Loitzenbauer. 713-724 [doi]
• Improved Algorithms for Decremental Single-Source Reachability on Directed GraphsMonika Henzinger, Sebastian Krinninger, Danupon Nanongkai. 725-736 [doi]
• Weighted Reordering Buffer Improved via Variants of Knapsack Covering InequalitiesSungjin Im, Benjamin Moseley. 737-748 [doi]
• Local ReductionsHamid Jahanjou, Eric Miles, Emanuele Viola. 749-760 [doi]
• Query Complexity in ExpectationJedrzej Kaniewski, Troy Lee, Ronald de Wolf. 761-772 [doi]
• Near-Linear Query Complexity for Graph InferenceSampath Kannan, Claire Mathieu, Hang Zhou 0001. 773-784 [doi]
• A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point SetMarek Karpinski, Andrzej Lingas, Dzmitry Sledneu. 785-796 [doi]
• Finding a Path in Group-Labeled Graphs with Two Labels ForbiddenYasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi. 797-809 [doi]
• Lower Bounds for Sums of Powers of Low Degree UnivariatesNeeraj Kayal, Pascal Koiran, Timothée Pecatte, Chandan Saha. 810-821 [doi]
• Approximating CSPs Using LP RelaxationSubhash Khot, Rishi Saket. 822-833 [doi]
• Comparator Circuits over Finite Bounded PosetsBalagopal Komarath, Jayalal Sarma, K. S. Sunil. 834-845 [doi]
• Algebraic Properties of Valued Constraint Satisfaction ProblemMarcin Kozik, Joanna Ochremiak. 846-858 [doi]
• Towards Understanding the Smoothed Approximation Ratio of the 2-Opt HeuristicMarvin Künnemann, Bodo Manthey. 859-871 [doi]
• On the Hardest Problem Formulations for the 0/1 0 / 1 Lasserre HierarchyAdam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli. 872-885 [doi]
• Replacing Mark Bits with Randomness in Fibonacci HeapsJerry Li, John Peebles. 886-897 [doi]
• A PTAS for the Weighted Unit Disk Cover ProblemJian Li, Yifei Jin. 898-909 [doi]
• Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic PointsLingxiao Huang, Jian Li. 910-921 [doi]
• Deterministic Truncation of Linear MatroidsDaniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh. 922-934 [doi]
• Linear Time Parameterized Algorithms for Subset Feedback Vertex SetDaniel Lokshtanov, M. S. Ramanujan, Saket Saurabh. 935-946 [doi]
• An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear DomainsJoseph S. B. Mitchell, Valentin Polishchuk, Mikko Sysikaski, Haitao Wang. 947-959 [doi]
• Amplification of One-Way Information Complexity via Codes and Noise SensitivityMarco Molinaro, David P. Woodruff, Grigory Yaroslavtsev. 960-972 [doi]
• A (2+\epsilon ) ( 2 + ϵ ) -Approximation Algorithm for the Storage Allocation ProblemTobias Mömke, Andreas Wiese. 973-984 [doi]
• Shortest Reconfiguration Paths in the Solution Space of Boolean FormulasAmer E. Mouawad, Naomi Nishimura, Vinayak Pathak, Venkatesh Raman. 985-996 [doi]
• Computing the Fréchet Distance Between Polygons with HolesAmir Nayyeri, Anastasios Sidiropoulos. 997-1009 [doi]
• An Improved Private Mechanism for Small DatabasesAleksandar Nikolov. 1010-1021 [doi]
• Binary Pattern Tile Set Synthesis Is NP-hardLila Kari, Steffen Kopecki, Pierre-Étienne Meunier, Matthew J. Patitz, Shinnosuke Seki. 1022-1034 [doi]
• Near-Optimal Upper Bound on Fourier Dimension of Boolean Functions in Terms of Fourier SparsitySwagato Sanyal. 1035-1045 [doi]
• Condensed UnpredictabilityMaciej Skorski, Alexander Golovnev, Krzysztof Pietrzak. 1046-1057 [doi]
• Sherali-Adams Relaxations for Valued CSPsJohan Thapper, Stanislav Zivny. 1058-1069 [doi]
• Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy AlgorithmYajun Wang, Sam Chiu-wai Wong. 1070-1081 [doi]
• The Simultaneous Communication of Disjointness with Applications to Data StreamsOmri Weinstein, David P. Woodruff. 1082-1093 [doi]
• An Improved Combinatorial Algorithm for Boolean Matrix MultiplicationHuacheng Yu. 1094-1105 [doi]