11 citations · 27 across the 9 of their papers we have counts for
13 papers
Agentic Distributed Computing
Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla +1
The most celebrated and extensively studied model of distributed computing is the {\em message-passing model,} in which each vertex/node of the (distributed network) graph correspo…
Optimal Dispersion Under Asynchrony
Debasish Pattanayak, Ajay D. Kshemkalyani, Manish Kumar +2
We study the dispersion problem in anonymous port-labeled graphs: mobile agents, each with a unique ID and initially located arbitrarily on the nodes of an -node grap…
Dispersion is (Almost) Optimal under (A)synchrony
Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla +1
The dispersion problem has received much attention recently in the distributed computing literature. In this problem, agents placed initially arbitrarily on the nodes of…
Construction of a Byzantine Linearizable SWMR Atomic Register from SWSR Atomic Registers
Ajay D. Kshemkalyani, Manaswini Piduguralla, Sathya Peri +1
The SWMR atomic register is a fundamental building block in shared memory distributed systems and implementing it from SWSR atomic registers is an important problem. While this pro…
Agent-based Leader Election, MST, and Beyond
Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla +1
Leader election is one of the fundamental and well-studied problems in distributed computing. In this paper, we initiate the study of leader election using mobile agents. Suppose $…
Towards Stronger Blockchains: Security Against Front-Running Attacks
Anshuman Misra, Ajay D. Kshemkalyani
Blockchains add transactions to a distributed shared ledger by arriving at consensus on sets of transactions contained in blocks. This provides a total ordering on a set of global…
Byzantine Fault Tolerant Causal Ordering
Anshuman Misra, Ajay Kshemkalyani
Causal ordering in an asynchronous system has many applications in distributed computing, including in replicated databases and real-time collaborative software. Previous work in t…
Near-Optimal Dispersion on Arbitrary Anonymous Graphs
Ajay D. Kshemkalyani, Gokarna Sharma
Given an undirected, anonymous, port-labeled graph of memory-less nodes, edges, and degree , we consider the problem of dispersing robots (or tokens) positione…
The Bloom Clock for Causality Testing
Anshuman Misra, Ajay D. Kshemkalyani
Testing for causality between events in distributed executions is a fundamental problem. Vector clocks solve this problem but do not scale well. The probabilistic Bloom clock can d…
Provisioning Spot Instances Without Employing Fault-Tolerance Mechanisms
Abdullah Alourani, Ajay D. Kshemkalyani
Cloud computing offers a variable-cost payment scheme that allows cloud customers to specify the price they are willing to pay for renting spot instances to run their applications…
Dispersion of Mobile Robots in the Global Communication Model
Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma
The dispersion problem on graphs asks robots placed initially arbitrarily on the nodes of an -node anonymous graph to reposition autonomously to reach a configuration…
Efficient Dispersion of Mobile Robots on Arbitrary Graphs and Grids
Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma
The mobile robot dispersion problem on graphs asks robots placed initially arbitrarily on the nodes of an -node anonymous graph to reposition autonomously to reach a c…
Efficient Dispersion of Mobile Robots on Graphs
Ajay D. Kshemkalyani, Faizan Ali
The dispersion problem on graphs requires robots placed arbitrarily at the nodes of an anonymous graph, where , to coordinate with each other to reach a final con…