Machinations


Byzantine Agreement in Polynomial Time
March 8, 2013, 6:25 pm
Filed under: Uncategorized | Tags: , ,

I just put up a paper from Val and I that will appear in this upcoming STOC. The paper is:

Byzantine Agreement in Polynomial Expected Time

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.

Advertisements

3 Comments so far
Leave a comment

Fantastic work, Jared and Val. You guys been really working hard on this – hope the best for this!

Comment by Amitabh Trehan

great to know this Jared. congratulations to val and you.
regards,

Navin

Comment by Navin

Congratulations to you and Valerie!
-Max

Comment by Max




Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s



%d bloggers like this: