Filed under: Uncategorized | Tags: Byzantine agreement, distributed computing, theory
I just put up a paper from Val and I that will appear in this upcoming STOC. The paper is:
It gives the first expected polynomial time algorithm for Byzantine agreement as it was originally posed: adaptive adversary, full-information model, with asynchronous communication. It’s something that we’ve both been working on for many years.
3 Comments so far
Leave a comment