ICALP: Accepted Papers

Track A

Faster Mixing for Triangulations: Breaking the Cheeger Barrier via Transport Flows. Vedat Levi Alev, Daniel Frishberg, Michalis Sarantis, Prasad Tetali.
From Worst-Case Hardness of NP to Quantum Cryptography via Quantum Indistinguishability Obfuscation. Tomoyuki Morimae, Yuki Shirakawa, Takashi Yamakawa.
Hardness, Tractability and Density Thresholds of finite Pinwheel Scheduling Variants. Sotiris Kanellopoulos, Giorgos Mitropoulos, Christos Pergaminelis, Thanos Tolias.
Inapproximability of Counting Permutation Patterns. Michal Opler.
Solving Random Planted CSPs below the n^{k/2} Threshold. Arpon Basu, Jun-Ting Hsieh, Andrew D. Lin, Peter Manohar.
Plane Strong Connectivity Augmentation. Stéphane Bessy, Daniel Goncalves, Amadeus Reinald, Dimitrios M. Thilikos.
Faster and Simpler Greedy Algorithm for k-Median and k-Means. Max Dupre la Tour, David Saulpic.
On (In)approximability of MaxMin Independent Set Reconfiguration. Hung Hoang, Naoto Ohsaka, Rin Saito, Yuma Tamura.
Classification of Local Optimization Problems in Directed Cycles. Thomas Boudier, Fabian Kuhn, Augusto Modanese, Ronja Stimpert, Jukka Suomela.
An Algorithmic Proof of Kruskal’s Tensor Uniqueness Theorem. Vishwas Bhargava, Shiri Sivan, Leonard J. Schulman.
Better Diameter Bounds for Efficient Shortcuts and a Structural Criterion for Constructiveness. Bernhard Haeupler, Antti Röyskö, Zhijun Zhang, Antti Roeyskoe.
Online Matroid Embeddings. Andrés Cristi, Paul Duetting, Robert Kleinberg, Renato Paes Leme, Neel Patel.
Competitive Bundle Trading. Yossi Azar, Niv Buchbinder, Roie Levin, Or Vardi.
Online Monotone Metric Embeddings. Christian Coester, Yichen Huang.
Dynamic Rank, Basis, and Matching. Jan van den Brand, Vishal Kumar, Daniel Zhang.
Optimal $k$-Secretary with Logarithmic Memory. Mingda Qiao, Wei Zhang.
Quickly excluding an annotated planar graph. Maximilian Gorsky, Evangelos Protopapas, Sebastian Wiederrecht.
Counting perfect matchings and Hamiltonian cycles faster. Baitian Li.
Hiding, Shuffling, and Cycle Finding: Quantum Algorithms on Edge Lists. Amin Shiraz Gilani, Daochen Wang, Pei Wu, Xingyu Zhou.
Mutable Batch Arguments and Applications. Rishab Goyal.
Tight Bounds for Feedback Vertex Set Parameterized by Clique-width. Narek Bojikian, Stefan Kratsch.
Faster algorithms for k-Orthogonal Vectors in low dimension. Anita Dürr, Evangelos Kipouridis, Michael Lampis, Karol Wegrzycki.
Online Steiner Forest with Recourse. Yaowei Long, Sepideh Mahabadi, Sherry Sarkar, Jakub Tarnawski.
The Compressed Oracle is a Worthy (Multiplicative) Adversary. Sebastian Zur, Stacey Jeffery.
Preprocessed 3SUM for Unknown Universes with Subquadratic Space. Yael Kirkpatrick, John Kuszmaul, Surya Mathialagan, Virginia Vassilevska Williams.
On the (Classical and Quantum) Fine-Grained Complexity of Approximate CVP and Max-Cut. Jeremy Ahrens Huang, Young Kun Ko, Chunhao Wang, Jeremy Huang.
Touring a Sequence of Orthogonal Polygons. Katrin Casel, Sándor Kisfaludi-Bak, Linda Kleist, Jeroen S.K. Lamme, Eunjin Oh, Yanheng Wang.
The SBM has OGP for MOD. Sreekalyani Shankar Bhamidi, David Gamarnik, Remco van der Hofstad, Nelly Litvak, Pawel Pralat, Fiona Skerman, Yasmin Tousinejad.
Sample-Optimal Quantum Estimators for Pure-State Trace Distance and Fidelity via Samplizer. Qisheng Wang, Zhicheng Zhang.
Symmetric Parameterised Holants on Hypergraphs: Towards a Classification for Parameterised VCSPs. Panagiotis Aivasiliotis, Andreas Göbel, Marc Roth.
Colorful Minors. Evangelos Protopapas, Dimitrios Thilikos, Sebastian Wiederrecht.
Streaming Complexity Separations for Dense and Sparse Graphs. Yang P. Liu, Hoai-An Nguyen, Noah G. Singer, David P. Woodruff.
VP, VNP and Algebraic Branching Programs over Min-Plus Semirings. Balagopal Komarath, Harshil Mittal, Jayalal Sarma.
Multiplicative error set system sparsification: A simpler proof via chain length contraction. Joshua Brakensiek, Venkatesan Guruswami, Aaron Putterman.
Optimal Parallel Basis Finding in Graphic and Related Matroids. Sanjeev Khanna, Aaron Putterman, Junkai Song.
On Tight FPT Time Approximation Algorithms for k-Clustering Problems. Han Dai, Shi Li, Sijin Peng.
On the Pure Quantum Polynomial Hierarchy and Quantified Hamiltonian Complexity. Sabee Grewal, Dorian Rudolph.
Coordinated Motion Planning is FPT on Discretized Simple Polygons. Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj.
Constant Rate Isometric Embeddings of Hamming Metric into Edit Metric. Sudatta Bhattacharya, Sanjana Dey, Elazar Goldenberg, Mursalin Habib, Bernhard Haeupler, Karthik C. Karthik C. S., Michal Koucký, Karthik C. S..
Multiplicative assignment with upgrades. Alexander Armbruster, Lars Rohwedder, Stefan Weltge, Andreas Wiese, Ruilong Zhang.
Tight Bounds for Low-Error Frequency Moment Estimation and the Power of Multiple Passes. Naomi Green-Maimon, Or Zamir.
Chasing Small Sets Optimally Against Adaptive Adversaries. Christian Coester, Alexa Tudose.
Thin Trees for Near Minimum Cuts. Nathan Klein, Neil Olver, Zi Song Yeoh.
A Faster Directed Single-Source Shortest Path Algorithm. Ran Duan, Xiao Mao, Xinkai Shu, Longhui Yin.
Quantum Advantage in Proof Systems without Entanglement. Krishna Agaram, Nick Spooner, Yuxi Zheng.
Towards Tight Robust Coresets for $k$-Medians Clustering. Lingxiao Huang, Zhenyu Jiang, Yi Li, Xuan Wu.
Tight Bounds for Sampling q-Colorings via Coupling from the Past. Tianxing Ding, Hongyang Liu, Yitong Yin, Can Zhou.
Visibility Queries in Simple Polygons. Sujoy Bhore, Chih-Hung Liu, Anurag Murty Naredla, Yakov Nekrich, Eunjin Oh, André van Renssen, Frank Staals, Haitao Wang, Jie Xue.
Fast decremental tree sums in forests. Benjamin Aram Berendsohn, Marek Sokołowski.
Unique Decoding of Reed–Solomon and Related Codes for Semi-Adversarial Errors. Joshua Brakensiek, Yeyuan Chen, Manik Dhar, Zihan Zhang.
Fully Dynamic Spectral and Cut Sparsifiers for Directed Graphs. Yibin Zhao.
New Convex Programming Technique for Nash Social Welfare and Scheduling. Yuda Feng, Weijiang Hu, Shi Li.
Clustering Permutations under the Ulam Metric: A Parameterized Complexity Study. Tian Bai, Fedor Fomin, Petr A. Golovach, Yash Hiren More, Simon Wietheger.
Pinning on Tight Cuts: Improved Algorithm and Bounds for Unsplittable Multicommodity Flows in Outerplanar Graphs. David Aleman Espinosa, Niklas Schlomberg.
Submodular Maximization over a Matroid k-Intersection: Multiplicative Improvement over Greedy. Moran Feldman, Justin Ward.
Alternation Depth of Threshold Decision Lists. Vladimir Podolskii, Morgan Prior.
Combinatorial Perpetual Scheduling. Mirabel Mendoza, Arturo Merino, Mads Anker Nielsen, Kevin Schewior.
Expander Decomposition with Almost Optimal Overhead. Nikhil Bansal, Arun Jambulapati, Thatchaphol Saranurak.
Incremental (k, z)-Clustering on Graphs. Antonis Skarlatos, Sebastian Forster, Emilio Cruciani.
Improved Time-Space Tradeoffs for 3SUM-Indexing. Itai Dinur, Alexander Golovnev.
Partially-Dynamic Maximum Flow in Dense Graphs. Egor Kravchenko, maximilian probst.
Learning-Augmented Online Algorithms for Nonclairvoyant Joint Replenishment Problem with Deadlines. Michael Dinitz, Jeremy Fineman, Seeun William Umboh.
Optimal Sequential Flows. Hugo Gimbert, Corto Mascle, Patrick Totzke.
Undirected Replacement Paths: Dual Fault Reduces to Single Source. Jakob Nogler, Virginia Vassilevska Williams.
Back in the Saddle: Toward Parallel Approximate Minimum-Cost Flow. Aurelio Sulser, Rasmus Kyng.
Average-Case Hardness of Binary-Encoded Clique in Proof and Communication Complexity. Susanna F. de Rezende, David Engström, Yassine Ghannane, Duri Andrea Janett, Artur Riazanov.
Computing Flows in Subquadratic Space. Jan van den Brand, Zhao Song, Albert Weng.
Odd-Cycle-Packing-treewidth: On the Maximum Independent Set problem in odd-minor-free graph classes. Mujin Choi, Maximilian Gorsky, Gunwoo Kim, Caleb McFarland, Sebastian Wiederrecht.
Mind the Gap? Not for SVP Hardness under ETH!. Divesh Aggarwal, Rishav Gupta, Aditya Morolia, Chuanqi Zhang.
Optimal Inapproximability of Generalized Linear Equations over a Finite Group. Yezhou Zhang, Amey Bhangale.
Node-Weighted Triangles: Faster and Simpler. Shyan Akmal, Nick Fischer.
Permutation Patterns in Streams. Benjamin Aram Berendsohn.
Online Metric TSP: Beyond the $\sqrt{n}$ Barrier. Yossi Azar, Debmalya Panigrahi, Or Vardi.
A linear bound for the size of the finite terminal assembly of a directed non-cooperative tile assembly system. Damien Regnault, Sergiu Ivanov.
Randomized $k$-server in polynomial time. Christian Coester, Romain Cosson.
Well-quasi-ordering Eulerian Digraphs: Bounded Carving Width. Dario Giuliano Cavallaro, Stephan Kreutzer, Ken-ichi Kawarabayashi.
Color Fault-Tolerant Distance Preservers: ~{O}ptimal Size in Conditionally ~{O}ptimal Time. Merav Parter, Asaf Petruschka.
Tight Regret Bounds for Fixed-Price Bilateral Trade. Houshuang Chen, Yaonan Jin, Pinyan Lu, Chihao Zhang.
Quantum Multi-Level Estimation of Functionals of Discrete Distributions. Kean Chen, Minbo Gao, Tongyang Li, Qisheng Wang, Xinzhao Wang.
Witness-Sensitive Detection of Induced Diamonds. Keren Censor-Hillel, Tomer Even, Nathan Wallheimer, Virginia Vassilevska Williams.
A fine-grained dichotomy for the center problem on Gromov hyperbolic graphs. Guillaume Ducoffe.
Incremental k-lowest planes and planar k-nearest neighbor with optimal query time. John Iacono, Yakov Nekrich, Martin P. Seybold.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems. Lin Chen, Tingwei Hu, Yuchen Mao, Yong Chen, Lili Mei, An Zhang, Guangting Chen, Guochuan Zhang.
White-Box Adversarial Streaming Lower Bounds beyond Two-Party Communication. Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena, Zhijun Zhang.
Relative-error unateness testing. Xi Chen, Diptaksho Palit, Kabir Peshawaria, William Pires, Rocco A. Servedio, Yiding Zhang.
How hard is it to verify a classical shadow?. Georgios Karaiskos, Dorian Rudolph, Johannes Jakob Meyer, Jens Eisert, Sevag Gharibian.
Sampling Colorings with Fixed Color Class Sizes. Aiya Kuchukova, Will Perkins, Xavier Povill.
Dynamic Set Cover with Worst-Case Recourse. Shay Solomon, Amitai Uzrad.
A Quantum Time-Space Tradeoff for Directed st-Connectivity. Stacey Jeffery, Galina Pass.
Tight Algorithm and Hardness for Submodular Linear Ordering. Roy Schwartz, Evan Abboud.
On the Complexity of the Matching Problem of Regular Expressions with Backreferences. Soh Kumabe, Yuya Uezato.
Faster Weak Expander Decompositions and Approximate Max Flow. Henry Fleischmann, Jason Li, George Z. Li.
A Constant-Factor Approximation for Continuous Dynamic Time Warping in 2D. Jan Erik Swiadek, Sampson Wong, Kevin Buchin, Maike Buchin.
Equivalence Between Coding and Complexity Lower Bounds. Jinqiao Hu, Zhenjian Lu, Igor C. Oliveira.
On randomness complexity of 1-private protocols. Samuel Dittmer, Rafail Ostrovsky.
The Dirichlet Mechanism for rounding with strong negative correlation, with applications. David Harris, George Z. Li, Nitya Raju, Renata Valieva, George Li.
Hardness and Approximation for Coloring Digraphs. Parinya Chalermsook, Pierre Charbit, Samuel Coulomb, Harmender Gahlawat, Felix Klingelhoefer, Alantha Newman, Chaoliang Tang.
A Scalable and Unified Framework to Weighted Rank Aggregation. Amir Carmel, Debarati Das, Tien Long Nguyen.
Faster Deterministic Streaming Vertex Coloring. Hongyi Chen, Shiri Chechik, Tianyi Zhang.
Edge-weighted Online Stochastic Matching Under Jaillet-Lu LP. Shuyi Yan.
Faster Algorithms for $(2k-1)$-Stretch Distance Oracles. Avi Kadria, Liam Roditty.
Strict hierarchy for quantum channel certification to unitary. Kean Chen, Qisheng Wang, Zhicheng Zhang.
Algorithms for Finite Group Epimorphism Testing. Joshua A. Grochow, Pranjal Srivastava, Dhara Thakkar.
New Diameter Approximations via Distance Oracle Techniques. Yael Kirkpatrick, Liam Roditty, Richard Qi, Virginia Vassilevska Williams.
Online Correlation Clustering: Simultaneously Optimizing All $\ell_p$-Norms. Sami Davies, Benjamin Moseley, Heather Newman.
The price of homogeneity is polynomial. Maximilian Gorsky, Michał Seweryn, Sebastian Wiederrecht.
An $\widetilde{O}(n^{3/7})$ Round Parallel Algorithm for Matroid Bases. Sanjeev Khanna, Aaron Putterman, Junkai Song.
Improved Tree Sparsifiers in Near-Linear Time. Daniel Agassy, Dani Dorfman, Haim Kaplan.
Proving Algebraic Independence in Zero-Knowledge. Michael A. Forbes, Andrei Staicu.
Nearly-linear Time Algorithms for Sparse Submodular Function Minimization. Andrei Graur, Haotian Jiang, Aaron Sidford.
The Impossibility of Simultaneous Time and I/O Optimality for The Planar Maxima and Convex Hull Problems. Peyman Afshani, Gerth Stølting Brodal, Nodari Sitchinava.
A Lifting Theorem for Hybrid Classical-Quantum Communication Complexity. Xudong Wu, Guangxu Yang, Penghui Yao.
Suffix Random Access via Function Inversion: A Key for Asymmetric Streaming String Algorithms. Panagiotis Charalampopoulos, Taha El Ghazi, Jonas Ellert, Pawel Gawrychowski, Tatiana Starikovskaya.
Going Beyond Twin-width? CSPs with Unbounded Domain and Few Variables. Peter Jonsson, Victor Lagerkvist, Jorke de Vlas, Magnus Wahlstrom.
Compressing Suffix Trees by Path Decompositions. Nicola Prezza, Travis Gagie, Ruben Becker, Davide Cenzato, Ragnar Groot Koerkamp, Sung-Hwan Kim, Giovanni Manzini.
Near-Optimal Dynamic Data Structures for Maximum Depth and Klee’s Measure of Boxes. Sujoy Bhore, Subhash Suri, Jie Xue, Xiongxin Yang, Jiumu Zhu.
Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees. Narek Bojikian, Alexander Firbas, Robert Ganian, Hung Hoang, Krisztina Szilagyi.
Learning Multinomial Logits in O(n log n) time. Flavio Chierichetti, Mirko Giacchini, Ravi Kumar, Silvio Lattanzi, Alessandro Panconesi, Erasmo Tani, Andrew Tomkins.
Simpler and Improved Replacement Path Coverings. Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Martin Schirneck.
Canonical labelling of random regular graphs. Mikhail Isaev, Tamás Makai, Brendan McKay, Paweł Prałat, Jane Tan, Maksim Zhukovskii.
Computing the (k+2)-Edge-Connected Components in k-Edge-Connected Digraphs in Subquadratic Time. Loukas Georgiadis, Evangelos Kipouridis, Evangelos Kosinas, Charis Papadopoulos, Nikos Parotsidis.
Tracing AG Codes: Toward Meeting the Gilbert–Varshamov Bound. Noam Goldgraber, Gil Cohen, Dean Doron, Tomer Manket.
Static to Dynamic Correlation Clustering. Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, David Rasmussen Lolck, Alantha Newman, Mikkel Thorup, Lukas Vogl, Shuyi Yan, Hanwen Zhang.
Charting the Diameter Computation Landscape on Intersection Graphs in the Plane. Timothy M. Chan, Hsien-Chih Chang, Jie Gao, Sándor Kisfaludi-Bak, Hung Le, Da Wei Zheng.
Beyond Brooks: $(\Delta-1)$-Coloring in Semi-Streaming. Maxime Flin, Magnus M. Halldorsson.
Fully Dynamic Algorithms for Coloring Triangle-Free Graphs. Sepehr Assadi, Helia Yazdanyar.
Sublinear-query relative-error testing of halfspaces. Xi Chen, Anindya De, Yizhi Huang, Shivam Nadimpalli, Rocco A. Servedio, Tianqi Yang.
Online Preemptive Matching Revisited. Peter Kiss, Mohammad Sharifi.
When Does Sparsity Help for $k$-Independent Set in Hypergraphs and Other Boolean CSPs?. Timo Fritsch, Marvin Künnemann, Mirza Redžić, Julian Stieß.
Deterministic Monotone Min-Plus Product and Convolution. Ce Jin, Jaewoo Park, Barna Saha, Yinzhan Xu.
The quantum smooth label cover problem is undecidable. Eric Culf, Kieran Mastel, Connor Paddock, Taro Spirig.
Testing Sparse Functions over the Reals. Vipul Arora, Arnab Bhattacharyya, Philips George John, Sayantan Sen.
Kronecker scaling of tensors with applications to arithmetic circuits and algorithms. Andreas Björklund, Petteri Kaski, Tomohiro Koana, Jesper Nederlof.
A 4.509-Approximation Algorithm for Generalized Min Sum Set Cover. Yezhou Zhang, Amey Bhangale.
On the Average-Case Performance of Greedy for Maximum Coverage. Jason Chatzitheodorou, Eric Balkanski, Flore Sentenac.
Unsplittable Transshipments. Srinwanti Debgupta, Sarah Morell, Martin Skutella.
Near Linear Time Approximation Schemes for Clustering of Partially Doubling Metrics. Anne Driemel, Jan Höckendorff, Ioannis Psarros, Christian Sohler, Di Yue.
The Expiration Streaming Model: Diameter, $k$-Center, Counting, Sampling, and Friends. Lotte Blank, Sergio Cabello, MohammadTaghi Hajiaghayi, Robert Krauthgamer, Sepideh Mahabadi, André Nusser, Jeff Phillips, Jonas Sauer.
Random Access in Grammar-Compressed Strings: Optimal Trade-Offs in Almost All Parameter Regimes. Anouk Duyster, Tomasz Kociumaka.
Connectivity Oracle Under Vertex Failures by Shortcutting Unbreakable Decomposition. Xizhe Li, Yaowei Long, David Pidugu, Thatchaphol Saranurak, Benyu Wang.
Lower bounds on pure dynamic programming for connectivity problems on graphs of bounded path-width. Kacper Kluk, Jesper Nederlof.
Geometric Optimization Parameterized by Piercing Complexity. Aritra Banik, Rajiv Raman, Saurabh Ray.
Spiky Rank and Its Applications to Rigidity and Circuits. Lianna Hambardzumyan, Konstantin Myasnikov, Artur Riazanov, Morgan Shirley, Adi Shraibman.
Connected Dominating Sets in Triangulations. Prosenjit Bose, Vida Dujmovic, Hussein Houdrouge, Pat Morin, Saeed Odak.
On the hardness of recognizing graphs of small mim-width and its variants. Manuel Lafond, Max Dupre la Tour, Ndiame Ndiaye.
Recursive Jump Operators and Optimal Proof Systems. Fabian Egidy.
A 9/4-approximation for directed feedback vertex sets in quasi-transitive digraphs. Ebrahim Ghorbani, Matthias Mnich.
Partial Derivative Complexity of a Product of Linearly Independent Quadratics. Nir Shalmon, Amir Shpilka.
Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth. Vikrant Ashvinkumar, Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak.
Pseudo-Deterministic Quantum Algorithms. Jiawei Li, Hugo Aaronson, Tom Gur.
Local Samplers for Product Distributions. Jordan Horacsek, Chin Ho Lee, Igor Shinkar, Emanuele Viola, Renfei Zhou.
A Tight Double-Exponential Lower Bound for High-Multiplicity Bin Packing. Klaus Jansen, Felix Ohnesorge, Lis Pirotton.
Fast Shortest Path in Graphs With Sparse Signed Tree Models and Applications. Édouard Bonnet, Colin Geniet, Eun Jung Kim, Sungmin Moon.
Local Computation Algorithms for (Minimum) Spanning Trees on Expander Graphs. Pan Peng, Yuyang Wang.
Determining the Outerthickness of Graphs Is NP-Hard. Pin-Hsian Lee, Te-Cheng Liu, Meng-Tsung Tsai.
Persistence Meets Resistance: Doubling Down on Hardness. Benedikt Kolbe, Tim Mayr.

