Skip to content

Author

Ajay D. Kshemkalyani

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Book Open access Sep 2026

Asynchronous Dispersion with Optimal Time Complexity

We study the dispersion problem for k mobile agents on an n-node anonymous graph with memory-less nodes and maximum degree Δ. Agents must autonomously relocate so that no two agents occupy the same node. While an optimal O(k)-time, O(log (k + Δ))-memory algorithm is known under synchronous settings, the best known asyn...

Debasish Pattanayak, Ajay D. Kshemkalyani, Manish Kumar et al. · 1 citation
Preprint Oct 2026

Byzantine-Tolerant Causal Unicast with Constant Message Space Overhead

Causal message ordering provides essential semantics for distributed applications, yet ensuring it within an asynchronous system subject to Byzantine failures presents fundamental theoretical and practical challenges. Prior research establishes that algorithms cannot guarantee both strong safety and liveness without us...

Purvi Patel, Ajay D. Kshemkalyani · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.