Two Absolute Bounds for Distributed Bit Complexity

The concept of distributed communication bit complexity was introduced by Dinitz, Rajsbaum, and Moran. They studied the bit 4 complexity of Consensus and Leader Election, arriving at more or less exact bounds. This paper answers two questions on Leader 5 Election, which remained there open. The first is to close the gap between the known upper and lower… (More)