Table of Contents

• Sporadic Solutions to Zero-One Exclusion TasksEli Gafni, Maurice Herlihy. 1-10 [doi]
• Verifying and Synthesizing Software with Recursive Functions - (Invited Contribution)Viktor Kuncak. 11-25 [doi]
• Weak ParityScott Aaronson, Andris Ambainis, Kaspars Balodis, Mohammad Bavarian. 26-38 [doi]
• Consequences of Faster Alignment of SequencesAmir Abboud, Virginia Vassilevska Williams, Oren Weimann. 39-51 [doi]
• Distance Labels with Optimal Local StretchIttai Abraham, Shiri Chechik. 52-63 [doi]
• Time-Expanded PackingsDavid Adjiashvili, Sandro Bosio, Robert Weismantel, Rico Zenklusen. 64-76 [doi]
• Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAMPeyman Afshani, Timothy M. Chan, Konstantinos Tsakalidis. 77-88 [doi]
• The Tropical Shadow-Vertex Algorithm Solves Mean Payoff Games in Polynomial Time on AverageXavier Allamigeon, Pascal Benchimol, Stéphane Gaubert. 89-100 [doi]
• Tighter Relations between Sensitivity and Other Complexity MeasuresAndris Ambainis, Mohammad Bavarian, Yihan Gao, Jieming Mao, Xiaoming Sun, Song Zuo. 101-113 [doi]
• On Hardness of Jumbled IndexingAmihood Amir, Timothy M. Chan, Moshe Lewenstein, Noa Lewenstein. 114-125 [doi]
• Morphing Planar Graph Drawings OptimallyPatrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli. 126-137 [doi]
• Incremental Algorithm for Maintaining DFS Tree for Undirected GraphsSurender Baswana, Shahbaz Khan. 138-149 [doi]
• On the Role of Shared Randomness in Simultaneous CommunicationMohammad Bavarian, Dmitry Gavinsky, Tsuyoshi Ito. 150-162 [doi]
• Short PCPs with Projection QueriesEli Ben-Sasson, Emanuele Viola. 163-173 [doi]
• Star Partitions of Perfect GraphsRené van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger. 174-185 [doi]
• Coordination Mechanisms for Selfish Routing over Time on a TreeSayan Bhattacharya, Janardhan Kulkarni, Vahab S. Mirrokni. 186-197 [doi]
• On Area-Optimal Planar Graph DrawingsTherese C. Biedl. 198-210 [doi]
• Shortest Two Disjoint Paths in Polynomial TimeAndreas Björklund, Thore Husfeldt. 211-222 [doi]
• Listing TrianglesAndreas Björklund, Rasmus Pagh, Virginia Vassilevska Williams, Uri Zwick. 223-234 [doi]
• On DNF Approximators for Monotone Boolean FunctionsEric Blais, Johan Håstad, Rocco A. Servedio, Li-Yang Tan. 235-246 [doi]
• Internal DLA: Efficient Simulation of a Physical Growth Model - (Extended Abstract)Karl Bringmann, Fabian Kuhn, Konstantinos Panagiotou, Ueli Peter, Henning Thomas. 247-258 [doi]
• Lower Bounds for Approximate LDCsJop Briët, Zeev Dvir, Guangda Hu, Shubhangi Saraf. 259-270 [doi]
• Holographic Algorithms Beyond MatchgatesJin-yi Cai, Heng Guo, Tyson Williams. 271-282 [doi]
• Testing Probability Distributions Underlying Aggregated DataClément L. Canonne, Ronitt Rubinfeld. 283-295 [doi]
• Parallel Repetition of Entangled Games with Exponential Decay via the Superposed Information CostAndré Chailloux, Giannicola Scarpa. 296-307 [doi]
• The Bose-Hubbard Model is QMA-completeAndrew M. Childs, David Gosset, Zak Webb. 308-319 [doi]
• Characterization of Binary Constraint System GamesRichard Cleve, Rajat Mittal. 320-331 [doi]
• Fast Algorithms for Constructing Maximum Entropy Summary TreesRichard Cole, Howard J. Karloff. 332-343 [doi]
• Thorp Shuffling, Butterflies, and Non-Markovian CouplingsArtur Czumaj, Berthold Vöcking. 344-355 [doi]
• Dynamic Complexity of Directed Reachability and Other ProblemsSamir Datta, William Hesse, Raghav Kulkarni. 356-367 [doi]
• One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal TileErik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Matthew J. Patitz, Robert T. Schweller, Andrew Winslow, Damien Woods. 368-379 [doi]
• Canadians Should Travel RandomlyErik D. Demaine, Yamming Huang, Chung-Shou Liao, Kunihiko Sadakane. 380-391 [doi]
• Efficiency Guarantees in Auctions with BudgetsShahar Dobzinski, Renato Paes Leme. 392-404 [doi]
• Parameterized Complexity of Bandwidth on TreesMarkus Sortland Dregi, Daniel Lokshtanov. 405-416 [doi]
• Testing Equivalence of Polynomials under ShiftsZeev Dvir, Rafael Mendes de Oliveira, Amir Shpilka. 417-428 [doi]
• Optimal Analysis of Best Fit Bin PackingGyörgy Dósa, Jirí Sgall. 429-441 [doi]
• Light SpannersMichael Elkin, Ofer Neiman, Shay Solomon. 442-452 [doi]
• Semi-Streaming Set Cover - (Extended Abstract)Yuval Emek, Adi Rosén. 453-464 [doi]
• Online Stochastic Reordering Buffer SchedulingHossein Esfandiari, MohammadTaghi Hajiaghayi, Mohammad Reza Khani, Vahid Liaghat, Hamid Mahini, Harald Räcke. 465-476 [doi]
• Demand Queries with PreprocessingUriel Feige, Shlomo Jozeph. 477-488 [doi]
• Algorithmic Aspects of Regular Graph Covers with Applications to Planar GraphsJirí Fiala, Pavel Klavík, Jan Kratochvíl, Roman Nedela. 489-501 [doi]
• Public vs Private Coin in Bounded-Round InformationMark Braverman, Ankit Garg. 502-513 [doi]
• En Route to the Log-Rank Conjecture: New Reductions and Equivalent FormulationsDmitry Gavinsky, Shachar Lovett. 514-524 [doi]
• Improved Submatrix Maximum Queries in Monge MatricesPawel Gawrychowski, Shay Mozes, Oren Weimann. 525-537 [doi]
• For-All Sparse Recovery in Near-Optimal TimeAnna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss. 538-550 [doi]
• Families with Infants: A General Approach to Solve Hard Partition ProblemsAlexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin. 551-562 [doi]
• Changing Bases: Multistage Optimization for Matroids and MatchingsAnupam Gupta, Kunal Talwar, Udi Wieder. 563-575 [doi]
• Near-Optimal Online Algorithms for Prize-Collecting Steiner ProblemsMohammadTaghi Hajiaghayi, Vahid Liaghat, Debmalya Panigrahi. 576-587 [doi]
• Nearly Linear-Time Model-Based Compressive SensingChinmay Hegde, Piotr Indyk, Ludwig Schmidt. 588-599 [doi]
• Breaking the PPSZ Barrier for Unique 3-SATTimon Hertli. 600-611 [doi]
• Privately Solving Linear ProgramsJustin Hsu, Aaron Roth, Tim Roughgarden, Jonathan Ullman. 612-624 [doi]
• How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost FunctionsWiebke Höhn, Julián Mestre, Andreas Wiese. 625-636 [doi]
• Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do NotJohn Iacono, Özgür Özkan. 637-649 [doi]
• Partial Garbling Schemes and Their ApplicationsYuval Ishai, Hoeteck Wee. 650-662 [doi]
• On the Complexity of Trial and Error for Constraint Satisfaction ProblemsGábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram. 663-675 [doi]
• Information Theoretical CryptogenographySune K. Jakobsen. 676-688 [doi]
• The Complexity of Somewhat Approximation Resistant PredicatesSubhash Khot, Madhur Tulsiani, Pratik Worah. 689-700 [doi]
• Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle BoundGillat Kol, Shay Moran, Amir Shpilka, Amir Yehudayoff. 701-712 [doi]
• Distance Oracles for Time-Dependent NetworksSpyros C. Kontogiannis, Christos D. Zaroliagis. 713-725 [doi]
• Efficient Indexing of Necklaces and Irreducible Polynomials over Finite FieldsSwastik Kopparty, Mrinal Kumar, Michael Saks. 726-737 [doi]
• Coloring Relatives of Interval Overlap Graphs via On-line GamesTomasz Krawczyk, Bartosz Walczak. 738-750 [doi]
• Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic CircuitsMrinal Kumar, Shubhangi Saraf. 751-762 [doi]
• Testing Forest-Isomorphism in the Adjacency List ModelMitsuru Kusumoto, Yuichi Yoshida. 763-774 [doi]
• Parameterized Approximation Schemes Using Graph WidthsMichael Lampis. 775-786 [doi]
• FPTAS for Weighted Fibonacci Gates and Its ApplicationsPinyan Lu, Menghui Wang, Chihao Zhang. 787-799 [doi]
• Parameterized Algorithms to Preserve ConnectivityManu Basavaraju, Fedor V. Fomin, Petr A. Golovach, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh. 800-811 [doi]
• Nonuniform Graph Partitioning with Unrelated WeightsKonstantin Makarychev, Yury Makarychev. 812-822 [doi]
• Precedence-Constrained Scheduling of Malleable Jobs with PreemptionKonstantin Makarychev, Debmalya Panigrahi. 823-834 [doi]
• Unbounded Entanglement Can Be Needed to Achieve the Optimal Success ProbabilityLaura Mancinska, Thomas Vidick. 835-846 [doi]
• QCSP on Semicomplete DigraphsPetar Dapic, Petar Markovic, Barnaby Martin. 847-858 [doi]
• Fast Pseudorandomness for Independence and Load Balancing - (Extended Abstract)Raghu Meka, Omer Reingold, Guy N. Rothblum, Ron D. Rothblum. 859-870 [doi]
• Determining Majority in Networks with Local Interactions and Very Small Local MemoryGeorge B. Mertzios, Sotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis. 871-882 [doi]
• Lower Bounds for Oblivious Subspace EmbeddingsJelani Nelson, Huy L. Nguyên. 883-894 [doi]
• On Input Indistinguishable Proof SystemsRafail Ostrovsky, Giuseppe Persiano, Ivan Visconti. 895-906 [doi]
• Secure Computation Using Leaky TokensManoj Prabhakaran, Amit Sahai, Akshay Wadia. 907-918 [doi]
• An Improved Interactive Streaming Algorithm for the Distinct Elements ProblemHartmut Klauck, Ved Prakash. 919-930 [doi]
• A Faster Parameterized Algorithm for TreedepthFelix Reidl, Peter Rossmanith, Fernando Sanchez Villaamil, Somnath Sikdar. 931-942 [doi]
• Pseudorandom Graphs in Data StructuresOmer Reingold, Ron D. Rothblum, Udi Wieder. 943-954 [doi]
• Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic ApplicationsEli Ben-Sasson, Noga Ron-Zewi, Madhur Tulsiani, Julia Wolf. 955-966 [doi]
• The Mondshein SequenceJens M. Schmidt. 967-978 [doi]
• Balanced Allocations: A Simple Proof for the Heavily Loaded CaseKunal Talwar, Udi Wieder. 979-990 [doi]
• Close to Uniform Prime Number Generation with Fewer Random BitsPierre-Alain Fouque, Mehdi Tibouchi. 991-1002 [doi]
• Optimal Strong Parallel Repetition for Projection Games on Low Threshold Rank GraphsMadhur Tulsiani, John Wright, Yuan Zhou. 1003-1014 [doi]
• Sparser Random 3-SAT Refutation Algorithms and the Interpolation Problem - (Extended Abstract)Iddo Tzameret. 1015-1026 [doi]
• On Learning, Lower Bounds and (un)Keeping PromisesIlya Volkovich. 1027-1038 [doi]
• Certificates in Data StructuresYaoyu Wang, Yitong Yin. 1039-1050 [doi]
• Optimal Query Complexity for Estimating the Trace of a MatrixKarl Wimmer, Yi Wu, Peng Zhang. 1051-1062 [doi]
• Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance OraclesChristian Wulff-Nilsen. 1063-1074 [doi]
• Spatial Mixing of Coloring Random GraphsYitong Yin. 1075-1086 [doi]