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 条
  • [1] Average case analysis of the Boyer-Moore algorithm
    Tsai, Tsung-Hsi
    RANDOM STRUCTURES & ALGORITHMS, 2006, 28 (04) : 481 - 498
  • [2] A VARIATION ON THE BOYER-MOORE ALGORITHM
    LECROQ, T
    THEORETICAL COMPUTER SCIENCE, 1992, 92 (01) : 119 - 144
  • [3] ON THE EXPECTED SUBLINEARITY OF THE BOYER-MOORE ALGORITHM
    SCHABACK, R
    SIAM JOURNAL ON COMPUTING, 1988, 17 (04) : 648 - 658
  • [4] Tuning the Boyer-Moore-Horspool string searching algorithm
    Raita, Timo
    Software - Practice and Experience, 1992, 22 (10) : 879 - 884
  • [5] TUNING THE BOYER-MOORE-HORSPOOL STRING SEARCHING ALGORITHM
    RAITA, T
    SOFTWARE-PRACTICE & EXPERIENCE, 1992, 22 (10): : 879 - 884
  • [6] A Boyer-Moore Type Algorithm for Timed Pattern Matching
    Waga, Masaki
    Akazaki, Takumi
    Hasuo, Ichiro
    FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, FORMATS 2016, 2016, 9884 : 121 - 139
  • [7] ON TUNING THE BOYER-MOORE-HORSPOOL STRING SEARCHING ALGORITHM
    SMITH, PD
    SOFTWARE-PRACTICE & EXPERIENCE, 1994, 24 (04): : 435 - 436
  • [8] Fingerprint Identification using Bozorth and Boyer-Moore Algorithm
    Supatmi, S.
    Sumitra, I. D.
    2ND INTERNATIONAL CONFERENCE ON INFORMATICS, ENGINEERING, SCIENCE, AND TECHNOLOGY (INCITEST 2019), 2019, 662
  • [9] AVERAGE RUNNING TIME OF THE BOYER-MOORE-HORSPOOL ALGORITHM
    BAEZAYATES, RA
    REGNIER, M
    THEORETICAL COMPUTER SCIENCE, 1992, 92 (01) : 19 - 31
  • [10] A Boyer-Moore type algorithm for compressed pattern matching
    Shibata, Y
    Matsumoto, T
    Takeda, M
    Shinohara, A
    Arikawa, S
    COMBINATORIAL PATTERN MATCHING, 2000, 1848 : 181 - 194
12345