In this paper we present new distributed protocols to color even rings and general bipartite graphs. Our motivation is to provide algorithmic explanation for human subject experime...
Amos Israeli, Mathew D. McCubbins, Ramamohan Patur...
In this paper we describe the advantages of using iterative Diffie-Hellman (IDH) key trees for mobile ad-hoc group communication. We focus on the Treebased Group Diffie-Hellman (...
Abstract— In this paper, we develop and analyze a lowcomplexity cooperative protocol that significantly increases the average throughput of multi-hop upstream transmissions for ...
Alexandre de Baynast, Omer Gurewitz, Edward W. Kni...
We consider the problem of uniformly dispersing mobile robotic sensors in a simply connected orthogonal space of unknown shape. The mobile sensors are injected into the space from ...
This paper is on the Consensus problem, in the context of asynchronous distributed systems made of n processes, at most f of them may crash. A family of failure detector classes s...