S. C. Bhatt

Papers

Total Citations

H-Index

About

S. C. Bhatt’s research centers on theoretical computer science and algorithmic graph theory, with a particular focus on maze traversal and finite-state automata. Bhatt’s major contribution lies in developing elegant algorithms for navigating unknown, directed Eulerian mazes using minimal computational resources. In his most-cited work, “Traversing Directed Eulerian Mazes” (2002, 29 citations), he introduced two novel algorithms that enable a robot controlled by a finite-state automaton to thread such mazes by placing a single pebble at each vertex’s exits to indicate an Eulerian cycle. This work demonstrates how simple, memory-constrained agents can solve complex pathfinding problems, offering insights into graph exploration and robotics. A follow-up paper (2004, 4 citations) refined these algorithms, assuming each vertex has a circular list of outgoing edges, further advancing the theoretical framework. Bhatt’s research is notable for its clarity and foundational impact, inspiring subsequent work in distributed computing and autonomous navigation. His contributions highlight the power of minimalism in algorithmic design, making his work a valuable reference for students and researchers exploring automata theory, graph algorithms, and the limits of computational control in unknown environments.