| 2025 | Syntactic Effectful Realizability in Higher-Order Logic. | Liron Cohen, Ariel Grunfeld, Dominik Kirst, tienne Miquey |
| 2025 | The commutativity problem for effective varieties of formal series, and applications. | Lorenzo Clemente |
| 2025 | The Qualitative Collapse of Concurrent Games. | Pierre Clairambault |
| 2025 | Thin Coalgebraic Behaviours Are Inductive. | Anton Chernev, Corina Crstea, Helle Hvid Hansen, Clemens Kupke |
| 2025 | Closure and Complexity of Temporal Causality. | Mishel Carelli, Bernd Finkbeiner, Julian Siber |
| 2025 | Recognisability Equals Definability for Finitely Representable Matroids of Bounded Path-Width. | Rutger Campbell, Bruno Guillon, Mamadou Moustapha Kant, Eun Jung Kim, Sang-il Oum |
| 2025 | Reachability Types, Traces and Full Abstraction. | Benedict Bunting, Andrzej S. Murawski |
| 2025 | The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems. | Johanna Brunar, Marcin Kozik, Toms Nagy, Michael Pinsker |
| 2025 | Risk-aware Markov Decision Processes Using Cumulative Prospect Theory. | Thomas Brihaye, Krishnendu Chatterjee, Stefanie Mohr, Maximilian Weininger |
| 2025 | Regular Grammars for Sets of Graphs of Tree-Width 2. | Marius Bozga, Radu Iosif, Florian Zuleger |
| 2025 | Probabilistic Strategies: Definability and the Tensor Completeness Problem. | Nathan J. Bowler, Sergey Goncharov, Paul Blain Levy |
| 2025 | Functional Stream Semantics for a Synchronous Block-Diagram Compiler. | Timothy Bourke, Paul Jeanmaire, Marc Pouzet |
| 2025 | Effectful Mealy Machines: Bisimulation and Trace. | Filippo Bonchi, Elena Di Lavore, Mario Romn |
| 2025 | Graphs of unbounded linear cliquewidth must transduce all trees. | Mikolaj Bojanczyk, Pierre Ohlmann |
| 2025 | The Identity Problem in virtually solvable matrix groups over algebraic numbers. | Corentin Bodart, Ruiwen Dong |
| 2025 | Naturality for higher-dimensional path types. | Thibaut Benjamin, Ioannis Markakis, Wilfred Offord, Chiara Sarti, Jamie Vicary |
| 2025 | Complete Quantum Relational Hoare Logics from Optimal Transport Duality. | Gilles Barthe, Minbo Gao, Theo Wang, Li Zhou |
| 2025 | Proof Compression via Subatomic Logic and Guarded Substitutions. | Victoria Barrett, Alessio Guglielmi, Benjamin Ralph, Lutz Straburger |
| 2025 | #P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? | Max Bannach, Erik D. Demaine, Timothy Gomez, Markus Hecher |
| 2025 | Classical Simulation of Quantum CSP Strategies. | Demian Banakh, Lorenzo Ciardo, Marcin Kozik, Jan Tulowiecki |
| 2025 | Pushdown Model Checking above the Cubic Bottleneck. | A. R. Balasubramanian, Dmitry Chistikov, Rupak Majumdar |
| 2025 | Multiplicative Rewards in Markovian Models. | Christel Baier, Krishnendu Chatterjee, Tobias Meggendorfer, Jakob Piribauer |
| 2025 | Learning Weighted Automata over Number Rings, Concretely and Categorically. | Quentin Aristote, Sam van Gool, Daniela Petrisan, Mahsa Shirmohammadi |
| 2025 | Logical relations for call-by-push-value models, via internal fibrations in a 2-category. | Pedro H. Azevedo de Amorim, Satoshi Kura, Philip Saville |
| 2025 | Convergence Laws for Extensions of First-Order Logic with Averaging. | Sam Adam-Day, Michael Benedikt, Alberto Larrauri |