David S. Greenberg

Papers

Total Citations

H-Index

About

David S. Greenberg is a theoretical computer scientist whose work centers on algorithmic graph theory, particularly the traversal of directed Eulerian mazes using minimal computational resources. His most-cited paper (2002, 29 citations) introduces two pioneering algorithms that enable a finite-state automaton—a robot with no memory beyond a few pebbles—to navigate and map unknown Eulerian graphs. By placing a single pebble at one exit of each vertex, the robot can systematically trace an Eulerian cycle, demonstrating that complex graph exploration is possible with extremely limited control. A follow-up paper (2004, 4 citations) refines these methods, assuming vertices have circular lists of outgoing edges, further simplifying the traversal process. Greenberg’s contributions are notable for their elegance and foundational impact on robotics, distributed computing, and graph exploration theory. His work shows how simple agents can solve sophisticated topological problems, inspiring research in autonomous navigation and network traversal. Though his citation counts are modest, his ideas remain a touchstone for researchers studying minimalistic algorithms in graph theory.