3 search results - page 1 / 1 » Fast quantum byzantine agreement |
STOC
2005
ACM
14 years 4 months ago
2005
ACM
SODA
2008
ACM
13 years 6 months ago
2008
ACM
We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full ...
WDAG
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. We give randomized agreement algorithms with constant expected running time in asynchronous systems subject to process failures, where up to a minority of processes may f...