8 search results - page 2 / 2 » Brief announcement: self-assembly as graph grammar as distri... |
PODC
2010
ACM
13 years 9 months ago
2010
ACM
We demonstrate how to leverage a system’s capability for allto-all communication to achieve an exponential speed-up of local algorithms despite bandwidth and memory restrictions...
SPAA
2009
ACM
14 years 5 months ago
2009
ACM
Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For scala...
CORR
2011
Springer
13 years 11 days ago
2011
Springer
In this paper we consider the k-set agreement problem in distributed round-based systems where processes communicate by message passing. We capture the synchrony and reliability o...