Table of Contents

• Covering Vectors by Spaces: Regular MatroidsFedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh. [doi]
• Efficient Quantum Algorithms for Simulating Lindblad EvolutionRichard Cleve, Chunhao Wang. [doi]
• On the Bit Complexity of Sum-of-Squares ProofsPrasad Raghavendra, Benjamin Weitz. [doi]
• Relaxations of Graph IsomorphismLaura Mancinska, David E. Roberson, Robert Sámal, Simone Severini, Antonios Varvitsiotis. [doi]
• Which Classes of Origin Graphs Are Generated by TransducersMikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle. [doi]
• Dynamic Parameterized Problems and AlgorithmsJosh Alman, Matthias Mnich, Virginia Vassilevska Williams. [doi]
• Automata-Based Stream ProcessingRajeev Alur, Konstantinos Mamouras, Caleb Stanford. [doi]
• Dynamic Beats Fixed: On Phase-Based Algorithms for File MigrationMarcin Bienkowski, Jaroslaw Byrka, Marcin Mucha. [doi]
• On the Metric-Based Approximate Minimization of Markov ChainsGiovanni Bacci, Giorgio Bacci, Kim G. Larsen, Radu Mardare. [doi]
• Multiple Source Dual Fault Tolerant BFS TreesManoj Gupta, Shahbaz Khan. [doi]
• Bipartite Perfect Matching in Pseudo-Deterministic NCShafi Goldwasser, Ofer Grossman. [doi]
• A QPTAS for the General Scheduling Problem with Identical Release DatesAntonios Antoniadis, Ruben Hoeksma, Julie Meißner, José Verschae, Andreas Wiese. [doi]
• On the Complexity of Quantified Integer ProgrammingDmitry Chistikov, Christoph Haase. [doi]
• On the Value of Penalties in Time-Inconsistent PlanningSusanne Albers, Dennis Kraft. [doi]
• k-Distinct In- and Out-Branchings in DigraphsGregory Gutin, Felix Reidl, Magnus Wahlström. [doi]
• Stochastic Control via Entropy CompressionDimitris Achlioptas, Fotis Iliopoulos, Nikos Vlassis. [doi]
• Word Equations in Nondeterministic Linear SpaceArtur Jez. [doi]
• Subspace-Invariant AC^0 FormulasBenjamin Rossman. [doi]
• Online Market IntermediationYiannis Giannakopoulos, Elias Koutsoupias, Philip Lazos. [doi]
• Directed Hamiltonicity and Out-Branchings via Generalized LaplaciansAndreas Björklund, Petteri Kaski, Ioannis Koutis. [doi]
• Tight Lower Bounds for Multiplicative Weights Algorithmic FamiliesNick Gravin, Yuval Peres, Balasubramanian Sivan. [doi]
• Opinion Dynamics in Networks: Convergence, Stability and Lack of ExplosionTung Mai, Ioannis Panageas, Vijay V. Vazirani. [doi]
• Decremental Data Structures for Connectivity and Dominators in Directed GraphsLoukas Georgiadis, Thomas Dueholm Hansen, Giuseppe F. Italiano, Sebastian Krinninger, Nikos Parotsidis. [doi]
• Efficient Approximations for the Online Dispersion ProblemJing Chen 0001, Bo Li, Yingkai Li. [doi]
• Interactive Oracle Proofs with Constant Rate and Query ComplexityEli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Michael Riabzev, Nicholas Spooner. [doi]
• Tighter Hard Instances for PPSZPavel Pudlák, Dominik Scheder, Navid Talebanfard. [doi]
• Definability by Horn Formulas and Linear Time on Cellular AutomataNicolas Bacquey, Etienne Grandjean, Frédéric Olive. [doi]
• Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph ClassesArchontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna. [doi]
• Approximating Language Edit Distance Beyond Fast Matrix Multiplication: Ultralinear Grammars Are Where Parsing Becomes Hard!Rajesh Jayaram, Barna Saha. [doi]
• Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete DigraphsFlorian Barbero, Christophe Paul, Michal Pilipczuk. [doi]
• Linear-Time Kernelization for Feedback Vertex SetYoichi Iwata. [doi]
• A Birthday Repetition Theorem and Complexity of Approximating Dense CSPsPasin Manurangsi, Prasad Raghavendra. [doi]
• String Inference from Longest-Common-Prefix ArrayJuha Kärkkäinen, Marcin Piatkowski, Simon J. Puglisi. [doi]
• Proof Complexity Meets AlgebraAlbert Atserias, Joanna Ochremiak. [doi]
• Rerouting Flows When Links FailJannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo. [doi]
• Reusable Garbled Deterministic Finite Automata from Learning With ErrorsShweta Agrawal, Ishaan Preet Singh. [doi]
• Further Approximations for Demand Matching: Matroid Constraints and Minor-Closed GraphsSara Ahmadian, Zachary Friggstad. [doi]
• The Power of Shared Randomness in Uncertain CommunicationBadih Ghazi, Madhu Sudan. [doi]
• A Polynomial-Time Randomized Reduction from Tournament Isomorphism to Tournament AsymmetryPascal Schweitzer. [doi]
• A Universal Ordinary Differential EquationOlivier Bournez, Amaury Pouly. [doi]
• Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic ProtocolsRan Cohen, Sandro Coretti, Juan A. Garay, Vassilis Zikas. [doi]
• Online Covering with Sum of $ell_q$-Norm ObjectivesViswanath Nagarajan, Xiangkun Shen. [doi]
• The Infinite Server ProblemChristian Coester, Elias Koutsoupias, Philip Lazos. [doi]
• Embeddings of Schatten Norms with Applications to Data StreamsYi Li 0002, David P. Woodruff. [doi]
• Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed GraphsKarl Bringmann, Thomas Dueholm Hansen, Sebastian Krinninger. [doi]
• Orbit-Finite Sets and Their Algorithms (Invited Talk)Mikolaj Bojanczyk. [doi]
• Sensitivity Conjecture and Log-Rank Conjecture for Functions with Small Alternating NumbersChengyu Lin, Shengyu Zhang. [doi]
• Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic BarrierOmer Gold, Micha Sharir. [doi]
• Honest Signaling in Zero-Sum Games Is Hard, and Lying Is Even HarderAviad Rubinstein. [doi]
• The Polytope-Collision ProblemShaull Almagor, Joël Ouaknine, James Worrell. [doi]
• Edge-OrdersLena Schlipf, Jens M. Schmidt. [doi]
• Simple Greedy Algorithms for Fundamental Multidimensional Graph ProblemsVittorio Bilò, Ioannis Caragiannis, Angelo Fanelli 0001, Michele Flammini, Gianpiero Monaco. [doi]
• Improved Algorithms for MST and Metric-TSP InterdictionAndré Linhares, Chaitanya Swamy. [doi]
• Continuity and Rational FunctionsMichaël Cadilhac, Olivier Carton, Charles Paperman. [doi]
• Pumping Lemma for Higher-order LanguagesKazuyuki Asada, Naoki Kobayashi 0001. [doi]
• An Efficient Algorithm to Decide Periodicity of b-Recognisable Sets Using MSDF ConventionBernard Boigelot, Isabelle Mainz, Victor Marsault, Michel Rigo. [doi]
• Additive Spanners and Distance Oracles in Quadratic TimeMathias Bæk Tejs Knudsen. [doi]
• On Finding the Jaccard CenterMarc Bury, Chris Schwiegelshohn. [doi]
• Packing Cycles Faster Than Erdos-PosaDaniel Lokshtanov, Amer E. Mouawad, Saket Saurabh, Meirav Zehavi. [doi]
• Improved Hardness for Cut, Interdiction, and Firefighter ProblemsEuiwoong Lee. [doi]
• Deleting and Testing Forbidden Patterns in Multi-Dimensional ArraysOmri Ben-Eliezer, Simon Korman, Daniel Reichman 0001. [doi]
• Fast Regression with an $ell_infty$ GuaranteeEric Price, Zhao Song, David P. Woodruff. [doi]
• Inapproximability of Maximum Edge Biclique, Maximum Balanced Biclique and Minimum k-Cut from the Small Set Expansion HypothesisPasin Manurangsi. [doi]
• Selling Complementary Goods: Dynamics, Efficiency and RevenueMoshe Babaioff, Liad Blumrosen, Noam Nisan. [doi]
• Testable Bounded Degree Graph Properties Are Random Order StreamableMorteza Monemizadeh, S. Muthukrishnan, Pan Peng, Christian Sohler. [doi]
• Synchronizability of Communicating Finite State Machines is not DecidableAlain Finkel, Étienne Lozes. [doi]
• The Dependent Doors Problem: An Investigation into Sequential Decisions without FeedbackAmos Korman, Yoav Rodeh. [doi]
• Inapproximability of the Independent Set Polynomial Below the Shearer ThresholdAndreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic. [doi]
• Expressiveness of Probabilistic Modal Logics, RevisitedNathanaël Fijalkow, Bartek Klin, Prakash Panangaden. [doi]
• Satisfiability and Model Checking for the Logic of Sub-Intervals under the Homogeneity AssumptionLaura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala. [doi]
• Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13Daniel Apon, Nico Döttling, Sanjam Garg, Pratyay Mukherjee. [doi]
• When the Optimum is also Blind: a New Perspective on Universal OptimizationMarek Adamczyk, Fabrizio Grandoni, Stefano Leonardi, Michal Wlodarczyk. [doi]
• Deterministic Graph Exploration with AdviceBarun Gorain, Andrzej Pelc. [doi]
• On Problems Equivalent to (min, +)-ConvolutionMarek Cygan, Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk. [doi]
• Conservative Extensions in Guarded and Two-Variable FragmentsJean Christoph Jung, Carsten Lutz, Mauricio Martel, Thomas Schneider 0002, Frank Wolter. [doi]
• Combinatorial Secretary Problems with Ordinal InformationMartin Hoefer, Bojana Kodric. [doi]
• Randomized Rumor Spreading RevisitedBenjamin Doerr, Anatolii Kostrygin. [doi]
• A Strategy for Dynamic Programs: Start over and Muddle ThroughSamir Datta, Anish Mukherjee 0001, Thomas Schwentick, Nils Vortmeier, Thomas Zeume. [doi]
• Preserving Distances in Very Faulty GraphsGreg Bodwin, Fabrizio Grandoni, Merav Parter, Virginia Vassilevska Williams. [doi]
• The Complexity of Holant Problems over Boolean Domain with Non-Negative WeightsJiabao Lin, Hanpin Wang. [doi]
• Solutions of Twisted Word Equations, EDT0L Languages, and Context-Free GroupsVolker Diekert, Murray Elder. [doi]
• A Circuit-Based Approach to Efficient EnumerationAntoine Amarilli, Pierre Bourhis, Louis Jachiet, Stefan Mengel. [doi]
• Admissiblity in Concurrent GamesNicolas Basset, Gilles Geeraerts, Jean-François Raskin, Ocan Sankur. [doi]
• A Tight Lower Bound for the Capture Time of the Cops and Robbers GameSebastian Brandt, Yuval Emek, Jara Uitto, Roger Wattenhofer. [doi]
• Threshold Constraints with Guarantees for Parity Objectives in Markov Decision ProcessesRaphaël Berthon, Mickael Randour, Jean-François Raskin. [doi]
• Testing Core Membership in Public Goods EconomiesGreg Bodwin. [doi]
• A Counterexample to Thiagarajan's Conjecture on Regular Event StructuresJérémie Chalopin, Victor Chepoi. [doi]
• On Fast Decoding of High-Dimensional Signals from One-Bit MeasurementsVasileios Nakos. [doi]
• Deterministic Partially Dynamic Single Source Shortest Paths in Weighted GraphsAaron Bernstein. [doi]
• Revenue Maximization in Stackelberg Pricing Games: Beyond the Combinatorial SettingToni Böhnlein, Stefan Kratsch, Oliver Schaudt. [doi]
• Asynchronous Distributed Automata: A Characterization of the Modal Mu-FragmentFabian Reiter. [doi]
• Characterizing Definability in Decidable Fixpoint LogicsMichael Benedikt, Pierre Bourhis, Michael Vanden Boom. [doi]
• On the Fine-Grained Complexity of One-Dimensional Dynamic ProgrammingMarvin Künnemann, Ramamohan Paturi, Stefan Schneider. [doi]
• Efficient Construction of Probabilistic Tree EmbeddingsGuy E. Blelloch, Yan Gu 0001, Yihan Sun. [doi]
• A (1+epsilon)-Approximation for Unsplittable Flow on a Path in Fixed-Parameter Running TimeAndreas Wiese. [doi]
• Sublinear Time Estimation of Degree Distribution Moments: The Degeneracy ConnectionTalya Eden, Dana Ron, C. Seshadhri. [doi]
• On the Transformation Capability of Feasible Mechanisms for Programmable MatterOthon Michail, George Skretas, Paul G. Spirakis. [doi]
• Randomized Load Balancing on Networks with Stochastic InputsLeran Cai, Thomas Sauerwald. [doi]
• Finding Detours is Fixed-Parameter TractableIvona Bezáková, Radu Curticapean, Holger Dell, Fedor V. Fomin. [doi]
• Conditional Lower Bounds for All-Pairs Max-FlowRobert Krauthgamer, Ohad Trabelsi. [doi]
• Approximation Strategies for Generalized Binary Search in Weighted TreesDariusz Dereniowski, Adrian Kosowski, Przemyslaw Uznanski, Mengchuan Zou. [doi]
• Universal Framework for Wireless Scheduling ProblemsEyjólfur Ingi Ásgeirsson, Magnús M. Halldórsson, Tigran Tonoyan. [doi]
• Reordering Buffer Management with a Logarithmic Guarantee in General Metric SpacesMatthias Kohler, Harald Räcke. [doi]
• On Reversible TransducersLuc Dartois, Paulin Fournier, Ismaël Jecker, Nathan Lhote. [doi]
• Stochastic k-Server: How Should Uber Work?Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Saeed Seddighin. [doi]
• Quantum Automata Cannot Detect Biased Coins, Even in the LimitGuy Kindler, Ryan O'Donnell. [doi]
• Emptiness of Zero Automata Is DecidableMikolaj Bojanczyk, Hugo Gimbert, Edon Kelmendi. [doi]
• Sublinear Random Access Generators for Preferential Attachment GraphsGuy Even, Reut Levi, Moti Medina, Adi Rosén. [doi]
• Distributed Monitoring of Network Properties: The Power of Hybrid NetworksRobert Gmyr, Kristian Hinnenthal, Christian Scheideler, Christian Sohler. [doi]
• Approximate Bounded IndistinguishabilityAndrej Bogdanov, Christopher Williamson. [doi]
• Approximating Partition Functions of Bounded-Degree Boolean Counting Constraint Satisfaction ProblemsAndreas Galanis, Leslie Ann Goldberg, Kuan Yang. [doi]
• Front Matter, Table of Contents, Preface, Organization, List of Authors [doi]
• The Parameterized Complexity of Positional GamesÉdouard Bonnet, Serge Gaspers, Antonin Lambilliotte, Stefan Rümmele, Abdallah Saffidine. [doi]
• Efficient Algorithms for Graph-Related Problems in Computer-Aided Verification (Invited Talk)Monika Henzinger. [doi]
• *-Liftings for Differential PrivacyGilles Barthe, Thomas Espitau, Justin Hsu, Tetsuya Sato, Pierre-Yves Strub. [doi]
• Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk GraphsFedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi. [doi]
• Randomized Communication vs. Partition NumberMika Göös, T. S. Jayram, Toniann Pitassi, Thomas Watson 0001. [doi]
• Models and Termination of Proof Reduction in the lambda Pi-Calculus Modulo TheoryGilles Dowek. [doi]
• Polynomial-Time Rademacher Theorem, Porosity and RandomnessAlex Galicki. [doi]
• Correlated Rounding of Multiple Uniform Matroids and Multi-Label ClassificationShahar Chen, Dotan Di Castro, Zohar S. Karnin, Liane Lewin-Eytan, Joseph (Seffi) Naor, Roy Schwartz. [doi]
• Bisimulation Metrics for Weighted AutomataBorja Balle, Pascale Gourdeau, Prakash Panangaden. [doi]
• Neighborhood Complexity and Kernelization for Nowhere Dense Classes of GraphsKord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz. [doi]
• Local Computation Algorithms (Invited Talk)Ronitt Rubinfeld. [doi]
• Non-Uniform Attacks Against PseudoentropyKrzysztof Pietrzak, Maciej Skorski. [doi]
• Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension OneDiego Figueira, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki, Grégoire Sutre. [doi]
• Separation of AC^0[oplus] Formulas and CircuitsBenjamin Rossman, Srikanth Srinivasan. [doi]
• Streaming Communication ProtocolsLucas Boczkowski, Iordanis Kerenidis, Frédéric Magniez. [doi]
• Fast and Powerful Hashing Using Tabulation (Invited Talk)Mikkel Thorup. [doi]
• Saving Critical Nodes with Firefighters is FPTJayesh Choudhari, Anirban Dasgupta, Neeldhara Misra, M. S. Ramanujan. [doi]
• Subspace Designs Based on Algebraic Function FieldsVenkatesan Guruswami, Chaoping Xing, Chen Yuan. [doi]
• Regular Separability of Parikh AutomataLorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman. [doi]
• A New Holant Dichotomy Inspired by Quantum ComputationMiriam Backens. [doi]
• Controlled Quantum AmplificationCatalin Dohotaru, Peter Høyer. [doi]
• All-Pairs 2-Reachability in O(n^w log n) TimeLoukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Nikos Parotsidis, Przemyslaw Uznanski. [doi]
• Exact Algorithms via Multivariate SubroutinesSerge Gaspers, Edward J. Lee. [doi]
• A Linear Lower Bound for Incrementing a Space-Optimal Integer Representation in the Bit-Probe ModelMikhail Raskin. [doi]
• General Bounds for Incremental MaximizationAaron Bernstein, Yann Disser, Martin Groß. [doi]
• Near-Optimal Induced Universal Graphs for Bounded Degree GraphsMikkel Abrahamsen, Stephen Alstrup, Stephen Holm, Mathias Bæk Tejs Knudsen, Morten Stöckel. [doi]
• An Efficient Strongly Connected Components Algorithm in the Fault Tolerant ModelSurender Baswana, Keerti Choudhary, Liam Roditty. [doi]
• Optimal Unateness Testers for Real-Valued Functions: Adaptivity HelpsRoksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, C. Seshadhri. [doi]
• Near-Optimal Closeness Testing of Discrete Histogram DistributionsIlias Diakonikolas, Daniel M. Kane, Vladimir Nikishkin. [doi]
• Hardness of Computing and Approximating Predicates and Functions with Leaderless Population ProtocolsAmanda Belleville, David Doty, David Soloveichik. [doi]