Tight bounds on plurality

Authors:
Nikhil Srivastava;Alan D. Taylor
Affiliations:
Department of Mathematics, Union College, Schenectady, NY;Department of Mathematics, Union College, Schenectady, NY
Venue:
Information Processing Letters
Year:
2005

Citing 2
Cited 2

Determining the majority

Information Processing Letters
The Average-Case Complexity of Determining the Majority

SIAM Journal on Computing

Determining plurality

ACM Transactions on Algorithms (TALG)
Average-case analysis of some plurality algorithms

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.89

Visualization

Abstract

We show that (n-1/2) pairwise equality comparisons are necessary and sufficient (in the worst case) to find a plurality in n colored balls.