Pierre Ohlmann

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 40

Top Topics

Equivalence Queries

Regular Languages

Top Venues

Publications

Pierre Ohlmann, Michal Skrzypczak
Positionality in Σ⁰₂ and a Completeness Result. STACS (2024)
Antonio Casares, Pierre Ohlmann
Half-positional ω-regular languages. CoRR (2024)
Antonio Casares, Pierre Ohlmann
Positional ω-regular languages. LICS (2024)
Mikolaj Bojanczyk, Pierre Ohlmann
Rank-decreasing transductions. CoRR (2024)
Mikolaj Bojanczyk, Pierre Ohlmann
Rank-decreasing transductions. LICS (2024)
Jakub Gajarský, Nikolas Mählmann, Rose McCarty, Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Sebastian Siebertz, Marek Sokolowski, Szymon Torunczyk
Flipper games for monadically stable graph classes. CoRR (2023)
Pierre Ohlmann
Characterizing Positionality in Games of Infinite Duration over Infinite Graphs. TheoretiCS 2 (2023)
Pierre Ohlmann, Michal Pilipczuk, Szymon Torunczyk, Wojciech Przybyszewski
Canonical decompositions in monadically stable and bounded shrubdepth graph classes. CoRR (2023)
Antonio Casares, Pierre Ohlmann
Characterising Memory in Infinite Games. ICALP (2023)
Jakub Gajarský, Nikolas Mählmann, Rose McCarty, Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Sebastian Siebertz, Marek Sokolowski, Szymon Torunczyk
Flipper Games for Monadically Stable Graph Classes. ICALP (2023)
Pierre Ohlmann
Positionality of mean-payoff games on infinite graphs. CoRR (2023)
Pierre Ohlmann, Michal Skrzypczak
Positionality in Σ_0^2 and a completeness result. CoRR (2023)
Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk
Canonical Decompositions in Monadically Stable and Bounded Shrubdepth Graph Classes. ICALP (2023)
K. S. Thejaswini, Pierre Ohlmann, Marcin Jurdzinski
A Technique to Speed up Symmetric Attractor-Based Algorithms for Parity Games. FSTTCS (2022)
Thomas Colcombet, Nathanaël Fijalkow, Pawel Gawrychowski, Pierre Ohlmann
The Theory of Universal Graphs for Infinite Duration Games. Log. Methods Comput. Sci. 18 (3) (2022)
Nathanaël Fijalkow, Guillaume Lagarde, Théo Matricon, Kevin Ellis, Pierre Ohlmann, Akarsh Nayan Potta
Scaling Neural Program Synthesis with Distribution-Based Search. AAAI (2022)
Antonio Casares, Pierre Ohlmann
Characterising memory in infinite games. CoRR (2022)
Pierre Ohlmann
Characterizing Positionality in Games of Infinite Duration over Infinite Graphs. CoRR (2022)
Pierre Ohlmann
The GKK Algorithm is the Fastest over Simple Mean-Payoff Games. CSR (2022)
Pierre Ohlmann
Characterizing Positionality in Games of Infinite Duration over Infinite Graphs. LICS (2022)
Thomas Colcombet, Nathanaël Fijalkow, Pierre Ohlmann
Controlling a random population. Log. Methods Comput. Sci. 17 (4) (2021)
Pierre Ohlmann
The GKK Algorithm is the Fastest over Simple Mean-Payoff Games. CoRR (2021)
Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre
Lower Bounds for Arithmetic Circuits via the Hankel Matrix. Comput. Complex. 30 (2) (2021)
Nathanaël Fijalkow, Guillaume Lagarde, Théo Matricon, Kevin Ellis, Pierre Ohlmann, Akarsh Potta
Scaling Neural Program Synthesis with Distribution-based Search. CoRR (2021)
Antonio Casares, Pierre Ohlmann
On the ESL algorithm for solving energy games. CoRR (2021)
Thomas Colcombet, Nathanaël Fijalkow, Pawel Gawrychowski, Pierre Ohlmann
The Theory of Universal Graphs for Infinite Duration Games. CoRR (2021)
Ashwani Anand, Nathanaël Fijalkow, Aliénor Goubault-Larrecq, Jérôme Leroux, Pierre Ohlmann
New Algorithms for Combinations of Objectives using Separating Automata. GandALF (2021)
Nathanaël Fijalkow, Pawel Gawrychowski, Pierre Ohlmann
Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games. MFCS (2020)
Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre
Lower Bounds for Arithmetic Circuits via the Hankel Matrix. STACS (2020)
Thomas Colcombet, Nathanaël Fijalkow, Pierre Ohlmann
Controlling a Random Population. FoSSaCS (2020)
Marcin Jurdzinski, Rémi Morvan, Pierre Ohlmann, K. S. Thejaswini
A symmetric attractor-decomposition lifting algorithm for parity games. CoRR (2020)
Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. Theory Comput. Syst. 63 (5) (2019)
Nathanaël Fijalkow, Engel Lefaucheux, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
On the Monniaux Problem in Abstract Interpretation. CoRR (2019)
Nathanaël Fijalkow, Engel Lefaucheux, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
On the Monniaux Problem in Abstract Interpretation. SAS (2019)
Thomas Colcombet, Nathanaël Fijalkow, Pierre Ohlmann
Controlling a random population. CoRR (2019)
Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann
Tight Bounds using Hankel Matrix for Arithmetic Circuits with Unique Parse Trees. Electron. Colloquium Comput. Complex. 25 (2018)
Nathanaël Fijalkow, Pawel Gawrychowski, Pierre Ohlmann
The complexity of mean payoff games using universal graphs. CoRR (2018)
Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre
Lower bounds for arithmetic circuits via the Hankel matrix. Electron. Colloquium Comput. Complex. 25 (2018)
Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. CoRR (2017)
Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. STACS (2017)