Shimon Even

Technion – Israel Institute of Technology

Papers

Total Citations

H-Index

About

Shimon Even is a foundational figure in theoretical computer science, best known for his pioneering work in graph theory, algorithms, and computational complexity. His research has profoundly influenced the study of traversal problems, particularly in the context of Eulerian graphs and maze-solving by finite-state automata. In his most-cited work, "Traversing Directed Eulerian Mazes" (2002, 29 citations), Even introduced two elegant algorithms that enable a robot—controlled by a finite-state automaton—to thread an unknown, directed Eulerian maze using a single pebble placed at each vertex’s exits to guide an Eulerian cycle. A follow-up paper (2004, 4 citations) refined these ideas, emphasizing the minimal computational power required for such traversal. Beyond these contributions, Even is celebrated for his seminal textbook *Graph Algorithms* (1979), a cornerstone for generations of computer scientists, and for his role in shaping the field of VLSI design and cryptography. His work on the Even–Paz algorithm for distributed coin tossing and his co-authorship of the influential "Even–Mansour" block cipher further underscore his lasting impact. With hundreds of citations across his career, Even’s legacy endures in both theoretical foundations and practical applications.