Analysis of Boyer and Moore's MJRTY algorithm

被引：3
|
作者：
Alonso, Laurent [1 ,2 ]
Reingold, Edward M. [3 ]
机构：
[1] Univ Nancy 1, INRIA Lorraine, F-54506 Vandoeuvre Les Nancy, France
[2] Univ Nancy 1, LORIA, F-54506 Vandoeuvre Les Nancy, France
[3] IIT, Dept Comp Sci, Chicago, IL 60616 USA
来源：
INFORMATION PROCESSING LETTERS | 2013年 / 113卷 / 13期
关键词：
Analysis of algorithms; Majority problem; MAJORITY;
D O I：
10.1016/j.ipl.2013.04.005
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Given a set of n elements each of which is either red or blue, Boyer and Moore's MJRTY algorithm uses pairwise equal/not equal color comparisons to determine the majority color. We analyze the average behavior of their algorithm, proving that if all 2(n) possible inputs are equally likely, the average number of color comparisons used is n - root 2n/pi + O(1) with variance (pi - 2)n/pi - root 2n/pi + O(1). (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码：495 / 497
页数：3
相关论文
共 50 条
  • [31] On the size of Boyer-Moore automata
    Baeza-Yates, Ricardo
    Bruyere, Veronique
    Delgrange, Olivier
    Scheihing, Rodrigo
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (43) : 4432 - 4443
  • [32] High performance parallelization of Boyer-Moore algorithm on many-core accelerators
    Jeong, Yosang
    Lee, Myungho
    Nam, Dukyun
    Kim, Jik-Soo
    Hwang, Soonwook
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2015, 18 (03): : 1087 - 1098
  • [33] High Performance Parallelization of Boyer-Moore Algorithm on Many-Core Accelerators
    Jeong, Yosang
    Lee, Myungho
    Nam, Dukyun
    Kim, Jik-Soo
    Hwang, Soonwook
    2014 INTERNATIONAL CONFERENCE ON CLOUD AND AUTONOMIC COMPUTING (ICCAC 2014), 2014, : 265 - 272
  • [34] Left-to-right preprocessing computation for the Boyer-Moore string matching algorithm
    Ibaraki Univ, Ibaraki, Japan
    Comput J, 5 (413-416):
  • [35] Boyer-Moore Algorithm in retrieving deleted Short Message Service in Android Platform
    Rahmat, R. F.
    Prayoga, D. F.
    Gunawan, D.
    Sitompul, O. S.
    10TH INTERNATIONAL CONFERENCE NUMERICAL ANALYSIS IN ENGINEERING, 2018, 308
  • [36] IMPROVING THE WORST CASE RUNNING TIME OF THE BOYER-MOORE STRING MATCHING ALGORITHM
    GALIL, Z
    COMMUNICATIONS OF THE ACM, 1979, 22 (09) : 505 - 508
  • [37] Analysis of Boyer-Moore-Horspool string-matching heuristic
    Mahmoud, HM
    Smythe, RT
    Regnier, M
    RANDOM STRUCTURES & ALGORITHMS, 1997, 10 (1-2) : 169 - 186
  • [38] A left-to-right preprocessing computation for the Boyer-Moore string matching algorithm
    Takaoka, T
    COMPUTER JOURNAL, 1996, 39 (05): : 413 - 416
  • [39] A Mechanically Checked Proof of the Correctness of the Boyer-Moore Fast String Searching Algorithm
    Moore, J. Strother
    Martinez, Matt
    ENGINEERING METHODS AND TOOLS FOR SOFTWARE SAFETY AND SECURITY, 2009, 22 : 267 - 284
  • [40] Efficient Extraction Method for Biological Data Using Boyer-Moore Search Algorithm
    Jaber, Khalid Mohammad
    Al-Khatib, Ra'ed M.
    Taghizadeh, Alireza
    Al-Khateeb, Asef
    CREATING GLOBAL COMPETITIVE ECONOMIES: 2020 VISION PLANNING & IMPLEMENTATION, VOLS 1-3, 2013, : 1274 - +
12345