75 search results - page 5 / 15 » Lower Bounds for Asynchronous Consensus |
109
click to vote
SOFSEM
2010
Springer
15 years 9 months ago
2010
Springer
We extend the lower bound of Adler et. al [1] and Berenbrink [3] for parallel randomized load balancing algorithms. The setting in these asynchronous and distributed algorithms is...
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Asynchronous automata are parallel compositions of finitestate processes synchronizing over shared variables. A deep theorem due to Zielonka says that every regular trac...
69
Voted
CSFW
2009
IEEE
15 years 7 months ago
2009
IEEE
Multi-party contract signing protocols specify how a number of signers can cooperate in achieving a fully signed contract, even in the presence of dishonest signers. This problem h...
SIROCCO
2010
15 years 1 months ago
2010
Abstract. Two mobile agents (robots) have to meet in an a priori unknown bounded terrain modeled as a polygon, possibly with polygonal obstacles. Robots are modeled as points, and ...
84
Voted
PODC
2006
ACM
15 years 6 months ago
2006
ACM
We study the implication that various timeliness and failure detector assumptions have on the performance of consensus algorithms that exploit them. We present a general framework...