Abstract is missing.
- Non-Clairvoyant Precedence Constrained SchedulingNaveen Garg 0001, Anupam Gupta, Amit Kumar 0001, Sahil Singla 0001. [doi]
- 3 for Linear Orders with Monotone Binary RelationsMarie Fortin. [doi]
- Deterministic Combinatorial Replacement Paths and Distance Sensitivity OraclesNoga Alon, Shiri Chechik, Sarel Cohen. [doi]
- Approximately Good and Modern Matchings (Invited Talk)Ola Svensson. [doi]
- Scheduling to Approximate Minimization Objectives on Identical MachinesBenjamin Moseley. [doi]
- Quantum SDP Solvers: Large Speed-Ups, Optimality, and Applications to Quantum LearningFernando G. S. L. Brandão, Amir Kalev, Tongyang Li, Cedric Yen-Yu Lin, Krysta M. Svore, Xiaodi Wu. [doi]
- Network Investment Games with Wardrop FollowersDaniel Schmand, Marc Schröder 0002, Alexander Skopalik. [doi]
- Query-To-Communication Lifting for BPP Using Inner ProductArkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir, Toniann Pitassi. [doi]
- The Complexity of Approximating the Matching Polynomial in the Complex PlaneIvona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic. [doi]
- Faster Algorithms for All Pairs Non-Decreasing Paths ProblemRan Duan, Ce Jin, Hongxun Wu. [doi]
- Tight Approximation Algorithms for Bichromatic Graph Diameter and Related ProblemsMina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas 0001, Nicole Wein. [doi]
- Faster Algorithms for All-Pairs Bounded Min-CutsAmir Abboud, Loukas Georgiadis, Giuseppe F. Italiano, Robert Krauthgamer, Nikos Parotsidis, Ohad Trabelsi, Przemyslaw Uznanski, Daniel Wolleb-Graf. [doi]
- The Hairy Ball Problem is PPAD-CompletePaul W. Goldberg, Alexandros Hollender. [doi]
- Randomness and Intractability in Kolmogorov ComplexityIgor Carboni Oliveira. [doi]
- Capacitated Dynamic Programming: Faster Knapsack and Graph AlgorithmsKyriakos Axiotis, Christos Tzamos. [doi]
- Lower Bounds for Multiplication via Network CodingPeyman Afshani, Casper Benjamin Freksen, Lior Kamma, Kasper Green Larsen. [doi]
- Construction of Optimal Locally Recoverable Codes and Connection with HypergraphChaoping Xing, Chen Yuan. [doi]
- Unique End of Potential LineJohn Fearnley, Spencer Gordon, Ruta Mehta, Rahul Savani. [doi]
- Unlabeled Sample Compression Schemes and Corner Peelings for Ample and Maximum ClassesJérémie Chalopin, Victor Chepoi, Shay Moran, Manfred K. Warmuth. [doi]
- Dichotomy for Symmetric Boolean PCSPsMiron Ficak, Marcin Kozik, Miroslav Olsák, Szymon Stankiewicz. [doi]
- Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product DistributionsYuval Filmus, Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami, David Zuckerman. [doi]
- Independent Sets in Vertex-Arrival StreamsGraham Cormode, Jacques Dark, Christian Konrad. [doi]
- Amplification with One NP Oracle QueryThomas Watson 0001. [doi]
- How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs?Eleni C. Akrida, George B. Mertzios, Sotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis, Viktor Zamaraev. [doi]
- On the Fixed-Parameter Tractability of Capacitated ClusteringVincent Cohen-Addad, Jason Li. [doi]
- Tight Bounds for Online Weighted Tree AugmentationJoseph (Seffi) Naor, Seeun William Umboh, David P. Williamson. [doi]
- Büchi Objectives in Countable MDPsStefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke. [doi]
- A Kleene Theorem for Nominal AutomataPaul Brunet, Alexandra Silva 0001. [doi]
- Dynamic Ordered Sets with Approximate Queries, Approximate Heaps and Soft HeapsMikkel Thorup, Or Zamir, Uri Zwick. [doi]
- Satisfiability Thresholds for Regular Occupation ProblemsKonstantinos Panagiotou, Matija Pasch. [doi]
- Monadic Decomposability of Regular RelationsPablo Barceló, Chih-Duo Hong, Xuan Bach Le, Anthony W. Lin, Reino Niskanen. [doi]
- Boundedness of Conjunctive Regular Path QueriesPablo Barceló, Diego Figueira, Miguel Romero 0001. [doi]
- Robust Communication-Optimal Distributed Clustering AlgorithmsPranjal Awasthi, Ainesh Bakshi, Maria-Florina Balcan, Colin White, David P. Woodruff. [doi]
- Exploration of High-Dimensional Grids by Finite AutomataStefan Dobrev, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov. [doi]
- A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded GenusMartin Grohe, Sandra Kiefer. [doi]
- Minimizing GFG Transition-Based AutomataBader Abu Radi, Orna Kupferman. [doi]
- Distributed Reconfiguration of Maximal Independent SetsKeren Censor Hillel, Mikaël Rabie. [doi]
- Fine-Grained Reductions and Quantum Speedups for Dynamic ProgrammingAmir Abboud. [doi]
- Information-Theoretic and Algorithmic Thresholds for Group TestingAmin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Philipp Loick. [doi]
- Near-Linear Time Algorithm for n-fold ILPs via Color CodingKlaus Jansen, Alexandra Lassota, Lars Rohwedder. [doi]
- On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence ObstructionsJulian Dörfler, Christian Ikenmeyer, Greta Panova. [doi]
- Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate EvaluationWilliam Kuszmaul. [doi]
- Improvements in Quantum SDP-Solving with ApplicationsJoran van Apeldoorn, András Gilyén. [doi]
- Beating Fredman-Komlós for Perfect k-HashingVenkatesan Guruswami, Andrii Riazanov. [doi]
- The Satisfiability Threshold for Non-Uniform Random 2-SATTobias Friedrich 0001, Ralf Rothenberger. [doi]
- Sign-Rank Can Increase Under IntersectionMark Bun, Nikhil S. Mande, Justin Thaler. [doi]
- The Norms of Graph SpannersEden Chlamtác, Michael Dinitz, Thomas Robinson. [doi]
- Multi-Round Cooperative Search Games with Multiple PlayersAmos Korman, Yoav Rodeh. [doi]
- Decomposition of Map Graphs with ApplicationsFedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi. [doi]
- Maintaining Perfect Matchings at Low CostJannik Matuschke, Ulrike Schmidt-Kraepelin, José Verschae. [doi]
- Computing Optimal Epsilon-Nets Is as Easy as Finding an Unhit SetNabil H. Mustafa. [doi]
- Towards Nearly-Linear Time Algorithms for Submodular Maximization with a Matroid ConstraintAlina Ene, Huy L. Nguyen. [doi]
- A Simple Gap-Producing Reduction for the Parameterized Set Cover ProblemBingkai Lin. [doi]
- Short Proofs Are Hard to FindIan Mertz, Toniann Pitassi, Yuanhao Wei. [doi]
- A Simple Protocol for Verifiable Delegation of Quantum Computation in One RoundAlex B. Grilo. [doi]
- Two Moves per Time Step Make a DifferenceThomas Erlebach, Frank Kammer, Kelin Luo, Andrej Sajenko, Jakob T. Spooner. [doi]
- Optimal Strategies for Patrolling FencesBernhard Haeupler, Fabian Kuhn, Anders Martinsson, Kalina Petrova, Pascal Pfister. [doi]
- Matroid Coflow SchedulingSungjin Im, Benjamin Moseley, Kirk Pruhs, Manish Purohit. [doi]
- Polynomially Ambiguous Probabilistic Automata on Restricted LanguagesPaul C. Bell. [doi]
- String-to-String Interpretations With Polynomial-Size OutputMikolaj Bojanczyk, Sandra Kiefer, Nathan Lhote. [doi]
- Equivalence of Finite-Valued Streaming String Transducers Is DecidableAnca Muscholl, Gabriele Puppis. [doi]
- Block Edit Errors with Transpositions: Deterministic Document Exchange Protocols and Almost Optimal Binary CodesKuan Cheng, Zhengzhong Jin, Xin Li 0006, Ke Wu. [doi]
- From Normal Functors to Logarithmic Space QueriesLê Thành Dung Nguyên, Pierre Pradic. [doi]
- Counting Answers to Existential QuestionsHolger Dell, Marc Roth, Philip Wellnitz. [doi]
- 0[p] Lower Bounds Against MCSP via the Coin ProblemAlexander Golovnev, Rahul Ilango, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, Avishay Tal. [doi]
- Sum-Of-Squares Bounds via Boolean Function AnalysisAdam Kurpisz. [doi]
- On the Complexity of String Matching for GraphsMassimo Equi, Roberto Grossi, Veli Mäkinen, Alexandru I. Tomescu. [doi]
- Completeness of Graphical Languages for Mixed States Quantum MechanicsTitouan Carette, Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart. [doi]
- Two New Results About Quantum Exact LearningSrinivasan Arunachalam, Sourav Chakraborty 0001, Troy Lee, Manaswi Paraashar, Ronald de Wolf. [doi]
- Termination of Linear Loops over the IntegersMehran Hosseini, Joël Ouaknine, James Worrell 0001. [doi]
- Lower Bounds on Balancing Sets and Depth-2 Threshold CircuitsPavel Hrubes, Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao, Amir Yehudayoff. [doi]
- Covert Computation in Self-Assembled CircuitsAngel A. Cantu, Austin Luchsinger, Robert T. Schweller, Tim Wylie. [doi]
- On Approximate Pure Nash Equilibria in Weighted Congestion Games with Polynomial LatenciesIoannis Caragiannis, Angelo Fanelli 0001. [doi]
- Varieties of Data LanguagesHenning Urbat, Stefan Milius. [doi]
- Sequentiality of String-to-Context TransducersPierre-Alain Reynier, Didier Villevalois. [doi]
- Optimal Short Cycle Decomposition in Almost Linear TimeMerav Parter, Eylon Yogev. [doi]
- Automata Learning and Galois Connections (Invited Talk)Frits W. Vaandrager. [doi]
- A Mahler's Theorem for Word FunctionsJean-Éric Pin, Christophe Reutenauer. [doi]
- A Type System for Interactive JSON Schema Inference (Extended Abstract)Mohamed Amine Baazizi, Dario Colazzo, Giorgio Ghelli, Carlo Sartiani. [doi]
- Stochastic Online Metric MatchingAnupam Gupta, Guru Guruganesh, Binghui Peng, David Wajc. [doi]
- nAkanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Prafullkumar Tale. [doi]
- Testing the Complexity of a Valued CSP LanguageVladimir Kolmogorov. [doi]
- The Minimum Cost Query Problem on Matroids with Uncertainty AreasArturo I. Merino, José A. Soto. [doi]
- Local Search Breaks 1.75 for Graph BalancingKlaus Jansen, Lars Rohwedder. [doi]
- Faster Approximation Algorithms for Computing Shortest Cycles on Weighted GraphsGuillaume Ducoffe . [doi]
- Restricted Max-Min Allocation: Approximation and Integrality GapSiu-Wing Cheng, Yuchen Mao. [doi]
- Log Diameter Rounds Algorithms for 2-Vertex and 2-Edge ConnectivityAlexandr Andoni, Clifford Stein, Peilin Zhong. [doi]
- Stochastic Graph ExplorationAris Anagnostopoulos, Ilan Reuven Cohen, Stefano Leonardi, Jakub Lacki. [doi]
- The Arboricity Captures the Complexity of Sampling EdgesTalya Eden, Dana Ron, Will Rosenbaum. [doi]
- Querying a Matrix Through Matrix-Vector ProductsXiaoming Sun, David P. Woodruff, Guang Yang, Jialin Zhang. [doi]
- Noidy Conmunixatipn: On the Convergence of the Averaging Population ProtocolFrederik Mallmann-Trenn, Yannic Maus, Dominik Pajak. [doi]
- Algorithmically Efficient Syntactic Characterization of Possibility DomainsJosep Díaz, Lefteris M. Kirousis, Sofia Kokonezi, John Livieratos. [doi]
- Geometric MulticutMikkel Abrahamsen, Panos Giannopoulos, Maarten Löffler, Günter Rote. [doi]
- Exploiting Hopsets: Improved Distance Oracles for Graphs of Constant Highway Dimension and BeyondSiddharth Gupta 0002, Adrian Kosowski, Laurent Viennot. [doi]
- Dismantlability, Connectedness, and Mixing in Relational StructuresRaimundo Briceño, Andrei A. Bulatov, Víctor Dalmau, Benoît Larose. [doi]
- Covering Metric Spaces by Few TreesYair Bartal, Nova Fandina, Ofer Neiman. [doi]
- On Reachability Problems for Low-Dimensional Matrix SemigroupsThomas Colcombet, Joël Ouaknine, Pavel Semukhin, James Worrell 0001. [doi]
- Differential Logical Relations, Part I: The Simply-Typed CaseUgo Dal Lago, Francesco Gavazzo, Akira Yoshimizu. [doi]
- Covering Vectors by Spaces in Perturbed Graphic Matroids and Their DualsFedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi. [doi]
- Even Faster Elastic-Degenerate String Matching via Fast Matrix MultiplicationGiulia Bernardini 0001, Pawel Gawrychowski, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone. [doi]
- Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality NumberKatrin Casel, Joel D. Day, Pamela Fleischmann, Tomasz Kociumaka, Florin Manea, Markus L. Schmid. [doi]
- Algorithms and Hardness for Diameter in Dynamic GraphsBertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, Nicole Wein. [doi]
- The Parametric Complexity of Lossy Counter MachinesSylvain Schmitz. [doi]
- Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam TheoremArgyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis. [doi]
- Constructions of Maximally Recoverable Local Reconstruction Codes via Function FieldsVenkatesan Guruswami, Lingfei Jin, Chaoping Xing. [doi]
- On the Complexity of Local Graph TransformationsChristian Scheideler, Alexander Setzer. [doi]
- An Improved FPTAS for 0-1 KnapsackCe Jin. [doi]
- When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear TimeSepehr Assadi, Shay Solomon. [doi]
- Determinant Equivalence Test over Finite Fields and over QAnkit Garg, Nikhil Gupta, Neeraj Kayal, Chandan Saha 0001. [doi]
- A Composition Theorem for Randomized Query Complexity via Max-Conflict ComplexityDmitry Gavinsky, Troy Lee, Miklos Santha, Swagato Sanyal. [doi]
- On Adaptive Algorithms for Maximum MatchingFalko Hegerfeld, Stefan Kratsch. [doi]
- Symmetry and Similarity (Invited Talk)Martin Grohe. [doi]
- Auction Design under Interdependent Values (Invited Talk)Michal Feldman. [doi]
- Determinization of Büchi Automata: Unifying the Approaches of Safra and Muller-SchuppChristof Löding, Anton Pirogov. [doi]
- Finding Tutte Paths in Linear TimeTherese C. Biedl, Philipp Kindermann. [doi]
- A Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff GamesDani Dorfman, Haim Kaplan, Uri Zwick. [doi]
- Separating k-Player from t-Player One-Way Communication, with Applications to Data StreamsDavid P. Woodruff, Guang Yang. [doi]
- Approximate Counting of k-Paths: Deterministic and in Polynomial SpaceAndreas Björklund, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi. [doi]
- Approximations of Isomorphism and Logics with Linear-Algebraic OperatorsAnuj Dawar, Erich Grädel, Wied Pakusa. [doi]
- Approximation Algorithms for Min-Distance ProblemsMina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas 0001, Nicole Wein, Yinzhan Xu, Yuancheng Yu. [doi]
- Computing Permanents and Counting Hamiltonian Cycles by Listing Dissimilar VectorsAndreas Björklund, Ryan Williams 0001. [doi]
- Complexity-Theoretic Limitations on Blind Delegated Quantum ComputationScott Aaronson, Alexandru Cojocaru, Alexandru Gheorghiu, Elham Kashefi. [doi]
- Solutions Sets to Systems of Equations in Hyperbolic Groups Are EDT0L in PSPACELaura Ciobanu, Murray Elder. [doi]
- The Power of Block-Encoded Matrix Powers: Improved Regression Techniques via Faster Hamiltonian SimulationShantanav Chakraborty, András Gilyén, Stacey Jeffery. [doi]
- Towards Optimal Depth Reductions for Syntactically Multilinear CircuitsMrinal Kumar 0001, Rafael Mendes de Oliveira, Ramprasad Saptharishi. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- Two Party Distribution Testing: Communication and SecurityAlexandr Andoni, Tal Malkin, Negev Shekel Nosatzki. [doi]
- Automatic Semigroups vs Automaton SemigroupsMatthieu Picantin. [doi]
- A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack ConstraintAlina Ene, Huy L. Nguyen. [doi]
- Quantum Chebyshev's Inequality and ApplicationsYassine Hamoudi, Frédéric Magniez. [doi]
- Circuit Lower Bounds for MCSP from Local Pseudorandom GeneratorsMahdi Cheraghchi, Valentine Kabanets, Zhenjian Lu, Dimitrios Myrisiotis. [doi]
- Reachability for Branching Concurrent Stochastic GamesKousha Etessami, Emanuel Martinov, Alistair Stewart, Mihalis Yannakakis. [doi]
- Energy Consumption of Group Search on a LineJurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende. [doi]
- Solving Systems of Polynomial Equations over GF(2) by a Parity-Counting Self-ReductionAndreas Björklund, Petteri Kaski, Ryan Williams 0001. [doi]
- Fixed Point Computation Problems and Facets of Complexity (Invited Talk)Mihalis Yannakakis. [doi]
- Temporal Cliques Admit Sparse SpannersArnaud Casteigts, Joseph G. Peters, Jason Schoeters. [doi]
- Retracting Graphs to CyclesSamuel Haney, Mehraneh Liaee, Bruce M. Maggs, Debmalya Panigrahi, Rajmohan Rajaraman, Ravi Sundaram. [doi]
- On the Complexity of Value IterationNikhil Balaji, Stefan Kiefer, Petr Novotný 0001, Guillermo A. Pérez, Mahsa Shirmohammadi. [doi]
- On All Things Star-FreeThomas Place, Marc Zeitoun. [doi]
- A Tight Approximation for Submodular Maximization with Mixed Packing and Covering ConstraintsEyal Mizrachi, Roy Schwartz, Joachim Spoerhase, Sumedha Uniyal. [doi]
- Tight FPT Approximations for k-Median and k-MeansVincent Cohen-Addad, Anupam Gupta, Amit Kumar 0001, Euiwoong Lee, Jason Li. [doi]
- Estimating the Frequency of a Clustered SignalXue Chen, Eric Price. [doi]
- Polynomial Anonymous Dynamic Distributed Computing Without a Unique LeaderDariusz R. Kowalski, Miguel A. Mosteiro. [doi]
- Distributed Detection of Cliques in Dynamic NetworksMatthias Bonne, Keren Censor Hillel. [doi]
- From Nondeterministic to Multi-Head Deterministic Finite-State TransducersMartin Raszyk, David A. Basin, Dmitriy Traytel. [doi]
- Deterministic Leader Election in Programmable MatterYuval Emek, Shay Kutten, Ron Lavi, William K. Moses Jr.. [doi]
- Scalable and Jointly Differentially Private PackingZhiyi Huang 0002, Xue Zhu. [doi]
- Toward a Dichotomy for Approximation of H-ColoringAkbar Rafiey, Arash Rafiey, Thiago Santos. [doi]
- Periodic Bandits and Wireless Network SelectionShunhao Oh, Anuja Meetoo-Appavoo, Seth Gilbert. [doi]
- Random Walks on Dynamic Graphs: Mixing Times, Hitting Times, and Return ProbabilitiesThomas Sauerwald, Luca Zanetti. [doi]
- Optimal Regular Expressions for PermutationsAntonio Molina Lovett, Jeffrey Shallit. [doi]
- Distributed Arboricity-Dependent Graph Coloring via All-to-All CommunicationMohsen Ghaffari, Ali Sayyadi. [doi]