Randomized algorithms for the majority problem

DOI10.1016/J.ENDM.2009.07.075MaRDI QIDQ2851502zbMATH OpenOpenAlexFDO

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

Recommendations

• On randomized algorithms for the majority problem
• Randomized algorithms for finding a majority element
• Mathematical Foundations of Computer Science 2003
• Randomized Algorithms for Determining the Majority on Graphs
• scientific article; zbMATH DE number 1182927
• scientific article; zbMATH DE number 819814
• scientific article; zbMATH DE number 3930719
• Algorithmic aspects of majority domination
• On randomized complexity of functions approximating the majority function

Cites work

• On a lemma of Littlewood and Offord
• On computing majority by comparisons
• On randomized algorithms for the majority problem
• Randomized Algorithms for Determining the Majority on Graphs
• The Average-Case Complexity of Determining the Majority
• Variants of the majority problem.

Cited in

(9)

• Algorithmic aspects of majority domination
• Mathematical Foundations of Computer Science 2003
• The weighted majority algorithm
• Randomized algorithms for finding a majority element
• Randomized Algorithms for Determining the Majority on Graphs
• Algorithms and Computation
• On approximate majority and probabilistic time
• On randomized algorithms for the majority problem
• The quantum black-box complexity of majority

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

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