On computing majority by comparisons
From MaRDI portal
Recommendations
Cites work
Cited in
(35)- Randomized strategies for the plurality problem
- On randomized algorithms for the majority problem
- The worst-case chip problem
- Tight bounds on plurality
- Determining the majority: The biased case
- Variants of the majority problem.
- Finding modes with equality comparisons
- Majority problems of large query size
- From discrepancy to majority
- New applications of the incompressibility method. II
- A plurality problem with three colors and query size three
- On the decision tree complexity of threshold functions
- Adaptive majority problems for restricted query graphs and for weighted sets
- On more variants of the majority problem
- Truth tellers and liars with fewer questions
- Analysis of Boyer and Moore's \texttt{MJRTY} algorithm
- Computing majority via multiple queries
- Searching for knights and spies: a majority/minority game
- Finding mode using equality comparisons
- The majority game with an arbitrary majority
- Randomized algorithms for the majority problem
- Finding a majority ball with majority answers
- A New Lower Bound for the Set-Partitioning Problem
- The Average-Case Complexity of Determining the Majority
- On non-adaptive majority problems of large query size
- Finding a non-minority ball with majority answers
- Determining majority in networks with local interactions and very small local memory
- Searching for majority with k-tuple queries
- The plurality problem with three colors and more.
- Search for a majority element
- Adaptive majority problems for restricted query graphs and for weighted sets
- Determining the majority
- Computing majority with triple queries
- Finding non-minority balls with majority and plurality queries
- How to play the majority game with a liar
This page was built for publication: On computing majority by comparisons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1181015)
