B. Boyer and J. Moore. A fast majority vote algorithm. Technical Report 35, Institute for Computer Science, University of Texas, 1982. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Formal Verification for Fault-Tolerant.. - Owre, Rushby.. (1995) (221 citations) (Correct)
.... we had identi ed our mistake, we were able to repair it and to develop and formally verify a new and correct algorithm for Interactive Consistency under a hybrid fault model [41] 42] And this time, we did verify an implementation (a modi ed version of the Boyer Moore linear time MJRTY algorithm [43]) against our axioms for a hybrid majority voter [44] Overall, this work took less than two weeks, and was primarily undertaken by Pat Lincoln as his rst exercise in mechanized formal veri cation using PVS. As with clock synchronization, availability of a formally veri ed algorithm for hybrid ....
Robert S. Boyer and J Strother Moore, \MJRTY|a fast majority vote algorithm", in Automated Reasoning: Essays in Honor of Woody Bledsoe, Robert S. Boyer, Ed., vol. 1 of Automated Reasoning Series, pp. 105-117. Kluwer Academic Publishers, Dordrecht, The Netherlands, 1991.
Reasoning About Functional Programs in Nuprl - Howe (1993) (12 citations) (Correct)
....2 The Majority Algorithm A poll is an array p[0: i Gamma 1] of candidates (i 0) The vote count for a candidate c is the number k of distinct j, 0 j i, such that p[j] c. c has a majority if 2k i. The problem is to find the majority candidate if one exists. Boyer and Moore s solution [7] is a very simple algorithm: step through the poll from start to end, keeping track of a single leading candidate c, arbitrary initially, and the size l of his lead , 0 initially. At each step, if the next candidate a in the poll is c, increase l by one. If a 6= c, decrease l by one, unless l = ....
R. Boyer and J. Moore. MJRTY, a fast majority vote algorithm. Technical report, University of Texas at Austin, 1981.
What's Hot and What's Not: Tracking Most Frequent Items.. - Cormode, Muthukrishnan (2003) (13 citations) (Correct)
No context found.
B. Boyer and J. Moore. A fast majority vote algorithm. Technical Report 35, Institute for Computer Science, University of Texas, 1982.
Local Flow Separation - Liberatore (Correct)
No context found.
B. Boyer and J. Moore, "A fast majority vote algorithm," Institute for Computer Science, University of Texas, Tech. Rep. 35, 1982.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC