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 条
  • [41] A fast Boyer-Moore type pattern matching algorithm for highly similar sequences
    Ben Nsira, Nadia
    Lecroq, Thierry
    Elloumi, Mourad
    INTERNATIONAL JOURNAL OF DATA MINING AND BIOINFORMATICS, 2015, 13 (03) : 266 - 288
  • [42] BOYER-MOORE AUTOMATION FOR THE HOL SYSTEM
    BOULTON, RJ
    IFIP TRANSACTIONS A-COMPUTER SCIENCE AND TECHNOLOGY, 1993, 20 : 133 - 142
  • [43] A RAMSEY THEOREM IN BOYER-MOORE LOGIC
    KUNEN, K
    JOURNAL OF AUTOMATED REASONING, 1995, 15 (02) : 217 - 235
  • [44] APPROXIMATE BOYER-MOORE STRING MATCHING
    TARHIO, J
    UKKONEN, E
    SIAM JOURNAL ON COMPUTING, 1993, 22 (02) : 243 - 260
  • [45] Accelerating Boyer Moore searches on binary texts
    Klein, Shmuel T.
    Ben-Nissan, Miri Kopel
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2007, 4783 : 130 - 143
  • [46] A Framework for Parallel Boyer-Moore-Quick Search Algorithm (P-BM-QS)
    Faber, Khalid Mohammad
    Ibrahim, Dyala R.
    Al-Sanhani, Asma H.
    Hamad, Nesreen A.
    VISION 2020: SUSTAINABLE ECONOMIC DEVELOPMENT, INNOVATION MANAGEMENT, AND GLOBAL GROWTH, VOLS I-IX, 2017, 2017, : 1623 - 1628
  • [47] Ramsey theorem in Boyer-Moore logic
    Kunen, Kenneth
    Journal of Automated Reasoning, 1995, 15 (02): : 217 - 235
  • [48] Programmable SoC platform for Deep Packet Inspection using enhanced Boyer-Moore algorithm
    Dominguez, Adrian
    Carballo, Pedro P.
    Nunez, Antonio
    2017 12TH INTERNATIONAL SYMPOSIUM ON RECONFIGURABLE COMMUNICATION-CENTRIC SYSTEMS-ON-CHIP (RECOSOC), 2017,
  • [49] A Method for Web Application Vulnerabilities Detection by Using Boyer-Moore String Matching Algorithm
    Saleh, Ain Zubaidah Mohd
    Rozali, Nur Amizah
    Buja, Alya Geogiana
    Jalil, Kamarularifin Abd.
    Ali, Fakariah Hani Mohd
    Rahman, Teh Faradilla Abdul
    THIRD INFORMATION SYSTEMS INTERNATIONAL CONFERENCE 2015, 2015, 72 : 112 - 121
  • [50] Average Case Analysis of Moore's State Minimization Algorithm
    Bassino, Frederique
    David, Julien
    Nicaud, Cyril
    ALGORITHMICA, 2012, 63 (1-2) : 509 - 531
12345