The Community for Technology Leaders
2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW) (2010)
Atlanta, GA, USA
Apr. 19, 2010 to Apr. 23, 2010
ISBN: 978-1-4244-6533-0
pp: 1-13
Olumuyiwa Oluwasanmi , Department of Computer Science, University of New Mexico, Albuquerque, 87131-1386, USA
Jared Saia , Department of Computer Science, University of New Mexico, Albuquerque, 87131-1386, USA
Valerie King , Department of Computer Science, University of Victoria, P.O. Box 3055, BC, Canada V8W 3P6
ABSTRACT
A recent theoretical result by King and Saia shows that it is possible to solve the Byzantine agreement, leader election and universe reduction problems in the full information model with ?(n
INDEX TERMS
CITATION

J. Saia, V. King and O. Oluwasanmi, "An empirical study of a scalable Byzantine agreement algorithm," 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW), Atlanta, GA, USA, 2010, pp. 1-13.
doi:10.1109/IPDPSW.2010.5470874
78 ms
(Ver 3.3 (11022016))