We present a scalable quantum algorithm to solve binary consensus in a system of n crash-prone quantum processes. The algorithm works in O(polylog n) time sending O(n polylog n) qu...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
Mobile ad hoc networks (MANETs) raise new challenges in designing protocols for solving the consensus problem. Among the others, how to design message efficient protocols so as to...