67 search results - page 11 / 14 » Randomized protocols for asynchronous consensus |
186
click to vote
INFORMATICALT
2006
15 years 5 months ago
2006
Generally, the task in a distributed system must achieve an agreement. It requires a set of processors to agree on a common value even if some components are corrupted. There are s...
125
Voted
FOCS
2008
IEEE
16 years 7 days 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-...
142
click to vote
FOSSACS
2009
Springer
16 years 17 days ago
2009
Springer
There is growing interest in quantitative theories of information flow in a variety of contexts, such as secure information flow, anonymity protocols, and side-channel analysis. ...
162
click to vote
IPPS
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract--Software transactional memory (STM) algorithms often rely on centralized components to achieve atomicity, isolation and consistency. In a distributed setting, centralized...
140
click to vote
WDAG
1989
Springer
15 years 9 months ago
1989
Springer
We focus on unreliable asynchronous shared memory model which support only atomic read and write operations. For such a model we provide a necessary condition for the solvability ...