An Efficient Solution to the k-Set Agreement Problem

Emmanuelle Anceaume, Michel Hurfin, Philippe Raipin Parvédy. An Efficient Solution to the k-Set Agreement Problem. In Fabrizio Grandoni 0002, Pascale Thévenod-Fosse, editors, Dependable Computing - EDCC-4, 4th European Dependable Computing Conference, Toulouse, France, October 23-25, 2002, Proceedings. Volume 2485 of Lecture Notes in Computer Science, pages 62-78, Springer, 2002. [doi]

@inproceedings{AnceaumeHP02,
  title = {An Efficient Solution to the k-Set Agreement Problem},
  author = {Emmanuelle Anceaume and Michel Hurfin and Philippe Raipin Parvédy},
  year = {2002},
  url = {http://link.springer.de/link/service/series/0558/bibs/2485/24850062.htm},
  researchr = {https://researchr.org/publication/AnceaumeHP02},
  cites = {0},
  citedby = {0},
  pages = {62-78},
  booktitle = {Dependable Computing - EDCC-4, 4th European Dependable Computing Conference, Toulouse, France, October 23-25, 2002, Proceedings},
  editor = {Fabrizio Grandoni 0002 and Pascale Thévenod-Fosse},
  volume = {2485},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-00012-7},
}