Track B

Approximating 1-in-3 SAT by linearly ordered hypergraph 3-colouring is NP-hard. Andrei Krokhin, Danny Vagnozzi.
Persistent Amortized Analysis, Operationally. Anton Lorenzen.
From Sets to Points: Simplifying MSO Interpretations over Countable Chains. Alexander Rabinovich.
Unambiguisability and Register Minimisation of Min-Plus Models. Shaull Almagor, Guy Arbel, Sarai Sheinvald.
Everybody wants to be a seed: arbitrary single-tile seeds in the abstract Tile Assembly Model. Florent Becker, Marie de Sainte Marie.
Optimally Controlling a Random Population. Hugo Gimbert, Corto Mascle, Patrick Totzke.
A Diagrammatic Axiomatisation of Behavioural Distance of Nondeterministic Processes. Wojciech Różowski, Robin Piedeleu, Alexandra Silva, Fabio Zanasi.
Gray Codes with Constant Delay and Constant Auxiliary Space. Antoine Amarilli, Claire David, Nadime Francis, Victor Marsault, Mikael Monet, Yann Strozecki.
The complexity of finding coset-generating polymorphisms and the promise metaproblem. Manuel Bodirsky, Armin Weiß.
Revisiting Finiteness of Matrix Monoids. Rida Ait El Manssour, Roland Guttenberg, Nathan Lhote, Mahsa Shirmohammadi, James Worrell.
Out-of-Order Membership to Regular Languages. Antoine Amarilli, Sebastien Labbe, Charles Paperman.
Expregular functions. Thomas Colcombet, Nathan Lhote, Pierre Ohlmann.
Deciding DFA-Primality is NP-Hard. Daniel Alexander Spenner.
The Network Satisfaction Problem for Relation Algebras with at most 4 Atoms. Manuel Bodirsky, Moritz Jahn, Matěj Konečný, Simon Knäuer, Paul Winkler.
Loop Termination and Generalized Collatz Sequences. Mishel Carelli.
The role of counting quantifiers in laminar set systems. Rutger Campbell, Noleen Köhler.
Optimal Lower Bounds for Symmetric Modular Circuits. Benedikt Pago.
Shuffles of Context-Free Languages along Regular Trajectories. Corentin Barloy, Michaël Cadilhac, Kyle Ockerlund.
Population Protocols over Ordered Agents. Michael Blondin, Michaël Cadilhac, Benjamin Courchesne, Lucie Guillou, Corto Mascle, Isa Vialard.
On the Constructive Dimension Spectrum of Polynomials. Prajval Koul, Satyadev Nandakumar.
Stone duality proofs for colorless distributed computability theorems. Cameron Calk, Emmanuel Godard.
Automata on S-adic Words. Valérie Berthé, Toghrul Karimov, Mihir Vahanwala.
Recursion and proof theoretical characterizations of small circuit classes with modulo counting via discrete differential equations. Melissa Antonelli, Arnaud Durand, Rui Li.
Transducing Linear Decompositions of Tournaments. Colin Geniet, Fatemeh Ghasemi, Mamadou Moustapha Kanté.
Multi-Environment MDPs with Prior and Universal Semantics. Benjamin Bordais, Jean-Francois Raskin.
Witnesses for Fixpoint Games on Lattices. Barbara König, Karla Messing.
The Complexity of Bisimilarity and Model Checking in Finitary Diagrams. Sagnik Dutta, Markus Bläser, Samuel Okyay.
Asymptotic Hausdorff and Language Similarity. Dana Fisman, Gal Meirom.
Edit Distance of Finite-Valued Transducers. Prince Mathew, Saina Sunny.
Scoped MSO, Register Automata, and Expressions: Equivalence over Data Words. Radosław Piórkowski.
Infinite-state games with energy objectives beyond counters. Irmak Saglam, Georg Zetzsche.
Transducers on compressed strings. Mikolaj Bojanczyk, Markus Lohrey.
Preservation Theorems in Semiring Semantics. Sophie Brinke, Anuj Dawar, Erich Grädel, Benedikt Pago.
Set Automata and Limits of Decidability of Two-Variable Logic on Data Words. Shibashis Guha, Amaldev Manuel, S P Rishal.
Exploring VASS Parameterised by Geometric Dimension. Wojciech Czerwiński, Roland Guttenberg, Łukasz Orlikowski, Henry Sinclair-Banks, Yangluo Zheng.