Determining plurality-Reference-Cited by-同舟云学术

Determining plurality

Published:2008-06 Issue:3 Volume:4 Page:1-19
ISSN:1549-6325
Container-title:ACM Transactions on Algorithms
language:en
Short-container-title:ACM Trans. Algorithms

Author:

Alonso Laurent¹,Reingold Edward M.²

Affiliation:

1. INRIA-Lorraine, Vandoeuvre-lès-Nancy, France

2. Illinois Institute of Technology, Chicago, IL

Abstract

Given a set of n elements, each of which is colored one of c colors, we must determine an element of the plurality (most frequently occurring) color by pairwise equal/unequal color comparisons of elements. We prove that ( c − 1)( n − c )/2 color comparisons are necessary in the worst case to determine the plurality color and give an algorithm requiring (0.775 c + 5.9) n + O ( c 2 ) color comparisons for c ≥ 9.

Publisher

Association for Computing Machinery (ACM)

Subject

Mathematics (miscellaneous)

Link

https://dl.acm.org/doi/pdf/10.1145/1367064.1367066

Reference19 articles.

1. Variants of the majority problem

2. The plurality problem with three colors and more

3. The worst-case chip problem

4. Alonso L. and Reingold E. M. 2006. Average-case analysis of some plurality algorithms. Submitted for publication. Alonso L. and Reingold E. M. 2006. Average-case analysis of some plurality algorithms. Submitted for publication.

5. Average-case lower bounds for the plurality problem

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A plurality problem with three colors and query size three;Discrete Mathematics;2023-01

2. Searching for majority with k-tuple queries;Discrete Mathematics, Algorithms and Applications;2015-05-25

3. Computing majority via multiple queries;Theoretical Computer Science;2014-06

4. Range majority in constant time and linear space;Information and Computation;2013-01

5. Computing majority with triple queries;Theoretical Computer Science;2012-11