Pierre Ohlmann

54 papers A* 9A 3B 3Misc 1Journal 34Unranked 3

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A symmetric recursive algorithm for mean-payoff games. CoRR Pierre Ohlmann
2026	J	`jnl`	Expregular functions. CoRR Thomas Colcombet, Nathan Lhote, Pierre Ohlmann
2026	J	`jnl`	Hardness of monadic second-order formulae over succinct graphs. Log. Methods Comput. Sci. Guilhem Gamard, Aliénor Goubault-Larrecq, Pierre Guillon, Pierre Ohlmann, Kévin Perrot, Guillaume Theyssier
2026	J	`jnl`	Positional ω-regular languages. TheoretiCS Antonio Casares, Pierre Ohlmann
2025	J	`jnl`	Characterising memory in infinite games. Log. Methods Comput. Sci. Antonio Casares, Pierre Ohlmann
2025	—	`conf`	Fast value iteration: A uniform approach to efficient algorithms for energy games. TACAS (2) Michaël Cadilhac, Antonio Casares, Pierre Ohlmann
2025	A*	`conf`	Graphs of unbounded linear cliquewidth must transduce all trees. LICS Mikolaj Bojanczyk, Pierre Ohlmann
2025	J	`jnl`	Graphs of unbounded linear cliquewidth must transduce all trees. CoRR Mikolaj Bojanczyk, Pierre Ohlmann
2025	J	`jnl`	Infinite lexicographic products of positional objectives. CoRR Antonio Casares, Pierre Ohlmann, Michal Skrzypczak, Igor Walukiewicz
2025	J	`jnl`	On the Monniaux Problem in Abstract Interpretation. J. ACM Nathanaël Fijalkow, Engel Lefaucheux, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
2025	A*	`conf`	The Memory of ω-Regular and BC(Σ⁰₂) Objectives. ICALP Antonio Casares, Pierre Ohlmann
2025	J	`jnl`	The memory of ω-regular and BC(Σ CoRR Antonio Casares, Pierre Ohlmann
2024	J	`jnl`	A positional Π CoRR Antonio Casares, Pierre Ohlmann, Pierre Vandenhove
2024	J	`jnl`	Half-positional ω-regular languages. CoRR Antonio Casares, Pierre Ohlmann
2024	A*	`conf`	Positional ω-regular languages. LICS Antonio Casares, Pierre Ohlmann
2024	A	`conf`	Positionality in Σ⁰₂ and a Completeness Result. STACS Pierre Ohlmann, Michal Skrzypczak
2024	A*	`conf`	Rank-decreasing transductions. LICS Mikolaj Bojanczyk, Pierre Ohlmann
2024	J	`jnl`	Rank-decreasing transductions. CoRR Mikolaj Bojanczyk, Pierre Ohlmann
2023	A*	`conf`	Canonical Decompositions in Monadically Stable and Bounded Shrubdepth Graph Classes. ICALP Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk
2023	J	`jnl`	Canonical decompositions in monadically stable and bounded shrubdepth graph classes. CoRR Pierre Ohlmann, Michal Pilipczuk, Szymon Torunczyk, Wojciech Przybyszewski
2023	A*	`conf`	Characterising Memory in Infinite Games. ICALP Antonio Casares, Pierre Ohlmann
2023	J	`jnl`	Characterizing Positionality in Games of Infinite Duration over Infinite Graphs. TheoretiCS Pierre Ohlmann
2023	A*	`conf`	Flipper Games for Monadically Stable Graph Classes. ICALP Jakub Gajarský, Nikolas Mählmann, Rose McCarty, Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Sebastian Siebertz, Marek Sokolowski, Szymon Torunczyk
2023	J	`jnl`	Flipper games for monadically stable graph classes. CoRR Jakub Gajarský, Nikolas Mählmann, Rose McCarty, Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Sebastian Siebertz, Marek Sokolowski, Szymon Torunczyk
2023	J	`jnl`	Positionality in Σ_0^2 and a completeness result. CoRR Pierre Ohlmann, Michal Skrzypczak
2023	J	`jnl`	Positionality of mean-payoff games on infinite graphs. CoRR Pierre Ohlmann
2022	—	`conf`	A Technique to Speed up Symmetric Attractor-Based Algorithms for Parity Games. FSTTCS K. S. Thejaswini, Pierre Ohlmann, Marcin Jurdzinski
2022	J	`jnl`	Characterising memory in infinite games. CoRR Antonio Casares, Pierre Ohlmann
2022	A*	`conf`	Characterizing Positionality in Games of Infinite Duration over Infinite Graphs. LICS Pierre Ohlmann
2022	J	`jnl`	Characterizing Positionality in Games of Infinite Duration over Infinite Graphs. CoRR Pierre Ohlmann
2022	A*	`conf`	Scaling Neural Program Synthesis with Distribution-Based Search. AAAI Nathanaël Fijalkow, Guillaume Lagarde, Théo Matricon, Kevin Ellis, Pierre Ohlmann, Akarsh Nayan Potta
2022	Misc	`conf`	The GKK Algorithm is the Fastest over Simple Mean-Payoff Games. CSR Pierre Ohlmann
2022	J	`jnl`	The Theory of Universal Graphs for Infinite Duration Games. Log. Methods Comput. Sci. Thomas Colcombet, Nathanaël Fijalkow, Pawel Gawrychowski, Pierre Ohlmann
2021	J	`jnl`	Controlling a random population. Log. Methods Comput. Sci. Thomas Colcombet, Nathanaël Fijalkow, Pierre Ohlmann
2021	J	`jnl`	Lower Bounds for Arithmetic Circuits via the Hankel Matrix. Comput. Complex. Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre
2021	—	`—`	Monotonic graphs for parity and mean-payoff games. (Graphes monotones pour jeux de parité et à paiement moyen). Pierre Ohlmann
2021	—	`conf`	New Algorithms for Combinations of Objectives using Separating Automata. GandALF Ashwani Anand, Nathanaël Fijalkow, Aliénor Goubault-Larrecq, Jérôme Leroux, Pierre Ohlmann
2021	J	`jnl`	On the ESL algorithm for solving energy games. CoRR Antonio Casares, Pierre Ohlmann
2021	J	`jnl`	Scaling Neural Program Synthesis with Distribution-based Search. CoRR Nathanaël Fijalkow, Guillaume Lagarde, Théo Matricon, Kevin Ellis, Pierre Ohlmann, Akarsh Potta
2021	J	`jnl`	The GKK Algorithm is the Fastest over Simple Mean-Payoff Games. CoRR Pierre Ohlmann
2021	J	`jnl`	The Theory of Universal Graphs for Infinite Duration Games. CoRR Thomas Colcombet, Nathanaël Fijalkow, Pawel Gawrychowski, Pierre Ohlmann
2020	J	`jnl`	A symmetric attractor-decomposition lifting algorithm for parity games. CoRR Marcin Jurdzinski, Rémi Morvan, Pierre Ohlmann, K. S. Thejaswini
2020	B	`conf`	Controlling a Random Population. FoSSaCS Thomas Colcombet, Nathanaël Fijalkow, Pierre Ohlmann
2020	A	`conf`	Lower Bounds for Arithmetic Circuits via the Hankel Matrix. STACS Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre
2020	B	`conf`	Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games. MFCS Nathanaël Fijalkow, Pawel Gawrychowski, Pierre Ohlmann
2019	J	`jnl`	Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. Theory Comput. Syst. Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
2019	J	`jnl`	Controlling a random population. CoRR Thomas Colcombet, Nathanaël Fijalkow, Pierre Ohlmann
2019	B	`conf`	On the Monniaux Problem in Abstract Interpretation. SAS Nathanaël Fijalkow, Engel Lefaucheux, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
2019	J	`jnl`	On the Monniaux Problem in Abstract Interpretation. CoRR Nathanaël Fijalkow, Engel Lefaucheux, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
2018	J	`jnl`	Lower bounds for arithmetic circuits via the Hankel matrix. Electron. Colloquium Comput. Complex. Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre
2018	J	`jnl`	The complexity of mean payoff games using universal graphs. CoRR Nathanaël Fijalkow, Pawel Gawrychowski, Pierre Ohlmann
2018	J	`jnl`	Tight Bounds using Hankel Matrix for Arithmetic Circuits with Unique Parse Trees. Electron. Colloquium Comput. Complex. Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann
2017	A	`conf`	Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. STACS Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
2017	J	`jnl`	Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. CoRR Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell