Guy Peer

Papers

Total Citations

H-Index

About

Guy Peer is a theoretical computer scientist whose work lies at the intersection of automata theory, graph algorithms, and computational geometry. His most influential contribution is the foundational paper "Graph Exploration by a Finite Automaton" (2004), which has garnered 26 citations and remains a key reference in the study of how simple, memory-limited agents can navigate unknown environments. In this work, Peer introduced elegant models and lower bounds for the exploration capabilities of finite automata on graphs, addressing fundamental questions about the power of minimal computational devices in spatial reasoning. His research has implications for robotics, distributed computing, and network exploration, where agents must operate under severe resource constraints. Beyond this landmark paper, Peer has contributed to problems in online algorithms and geometric optimization, often focusing on the trade-offs between memory, time, and movement. While his citation count reflects a focused but impactful body of work, his 2004 paper is widely recognized as a seminal contribution that continues to inspire new research on autonomous exploration and the limits of computation in physical spaces.