Randomized algorithms for the majority problem

DOI10.1016/J.ENDM.2009.07.075zbMath1273.68402OpenAlexW2179912936MaRDI QIDQ2851502

Demetres Christofides

Publication date: 10 October 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.075

zbMATH Keywords

randomized algorithmsmajority problem

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Randomized algorithms (68W20)

Cites Work

• On randomized algorithms for the majority problem
• 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
• On a lemma of Littlewood and Offord

This page was built for publication: Randomized algorithms for the majority problem