The role of randomization at that time was to improve the complexity of solving certain problems. In 1983, randomized algorithms, still in their infancy, were starting to make headway in sequential algorithms and complexity theory. Rabin started the field of fault-tolerant randomized distributed algorithms. In these seminal papers, published in close succession in 1983, Michael Ben-Or and Michael O. Rabin, “ Randomized Byzantine Generals“, in Proceedings of Twenty-Fourth IEEE Annual Symposium on Foundations of Computer Science, pages 403-409, November 1983. Michael Ben-Or, “ Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols“, in Proceedings of the Second ACM Symposium on Principles of Distributed Computing, pages 27-30, August 1983.Dijkstra Prize in Distributed Computing jointly to the following two papers: Dijkstra Prize Committee has decided to grant the 2015 Edsger W.
0 Comments
Leave a Reply. |