Julien Reichert

Papers

Total Citations

H-Index

About

Julien Reichert’s research lies at the intersection of theoretical computer science, game theory, and formal verification, with a focus on infinite-state systems and decidability frontiers. His major contributions center on reachability games played on systems with counters—a class of two-player games where one player aims to reach a specific configuration of vertex and counter values. In his seminal 2015 thesis, Reichert systematically explored the decidability and algorithmic complexity of these games, providing foundational results that clarify when such problems can be solved algorithmically. He further advanced the field with his 2016 work on two-dimensional robot games, a type of vector addition game played on the integer lattice. Here, Reichert proved a striking undecidability result, demonstrating that even in the simplest two-dimensional case, determining the winner is impossible in general. This work, cited over a dozen times collectively, has influenced subsequent research on the boundaries of decidability in infinite games. Reichert’s contributions are essential reading for anyone studying algorithmic game theory, automata theory, or the theoretical limits of verification in systems with unbounded resources.