Randomized Algorithms for Finding a Majority Element

@article{Gawrychowski2016RandomizedAF,
  title={Randomized Algorithms for Finding a Majority Element},
  author={Pawel Gawrychowski and J. Suomela and P. Uznanski},
  journal={ArXiv},
  year={2016},
  volume={abs/1603.01583}
}
Given n colored balls, we want to detect if more than n/2 of them have the same color, and if so find one ball with such majority color. We are only allowed to choose two balls and compare their colors, and the goal is to minimize the total number of such operations. A well-known exercise is to show how to find such a ball with only 2n comparisons while using only a logarithmic number of bits for bookkeeping. The resulting algorithm is called the Boyer-Moore majority vote algorithm. It is known… Expand
2 Citations
Majority problems of large query size
  • 5
  • PDF
Technical Report Column
  • 1

References

SHOWING 1-10 OF 34 REFERENCES
On randomized algorithms for the majority problem
  • 3
  • PDF
Randomized algorithms for the majority problem
  • 1
  • PDF
Oblivious and Adaptive Strategies for the Majority and Plurality Problems
  • 13
  • PDF
Majority and Plurality Problems
  • 9
  • PDF
Finding a majority ball with majority answers
  • 5
  • PDF
Randomized strategies for the plurality problem
  • 19
The plurality problem with three colors and more
  • 23
Searching for majority with k-tuple queries
  • 8
From Discrepancy to Majority
  • 7
  • PDF
The Average-Case Complexity of Determining the Majority
  • 56
...
1
2
3
4
...