Sciweavers

TALG
2008
97views more  TALG 2008»
13 years 4 months ago
Average-case lower bounds for the plurality problem
Given a set of n elements, each of which is colored one of c 2 colors, we must determine an element of the plurality (most frequently occurring) color by pairwise equal/unequal co...
Laurent Alonso, Edward M. Reingold