Search for Author All Reviews
	King, Valerie     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 3 of 3 reviews       Fast asynchronous Byzantine agreement and leader election with full information Kapron B., Kempe D., King V., Saia J., Sanwalani V. ACM Transactions on Algorithms 6(4): 1-28, 2010.  Type: Article This substantial monograph addresses two open problems in the field of distributed computing: the Byzantine agreement problem and the leader election problem. The context is a model that is asynchronous with full information and involv...... Nov 11 2010     Randomized fully dynamic graph algorithms with polylogarithmic time per operation Henzinger M., King V. Journal of the ACM 46(4): 502-516, 1999.  Type: Article The authors present a technique for designing fully dynamic algorithms with polylogarithmic time per operation for dynamically testing several graph properties. The technique combines a new graph decomposition and randomization. The ed...... Mar 1 2000     Optimal randomized algorithms for local sorting and set-maxima Goddard W., Kenyon C., King V., Schulman L. SIAM Journal on Computing 22(2): 272-283, 1993.  Type: Article Goddard et al. discuss two apparently distinct problems that can be approached using randomized algorithms--the local sorting of vertices in a graph and set-maxima. In both cases, the number of comparisons that need to be made...... Jun 1 1994
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy