Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. - Nathanaël Fijalkow; Pierre Ohlmann; Joël Ouaknine; Amaury Pouly; James Worrell 001 (STACS, 2017)

The complexity of mean payoff games using universal graphs. - Nathanaël Fijalkow; Pawel Gawrychowski; Pierre Ohlmann (CoRR, 2018)

Tight Bounds using Hankel Matrix for Arithmetic Circuits with Unique Parse Trees. - Nathanaël Fijalkow; Guillaume Lagarde; Pierre Ohlmann (Electron. Colloquium Comput. Complex., 2018)

Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. - Nathanaël Fijalkow; Pierre Ohlmann; Joël Ouaknine; Amaury Pouly; James Worrell 001 (Theory Comput. Syst., 2019)

Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games. - Nathanaël Fijalkow; Pawel Gawrychowski; Pierre Ohlmann (MFCS, 2020)

A symmetric attractor-decomposition lifting algorithm for parity games. - Marcin Jurdzinski; Rémi Morvan; Pierre Ohlmann; K. S. Thejaswini (CoRR, 2020)

Lower Bounds for Arithmetic Circuits via the Hankel Matrix. - Nathanaël Fijalkow; Guillaume Lagarde; Pierre Ohlmann; Olivier Serre (Comput. Complex., 2021)

New Algorithms for Combinations of Objectives using Separating Automata. - Ashwani Anand; Nathanaël Fijalkow; Aliénor Goubault-Larrecq; Jérôme Leroux; Pierre Ohlmann (GandALF, 2021)

On the ESL algorithm for solving energy games. - Antonio Casares; Pierre Ohlmann (CoRR, 2021)

Controlling a random population. - Thomas Colcombet; Nathanaël Fijalkow; Pierre Ohlmann (Log. Methods Comput. Sci., 2021)

Monotonic graphs for parity and mean-payoff games. (Graphes monotones pour jeux de parité et à paiement moyen). - Pierre Ohlmann (2021)

Scaling Neural Program Synthesis with Distribution-Based Search. - Nathanaël Fijalkow; Guillaume Lagarde; Théo Matricon; Kevin Ellis; Pierre Ohlmann; Akarsh Nayan Potta (AAAI, 2022)

The GKK Algorithm is the Fastest over Simple Mean-Payoff Games. - Pierre Ohlmann (CSR, 2022)

A Technique to Speed up Symmetric Attractor-Based Algorithms for Parity Games. - K. S. Thejaswini; Pierre Ohlmann; Marcin Jurdzinski (FSTTCS, 2022)

The Theory of Universal Graphs for Infinite Duration Games. - Thomas Colcombet; Nathanaël Fijalkow; Pawel Gawrychowski; Pierre Ohlmann (Log. Methods Comput. Sci., 2022)

Flipper Games for Monadically Stable Graph Classes. - Jakub Gajarský; Nikolas Mählmann; Rose McCarty; Pierre Ohlmann; Michal Pilipczuk; Wojciech Przybyszewski; Sebastian Siebertz; Marek Sokolowski 001; Szymon Torunczyk (ICALP, 2023)

Canonical Decompositions in Monadically Stable and Bounded Shrubdepth Graph Classes. - Pierre Ohlmann; Michal Pilipczuk; Wojciech Przybyszewski; Szymon Torunczyk (ICALP, 2023)

Positionality of mean-payoff games on infinite graphs. - Pierre Ohlmann (CoRR, 2023)

Positionality in Σ_0^2 and a completeness result. - Pierre Ohlmann; Michal Skrzypczak (CoRR, 2023)

Characterizing Positionality in Games of Infinite Duration over Infinite Graphs. - Pierre Ohlmann (TheoretiCS, 2023)

Rank-decreasing transductions. - Mikolaj Bojanczyk; Pierre Ohlmann (LICS, 2024)

Positional ω-regular languages. - Antonio Casares; Pierre Ohlmann (LICS, 2024)

Positionality in Σ⁰₂ and a Completeness Result. - Pierre Ohlmann; Michal Skrzypczak (STACS, 2024)

Half-positional ω-regular languages. - Antonio Casares; Pierre Ohlmann (CoRR, 2024)

A positional Π03-complete objective. - Antonio Casares; Pierre Ohlmann; Pierre Vandenhove (CoRR, 2024)

The Memory of ω-Regular and BC(Σ⁰₂) Objectives. - Antonio Casares; Pierre Ohlmann (ICALP, 2025)

Fast value iteration: A uniform approach to efficient algorithms for energy games. - Michaël Cadilhac; Antonio Casares; Pierre Ohlmann (TACAS (2), 2025)

Characterising memory in infinite games. - Antonio Casares; Pierre Ohlmann (Log. Methods Comput. Sci., 2025)

Graphs of unbounded linear cliquewidth must transduce all trees. - Mikolaj Bojanczyk; Pierre Ohlmann (CoRR, 2025)

The memory of ω-regular and BC(Σ20) objectives. - Antonio Casares; Pierre Ohlmann (CoRR, 2025)

On the Monniaux Problem in Abstract Interpretation. - Nathanaël Fijalkow; Engel Lefaucheux; Pierre Ohlmann; Joël Ouaknine; Amaury Pouly; James Worrell 001 (J. ACM, 2025)

Infinite lexicographic products of positional objectives. - Antonio Casares; Pierre Ohlmann; Michal Skrzypczak; Igor Walukiewicz (CoRR, 2025)