The Average-Case Complexity of Determining the Majority
From MaRDI portal
(Redirected from Publication:4337428)
Recommendations
Cited in
(24)- Randomized strategies for the plurality problem
- On randomized algorithms for the majority problem
- The worst-case chip problem
- Tight bounds on plurality
- On computing majority by comparisons
- Determining the majority: The biased case
- Variants of the majority problem.
- Finding modes with equality comparisons
- From discrepancy to majority
- New applications of the incompressibility method. II
- Truth tellers and liars with fewer questions
- Analysis of Boyer and Moore's \texttt{MJRTY} algorithm
- Computing majority via multiple queries
- Finding mode using equality comparisons
- Randomized algorithms for the majority problem
- scientific article; zbMATH DE number 6851888 (Why is no real title available?)
- Average-case lower bounds for the plurality problem
- Searching for majority with k-tuple queries
- The plurality problem with three colors and more.
- Search for a majority element
- On approximate majority and probabilistic time
- Determining the majority
- Computing majority with triple queries
- How to play the majority game with a liar
This page was built for publication: The Average-Case Complexity of Determining the Majority
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337428)