%0 Book Section %1 boyer91 %A Boyer, Robert S. %A Moore, J. Strother %B Automated Reasoning %D 1991 %E Boyer, Robert S. %I Springer Netherlands %K majority %P 105-117 %R 10.1007/978-94-011-3488-0_5 %T MJRTY -- A Fast Majority Vote Algorithm %V 1 %X A new algorithm is presented for determining which, if any, of an arbitrary number of candidates has received a majority of the votes cast in an election. The number of comparisons required is at most twice the number of votes. Furthermore, the algorithm uses storage in a way that permits an efficient use of magnetic tape. A Fortran version of the algorithm is exhibited. The Fortran code has been proved correct by a mechanical verification system for Fortran. The system and the proof are discussed. %@ 978-94-010-5542-0

@incollection{boyer91, abstract = {A new algorithm is presented for determining which, if any, of an arbitrary number of candidates has received a majority of the votes cast in an election. The number of comparisons required is at most twice the number of votes. Furthermore, the algorithm uses storage in a way that permits an efficient use of magnetic tape. A Fortran version of the algorithm is exhibited. The Fortran code has been proved correct by a mechanical verification system for Fortran. The system and the proof are discussed.}, added-at = {2014-03-20T00:58:05.000+0100}, author = {Boyer, Robert S. and Moore, J. Strother}, biburl = {https://www.bibsonomy.org/bibtex/284355a9b520c23b7570caa210a999bd1/ytyoun}, booktitle = {Automated Reasoning}, doi = {10.1007/978-94-011-3488-0_5}, editor = {Boyer, Robert S.}, interhash = {04136ecc9045bab9af90015e549fc7a2}, intrahash = {84355a9b520c23b7570caa210a999bd1}, isbn = {978-94-010-5542-0}, keywords = {majority}, language = {English}, pages = {105-117}, publisher = {Springer Netherlands}, series = {Automated Reasoning Series}, timestamp = {2014-03-21T18:10:46.000+0100}, title = {{MJRTY} -- A Fast Majority Vote Algorithm}, volume = 1, year = 1991 }