Pierre Ohlmann
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
18
Venues
9
Active years
2017–2026
Best venue rank
A*
Where they publish
Papers
18 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ICALP | Expregular Functions. | Thomas Colcombet, Nathan Lhote, Pierre Ohlmann |
| 2025 | ICALP | The Memory of ω-Regular and BC(Σ⁰₂) Objectives. | Antonio Casares, Pierre Ohlmann |
| 2025 | LICS | Graphs of unbounded linear cliquewidth must transduce all trees. | Mikolaj Bojanczyk, Pierre Ohlmann |
| 2025 | TACAS | Fast value iteration: A uniform approach to efficient algorithms for energy games. | Michal Cadilhac, Antonio Casares, Pierre Ohlmann |
| 2024 | LICS | Rank-decreasing transductions. | Mikolaj Bojanczyk, Pierre Ohlmann |
| 2024 | LICS | Positional ω-regular languages. | Antonio Casares, Pierre Ohlmann |
| 2024 | STACS | Positionality in Σ⁰₂ and a Completeness Result. | Pierre Ohlmann, Michal Skrzypczak |
| 2023 | ICALP | Characterising Memory in Infinite Games. | Antonio Casares, Pierre Ohlmann |
| 2023 | ICALP | Flipper Games for Monadically Stable Graph Classes. | Jakub Gajarsk, Nikolas Mhlmann, Rose McCarty, Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Sebastian Siebertz, Marek Sokolowski, Szymon Torunczyk |
| 2023 | ICALP | Canonical Decompositions in Monadically Stable and Bounded Shrubdepth Graph Classes. | Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk |
| 2022 | AAAI | Scaling Neural Program Synthesis with Distribution-Based Search. | Nathanal Fijalkow, Guillaume Lagarde, Tho Matricon, Kevin Ellis, Pierre Ohlmann, Akarsh Nayan Potta |
| 2022 | CSR | The GKK Algorithm is the Fastest over Simple Mean-Payoff Games. | Pierre Ohlmann |
| 2022 | LICS | Characterizing Positionality in Games of Infinite Duration over Infinite Graphs. | Pierre Ohlmann |
| 2020 | FOSSACS | Controlling a Random Population. | Thomas Colcombet, Nathanal Fijalkow, Pierre Ohlmann |
| 2020 | MFCS | Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games. | Nathanal Fijalkow, Pawel Gawrychowski, Pierre Ohlmann |
| 2020 | STACS | Lower Bounds for Arithmetic Circuits via the Hankel Matrix. | Nathanal Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre |
| 2019 | SAS | On the Monniaux Problem in Abstract Interpretation. | Nathanal Fijalkow, Engel Lefaucheux, Pierre Ohlmann, Jol Ouaknine, Amaury Pouly, James Worrell |
| 2017 | STACS | Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. | Nathanal Fijalkow, Pierre Ohlmann, Jol Ouaknine, Amaury Pouly, James Worrell |