129 search results - page 13 / 26 » Randomized leader election |
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
We design efficient protocols for processors to extract private randomness over a network with Byzantine faults, when each processor has access to an independent weakly-random n-...
MST
2007
13 years 7 months ago
2007
Consider a collection of r identical asynchronous mobile agents dispersed on an arbitrary anonymous network of size n. The agents all execute the same protocol and move from node ...
FUIN
2007
13 years 7 months ago
2007
In the paper triangular graphs are discussed. The class of triangular graphs is of special interest as unifying basic features of complete graphs with trees and being used on many ...
DC
2010
13 years 7 months ago
2010
We introduce a simple liveness property for shared object implementations that is gracefully degrading depending on the degree of synchrony in each run. This property, called adapt...
CAV
2008
Springer
13 years 9 months ago
2008
Springer
We show how to view certain subclasses of (single-pushout) graph transformation systems as well-structured transition systems, which leads to decidability of the covering problem v...