Computing majority with triple queries
From MaRDI portal
Publication:690459
DOI10.1016/J.TCS.2012.03.039zbMATH Open1253.68170OpenAlexW2007760711MaRDI QIDQ690459FDOQ690459
Gábor Wiener, Evangelos Kranakis, Gianluca De Marco
Publication date: 27 November 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.03.039
Recommendations
Cites Work
- Optimization of Reduced Dependencies for Synchronous Sequential Machines
- On computing majority by comparisons
- Variants of the majority problem.
- Search for a majority element
- Determining the majority
- Title not available (Why is that?)
- Probabilistic strategies for the partition and plurality problems
- The Average-Case Complexity of Determining the Majority
- STACS 2004
- Mathematical Foundations of Computer Science 2003
- Randomized strategies for the plurality problem
- Oblivious and adaptive strategies for the majority and plurality problems
- Determining plurality
Cited In (12)
- Adaptive majority problems for restricted query graphs and for weighted sets
- Computing majority via multiple queries
- Triple-acyclicity in majorities based on difference in support
- The majority game with an arbitrary majority
- Searching for majority with k-tuple queries
- Finding a majority ball with majority answers
- A plurality problem with three colors and query size three
- Finding non-minority balls with majority and plurality queries
- Adaptive majority problems for restricted query graphs and for weighted sets
- Finding a non-minority ball with majority answers
- From discrepancy to majority
- Majority problems of large query size
This page was built for publication: Computing majority with triple queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690459)
