Finding non-minority balls with majority and plurality queries
From MaRDI portal
(Redirected from Publication:777450)
Abstract: Given a set of colored balls, a extit{majority, non-minority or plurality ball} is one whose color class has size more than , at least or larger than any other color class, respectively. We describe linear time algorithms for finding non-minority balls using query sets of size of the following form: the answer to a majority/plurality query is a majority/plurality ball in or the statement that there is no such ball in .
Recommendations
Cites work
- Computing majority via multiple queries
- Computing majority with triple queries
- Finding a non-minority ball with majority answers
- From discrepancy to majority
- Majority and plurality problems
- On computing majority by comparisons
- The plurality problem with three colors and more.
- Variants of the majority problem.
Cited in
(8)- Adaptive majority problems for restricted query graphs and for weighted sets
- Computing majority via multiple queries
- Adaptive majority problems for restricted query graphs and for weighted sets
- A plurality problem with three colors and query size three
- Majority and plurality problems
- On non-adaptive majority problems of large query size
- Finding a non-minority ball with majority answers
- Majority and plurality problems
This page was built for publication: Finding non-minority balls with majority and plurality queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q777450)