11 citations · 11 across the 1 of their papers we have counts for
1 paper
Ran Cohen, Iftach Haitner, Nikolaos Makriyannis +2
We prove lower bounds on the round complexity of randomized Byzantine agreement (BA) protocols, bounding the halting probability of such protocols after one and two rounds. In part…