Baruch Awerbuch

Johns Hopkins University, Massachusetts Institute of Technology

Papers

Total Citations

165

H-Index

About

Baruch Awerbuch is a pioneering computer scientist whose foundational work in distributed computing and mobile robotics has shaped how autonomous systems explore unknown environments. His key research areas include graph exploration, distributed algorithms, and network security. Awerbuch’s most influential contribution is the concept of *piecemeal graph exploration*, introduced in his seminal 1999 paper (113 citations) co-authored with Margrit Betke, Ronald L. Rivest, and Mona Singh. This work addresses a critical challenge: a mobile robot that must systematically map an unknown graph while periodically returning to its starting point—a constraint mimicking real-world energy and communication limits. Awerbuch further advanced this field with his 1998 paper on polylogarithmic-overhead piecemeal exploration (15 citations), developing efficient traversal techniques that minimize redundant steps. Beyond robotics, his broader impact includes foundational results in distributed computing, such as algorithms for network synchronization and fault tolerance. With over a decade of influential publications, Awerbuch’s work remains essential reading for researchers in autonomous systems, robotics, and distributed algorithms, offering elegant solutions to fundamental problems in exploration and coordination.