On randomized algorithms for the majority problem

DOI10.1016/J.DAM.2008.10.001zbMath1186.68330OpenAlexW1983986780MaRDI QIDQ1028119

Demetres Christofides

Publication date: 30 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.10.001

zbMATH Keywords

randomized algorithmsmajority problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)

Related Items (2)

Computing majority via multiple queries ⋮ Randomized algorithms for the majority problem

Cites Work

• Unnamed Item
• Unnamed Item
• Determining the majority
• On computing majority by comparisons
• Variants of the majority problem.
• Randomized Algorithms for Determining the Majority on Graphs
• The Average-Case Complexity of Determining the Majority
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• On a lemma of Littlewood and Offord
• Search for a majority element

This page was built for publication: On randomized algorithms for the majority problem