23 citations · 42 across the 19 of their papers we have counts for
Showing 2002Show all
2 papers · 1 filter
cs.DS2002
Randomized protocols for asynchronous consensus
James Aspnes
The famous Fischer, Lynch, and Paterson impossibility proof shows that it is impossible to solve the consensus problem in a natural model of an asynchronous distributed system if e…
cs.DS2002
Fast Deterministic Consensus in a Noisy Environment
James Aspnes
It is well known that the consensus problem cannot be solved deterministically in an asynchronous environment, but that randomized solutions are possible. We propose a new model, c…