Ajay D. Kshemkalyani
University of Illinois Chicago, Research Triangle Park Foundation
Papers
16
Total Citations
171
H-Index
7
About
Ajay D. Kshemkalyani is a prominent computer scientist whose research spans distributed computing, mobile robotics algorithms, and large-scale network systems. He is perhaps best known for his groundbreaking contributions to the **dispersion problem** — a fundamental challenge in distributed computing where multiple mobile robots must autonomously reposition themselves across graph nodes so that each robot occupies a distinct location. His prolific output in this domain, including seminal works on arbitrary graphs (2019, 38 citations), grid structures (2020, 34 citations), and dynamic graphs (2020, 21 citations), has established him as a leading authority in mobile robot coordination theory. His continued refinements — exploring global communication strategies, near-optimal solutions, and near-optimal performance under both synchronous and asynchronous settings — demonstrate a sustained commitment to pushing theoretical boundaries. Beyond dispersion, Kshemkalyani has made meaningful contributions to predicate detection in large-scale locality-driven networks, including wireless sensor networks and modular robotics, and to reasoning about causality in distributed nonatomic events. With collectively over 150 citations across his most recognized works, his research has meaningfully shaped how the distributed systems community approaches coordination, exploration, and state detection problems at scale.
Research Focus
Key Achievements
Top Papers
- 1Fast Dispersion of Mobile Robots on Arbitrary Graphs38 citations · 2019
- 2Dispersion of Mobile Robots on Grids34 citations · 2020
- 3Efficient Dispersion of Mobile Robots on Dynamic Graphs21 citations · 2020
- 4Dispersion of mobile robots using global communication20 citations · 2021
- 5Near-Optimal Dispersion on Arbitrary Anonymous Graphs17 citations · 2022
- 6
- 7Reasoning about causality between distributed nonatomic events8 citations · 1997
- 8Dispersion is (Almost) Optimal under (A)synchrony4 citations · 2025
- 9Detecting Tree Distributed Predicates4 citations · 2012
- 10Fast Graph Exploration by a Mobile Robot4 citations · 2018