39 citations · 136 across the 17 of their papers we have counts for
4 papers · 1 filter
Sleeping is Efficient: MIS in -rounds Node-averaged Awake Complexity
Soumyottam Chatterjee, Robert Gmyr, Gopal Pandurangan
Maximal Independent Set (MIS) is one of the fundamental problems in distributed computing. The round (time) complexity of distributed MIS has traditionally focused on the \emph{wor…
Distributed Computation in Node-Capacitated Networks
John Augustine, Mohsen Ghaffari, Robert Gmyr +4
In this paper, we study distributed graph algorithms in networks in which the nodes have a limited communication capacity. Many distributed systems are built on top of an underlyin…
Convex Hull Formation for Programmable Matter
Joshua J. Daymude, Robert Gmyr, Kristian Hinnenthal +3
We envision programmable matter as a system of nano-scale agents (called particles) with very limited computational capabilities that move and compute collectively to achieve a des…
Ameba-inspired Self-organizing Particle Systems
Shlomi Dolev, Robert Gmyr, Andrea W. Richa +1
Particle systems are physical systems of simple computational particles that can bond to neighboring particles and use these bonds to move from one spot to another (non-occupied) s…