Brief Announcement: Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems

Martin Biely, Peter Robinson, Ulrich Schmid

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

1 Citation (Scopus)
Original languageEnglish
Title of host publicationPODC'11 - Proceedings of the 2011 ACM Symposium Principles of Distributed Computing
Pages227-228
DOIs
Publication statusPublished - Jun 2011
Externally publishedYes
Event30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC'11) - San Jose, United States
Duration: 6 Jun 20118 Jun 2011

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC'11)
PlaceUnited States
CitySan Jose
Period6/06/118/06/11

Research Keywords

  • asynchonous system
  • failure detectors
  • impossibility
  • k-set agreement

Cite this