New Applications of the Incompressibility Method
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Average-Case Quantum Query Complexity
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Information Processing Letters
Combinatorics, Probability and Computing
The plurality problem with three colors and more
Theoretical Computer Science
Information Processing Letters
Randomized Algorithms for Determining the Majority on Graphs
Combinatorics, Probability and Computing
ACM Transactions on Algorithms (TALG)
Average-case lower bounds for the plurality problem
ACM Transactions on Algorithms (TALG)
How to Play the Majority Game with Liars
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Randomized strategies for the plurality problem
Discrete Applied Mathematics
Average-case analysis of some plurality algorithms
ACM Transactions on Algorithms (TALG)
On randomized algorithms for the majority problem
Discrete Applied Mathematics
Information Processing Letters
Computing majority with triple queries
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Oblivious and adaptive strategies for the majority and plurality problems
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Computing majority with triple queries
Theoretical Computer Science
Analysis of Boyer and Moore's MJRTY algorithm
Information Processing Letters
| Hi-index | 0.00 |
Given a set of $n$ elements each of which is either red or blue, it is known that in the worst case $n-\nu(n)$ pairwise equal/not equal color comparisons are necessary and sufficient to determine the majority color, where $\nu(n)$ is the number of 1-bits in the binary representation of $n$. We prove that $\frac{2n}{3} - \sqrt\frac{8n}{9\pi} + O(\log n)$ such comparisons are necessary and sufficient in the average case.