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 条
  • [21] ON BOYER-MOORE AUTOMATA
    BAEZAYATES, RA
    CHOFFRUT, C
    GONNET, GH
    ALGORITHMICA, 1994, 12 (4-5) : 268 - 292
  • [22] A New Method to Obtain the shift-table in Boyer-Moore's String Matching Algorithm
    Wang, Yang
    19TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOLS 1-6, 2008, : 3282 - 3285
  • [23] Research on intrusion detection based on Boyer-Moore pattern matching algorithm
    Li, Yulong
    Li, Chenhao
    Jiao, Yang
    Zhao, Guogang
    Liu, Yang
    Zhang, Tian
    PROCEEDINGS OF 2023 7TH INTERNATIONAL CONFERENCE ON ELECTRONIC INFORMATION TECHNOLOGY AND COMPUTER ENGINEERING, EITCE 2023, 2023, : 1490 - 1494
  • [24] ON IMPROVING THE AVERAGE CASE OF THE BOYER-MOORE STRING MATCHING ALGORITHM.
    Zhu Rui Feng
    Takaoka, Tadao
    Journal of information processing, 1987, 10 (03) : 173 - 177
  • [25] On obtaining the Boyer-Moore string-matching algorithm by partial evaluation
    Danvy, Olivier
    Rohde, Henning Korsholm
    INFORMATION PROCESSING LETTERS, 2006, 99 (04) : 158 - 162
  • [26] High performance parallelization of Boyer–Moore algorithm on many-core accelerators
    Yosang Jeong
    Myungho Lee
    Dukyun Nam
    Jik-Soo Kim
    Soonwook Hwang
    Cluster Computing, 2015, 18 : 1087 - 1098
  • [27] FASTER STRING SEARCHES - BOYER-MOORE MAY BE THE ALGORITHM YOU NEED
    MENICO, C
    DR DOBBS JOURNAL, 1989, 14 (07): : 74 - 75
  • [28] TIGHT BOUNDS ON THE COMPLEXITY OF THE BOYER-MOORE STRING-MATCHING ALGORITHM
    COLE, R
    SIAM JOURNAL ON COMPUTING, 1994, 23 (05) : 1075 - 1091
  • [29] Enhanced pattern matching performance using improved boyer moore horspool Algorithm
    Hong, D. (dear_red9@163.com), 1600, Advanced Institute of Convergence Information Technology (07):
  • [30] Searching BWT compressed text with the Boyer-Moore algorithm and binary search
    Bell, T
    Powell, M
    Mukherjee, A
    Adjeroh, D
    DCC 2002: DATA COMPRESSION CONFERENCE, PROCEEDINGS, 2002, : 112 - 121
12345