Tight bounds for k-set agreement

@article{Chaudhuri2000TightBF,
  title={Tight bounds for k-set agreement},
  author={Soma Chaudhuri and Maurice Herlihy and Nancy A. Lynch and Mark R. Tuttle},
  journal={J. ACM},
  year={2000},
  volume={47},
  pages={912-943}
}
We prove tight bounds on the time needed to solve <?Pub Fmt italic>k-set agreement<?Pub Fmt /italic>. In this problem, each processor starts with an arbitrary input value taken from a fixed set, and halts after choosing an output value. In every execution, at most <?Pub Fmt italic>k<?Pub Fmt /italic> distinct output values may be chosen, and every processor's output value must be some processor's input value. We analyze this problem in a synchronous, message-passing model where processors fail… CONTINUE READING
Highly Cited
This paper has 70 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 41 extracted citations

71 Citations

01020'01'04'08'12'16
Citations per Year
Semantic Scholar estimates that this publication has 71 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…