10 citations · 32 across the 19 of their papers we have counts for
25 papers
A symmetric recursive algorithm for mean-payoff games
Pierre Ohlmann
We propose a new deterministic symmetric recursive algorithm for solving mean-payoff games.
Expregular functions
Thomas Colcombet, Nathan Lhote, Pierre Ohlmann
Polyregular functions form a robust class of string-to-string functions with polynomial growth, as evidenced by Bojanczyk (2018). This class admits numerous descriptions and enjoys…
Infinite lexicographic products of positional objectives
Antonio Casares, Pierre Ohlmann, Michał Skrzypczak +1
This paper contributes to the study of positional determinacy of infinite duration games played on potentially infinite graphs with neutral transitions. Recently, [Ohlmann, Theoret…
The memory of -regular and BC() objectives
Antonio Casares, Pierre Ohlmann
In the context of 2-player zero-sum infinite-duration games played on (potentially infinite) graphs, the memory of an objective is the smallest integer k such that in any game won…
Trees in graphs of large linear cliquewidth
Mikołaj Bojańczyk, Pierre Ohlmann
The Pathwidth Theorem states that if a class of graphs has unbounded pathwidth, then it contains all trees as graph minors. We prove a similar result for dense graphs. More precise…
A positional -complete objective
Antonio Casares, Pierre Ohlmann, Pierre Vandenhove
We study zero-sum, turn-based games on graphs. In this note, we show the existence of a game objective that is -complete for the Borel hierarchy and that is positiona…