Searching for majority with k-tuple queries

DOI10.1142/S1793830915500093MaRDI QIDQ5261043zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Computing majority with triple queries
• Computing majority with triple queries
• Computing majority via multiple queries
• Majority problems of large query size
• Finding a majority ball with majority answers

Cites work

• scientific article; zbMATH DE number 5174567 (Why is no real title available?)
• Computing majority with triple queries
• Determining the majority
• Oblivious and adaptive strategies for the majority and plurality problems
• On computing majority by comparisons
• Probabilistic strategies for the partition and plurality problems
• Randomized strategies for the plurality problem
• The Average-Case Complexity of Determining the Majority
• The plurality problem with three colors and more.
• Variants of the majority problem.

Cited in

(9)

• Computing majority via multiple queries
• Computing majority with triple queries
• Finding a majority ball with majority answers
• A plurality problem with three colors and query size three
• On non-adaptive majority problems of large query size
• Finding a non-minority ball with majority answers
• From discrepancy to majority
• The Shapley Value of Tuples in Query Answering.
• Majority problems of large query size

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261043)