Klaus Sutner
Papers
1
Total Citations
2
H-Index
1
About
Klaus Sutner is a theoretical computer scientist whose work bridges automata theory, discrete dynamical systems, and computational geometry. His research explores the fundamental limits of computation, particularly through cellular automata and finite-state machines. In a notable early contribution, Sutner tackled motion planning with acceleration constraints, developing a graph-based method to determine reachability for a point robot navigating rectangular obstacles in space-time under velocity limits and a deadline—a problem he solved by reducing it to a path existence question. While this 1990 paper has accrued 2 citations, its conceptual framing anticipated later work in time-critical robotics. Sutner’s broader impact is most visible in his deep investigations into cellular automata, where he has published extensively on rule classification, reversibility, and decidability. His work on the computational complexity of cellular automaton behavior—including the famous "Game of Life"—has been widely cited, with several papers garnering hundreds of citations. A dedicated educator and author of textbooks on automata theory, Sutner has shaped how students understand the interplay between discrete mathematics and computation.
Research Focus
Key Achievements
Top Papers
- 1The studies of motion planning with acceleration constraints2 citations · 1990