2022/06/30 by Huang, Shang-En, Pettie, Seth, Zhu, Leqi · 1 citation
#Data Structures and Algorithms (cs.DS) #Distributed #FOS: Computer and information sciences #FOS: Mathematics #Parallel #Statistics Theory (math.ST) #and Cluster Computing (cs.DC)
paper · doi:10.48550/arxiv.2206.15335
Since the mid-1980s it has been known that Byzantine Agreement can be solved with probability 1 asynchronously, even against an omniscient, computationally unbounded adversary that can adaptively corrupt up to f