Seregy Sapunov
Papers
1
Total Citations
2
H-Index
1
About
Sergey Sapunov is a mathematician whose research centers on the theoretical foundations of distributed computing and autonomous agent behavior, particularly through the lens of automata theory and graph-based environments. His most-cited work, "Collectives of automata on infinite grid graph with deterministic vertex labeling" (2019), tackles the fundamental problem of how multiple memory-limited mobile agents can coordinate and navigate in infinite, structured spaces. By modeling agents as finite automata walking on an infinite grid with deterministic vertex labels, Sapunov explores the limits of decentralized computation and collective decision-making. This research contributes to the broader study of automata in labyrinths—directed graphs representing discrete environments—and has implications for swarm robotics, distributed algorithms, and theoretical computer science. While his citation count is modest, his work addresses deep, foundational questions in the theory of computation and multi-agent systems. Sapunov’s contributions are particularly valuable for researchers interested in the mathematical underpinnings of autonomous agents, graph theory, and the computational power of simple, distributed systems.
Research Focus
Key Achievements
Top Papers
- 1