Searching for majority with k-tuple queries

DOI10.1142/S1793830915500093zbMath1332.68017OpenAlexW2050463416MaRDI QIDQ5261043

Gianluca De Marco, Evangelos Kranakis

Publication date: 1 July 2015

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830915500093

zbMATH Keywords

majority problem\(k\)-tuple queriescolored ballsfault-tolerant testing

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (6)

Finding a majority ball with majority answers ⋮ Majority problems of large query size ⋮ Finding a non-minority ball with majority answers ⋮ From discrepancy to majority ⋮ A plurality problem with three colors and query size three ⋮ On non-adaptive majority problems of large query size

Cites Work

• Unnamed Item
• The plurality problem with three colors and more.
• Determining the majority
• Computing majority with triple queries
• Randomized strategies for the plurality problem
• On computing majority by comparisons
• Variants of the majority problem.
• Oblivious and adaptive strategies for the majority and plurality problems
• Probabilistic strategies for the partition and plurality problems
• The Average-Case Complexity of Determining the Majority

This page was built for publication: Searching for majority with k-tuple queries