Randomized strategies for the plurality problem

This publication has 14 references indexed in Scilit:

• Probabilistic strategies for the partition and plurality problems
  Random Structures & Algorithms, 2006
• Randomized Algorithms for Determining the Majority on Graphs
  Combinatorics, Probability and Computing, 2006
• The plurality problem with three colors and more
  Theoretical Computer Science, 2005
• Three Optimal Algorithms for Balls of Three Colors
  Lecture Notes in Computer Science, 2005
• The worst-case chip problem
  Information Processing Letters, 2004
• Variants of the majority problem
  Discrete Applied Mathematics, 2004
• The Average-Case Complexity of Determining the Majority
  SIAM Journal on Computing, 1997
• Determining the majority
  Information Processing Letters, 1993
• On computing majority by comparisons
  Combinatorica, 1991
• A guided tour of chernoff bounds
  Information Processing Letters, 1990