Sumathi Sivasubramaniam
YOU?
Author Swipe
View article: Run for Cover: Dominating Set via Mobile Agents
Run for Cover: Dominating Set via Mobile Agents Open
Research involving computing with mobile agents is a fast-growing field, given the advancement of technology in automated systems, e.g., robots, drones, self-driving cars, etc. Therefore, it is pressing to focus on solving classical networ…
View article: Improved Deterministic Leader Election in Diameter-Two Networks
Improved Deterministic Leader Election in Diameter-Two Networks Open
In this paper, we investigate the leader election problem in diameter-two networks. Recently, Chatterjee et al. [DC 2020] studied the leader election in diameter-two networks. They presented a $O(\log n)$-round deterministic {implicit} lea…
View article: Fault-Tolerant Dispersion of Mobile Robots
Fault-Tolerant Dispersion of Mobile Robots Open
We consider the mobile robot dispersion problem in the presence of faulty robots (crash-fault). Mobile robot dispersion consists of $k\leq n$ robots in an $n$-node anonymous graph. The goal is to ensure that regardless of the initial place…
View article: Fault-Tolerant Graph Realizations in the Congested Clique
Fault-Tolerant Graph Realizations in the Congested Clique Open
In this paper, we study the graph realization problem in the Congested Clique model of distributed computing under crash faults. We consider {\em degree-sequence realization}, in which each node $v$ is associated with a degree value $d(v)$…
View article: Distributed Graph Realizations
Distributed Graph Realizations Open
We study graph realization problems from a distributed perspective and we study it in the node capacitated clique (NCC) model of distributed computing, recently introduced for representing peer-to-peer networks. We focus on two central var…
View article: Leader Election in Sparse Dynamic Networks with Churn
Leader Election in Sparse Dynamic Networks with Churn Open
We investigate the problem of electing a leader in a sparse but well-connected synchronous dynamic network in which up to a fraction of the nodes chosen adversarially can leave/join the network per time step. At this churn rate, all nodes …