Randomized strategies for the plurality problem
From MaRDI portal
Publication:1003477
DOI10.1016/j.dam.2008.05.014zbMath1156.91306OpenAlexW2071164269WikidataQ57601494 ScholiaQ57601494MaRDI QIDQ1003477
Daniel Král', Jiří Sgall, Tomas Tichý
Publication date: 4 March 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2008.05.014
Related Items (5)
Computing majority via multiple queries ⋮ From discrepancy to majority ⋮ Computing majority with triple queries ⋮ A plurality problem with three colors and query size three ⋮ Searching for majority with k-tuple queries
Cites Work
- The plurality problem with three colors and more.
- Determining the majority
- A guided tour of Chernoff bounds
- The worst-case chip problem
- On computing majority by comparisons
- Variants of the majority problem.
- Probabilistic strategies for the partition and plurality problems
- Randomized Algorithms for Determining the Majority on Graphs
- The Average-Case Complexity of Determining the Majority
- STACS 2004
- Unnamed Item
- Unnamed Item
This page was built for publication: Randomized strategies for the plurality problem
