Information Processing Letters
The Average-Case Complexity of Determining the Majority
SIAM Journal on Computing
Mathematics for the Analysis of Algorithms
Mathematics for the Analysis of Algorithms
Information Processing Letters
The plurality problem with three colors and more
Theoretical Computer Science
Information Processing Letters
Average-case lower bounds for the plurality problem
ACM Transactions on Algorithms (TALG)
Oblivious and adaptive strategies for the majority and plurality problems
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Three optimal algorithms for balls of three colors
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Average-case lower bounds for the plurality problem
ACM Transactions on Algorithms (TALG)
Average-case analysis of some plurality algorithms
ACM Transactions on Algorithms (TALG)
Range majority in constant time and linear space
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Computing majority with triple queries
Theoretical Computer Science
Range majority in constant time and linear space
Information and Computation
| Hi-index | 0.00 |
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.775c + 5.9)n + O(c2) color comparisons for c ≥ 9.