Papers
15
Total Citations
609
H-Index
11
About
Ralf Klasing is a prominent computer scientist whose research lies at the intersection of distributed computing, mobile robotics, and graph algorithms. He is best known for his foundational contributions to the theory of autonomous mobile robots, particularly the challenging problem of gathering — coordinating multiple oblivious, asynchronous robots to converge at a single location without prior communication or memory of past states. His 2007 paper on gathering robots in a ring, with 190 citations, established him as a leading authority in this domain, and subsequent work extended these results to symmetric configurations, anonymous grids, and trees, collectively accumulating hundreds of citations across the field. Beyond robotics, Klasing has made significant contributions to graph exploration and network algorithms, including memory-efficient periodic graph traversal, derandomization of random walks, and fault detection using mobile agents. His more recent work, such as the Bamboo Garden Trimming Problem, demonstrates his ability to model practical scheduling and maintenance challenges through elegant algorithmic frameworks. With a consistently cited body of work spanning nearly two decades, Klasing has shaped theoretical foundations that underpin modern research in distributed systems and algorithmic coordination, making his publications essential reading for anyone entering these fields.
Research Focus
Key Achievements
Top Papers
- 1Gathering asynchronous oblivious mobile robots in a ring190 citations · 2007
- 2
- 3
- 4
- 5Locating and repairing faults in a network with mobile agents36 citations · 2010
- 6Fast periodic graph exploration with constant memory34 citations · 2007
- 7Gathering of Robots on Anonymous Grids without Multiplicity Detection32 citations · 2012
- 8
- 9
- 10Linear Search by a Pair of Distinct-Speed Robots16 citations · 2016