J. Reichert

Papers

Total Citations

H-Index

About

J. Reichert is a theoretical computer scientist whose research centers on the decidability and computational complexity of algorithmic game theory, with a particular focus on low-dimensional robot games. Their most-cited work, "On decidability and complexity of low-dimensional robot games" (2019, 5 citations), makes a foundational contribution by establishing precise boundaries for when such games can be solved algorithmically—a critical question for robotics and autonomous systems. Reichert's analysis reveals that while certain low-dimensional settings remain decidable, others exhibit surprising complexity jumps, providing essential guidance for both theorists and practitioners. This work has shaped subsequent research in motion planning and reactive synthesis, where understanding the limits of computation is paramount. Though early in their career, Reichert's rigorous approach to classifying problem difficulty has already garnered recognition among specialists, positioning them as a rising voice in the intersection of computational geometry and decision theory. Their ongoing investigations continue to probe the frontier of what can be efficiently computed in interactive, spatial environments.