Easy impossibility proofs for k-set agreement in message passing systems

Martin Biely; Peter Robinson; Ulrich Schmid

doi:10.1145/1993806.1993846

Easy impossibility proofs for k-set agreement in message passing systems

Martin Biely, Peter Robinson, Ulrich Schmid

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Original language	English (US)
Title of host publication	PODC'11 - Proceedings of the 2011 ACM Symposium Principles of Distributed Computing
Pages	227-228
Number of pages	2
DOIs	https://doi.org/10.1145/1993806.1993846
State	Published - 2011
Externally published	Yes
Event	30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC'11, Held as Part of the 5th Federated Computing Research Conference, FCRC - San Jose, CA, United States Duration: Jun 6 2011 → Jun 8 2011

Publication series

Name	Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference	30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC'11, Held as Part of the 5th Federated Computing Research Conference, FCRC
Country/Territory	United States
City	San Jose, CA
Period	6/6/11 → 6/8/11

Keywords

asynchonous system
failure detectors
impossibility
k-set agreement

ASJC Scopus subject areas

Software
Hardware and Architecture
Computer Networks and Communications

Access to Document

10.1145/1993806.1993846

Cite this

Easy impossibility proofs for k-set agreement in message passing systems. / Biely, Martin; Robinson, Peter; Schmid, Ulrich.
PODC'11 - Proceedings of the 2011 ACM Symposium Principles of Distributed Computing. 2011. p. 227-228 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Biely, M, Robinson, P & Schmid, U 2011, Easy impossibility proofs for k-set agreement in message passing systems. in PODC'11 - Proceedings of the 2011 ACM Symposium Principles of Distributed Computing. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, pp. 227-228, 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC'11, Held as Part of the 5th Federated Computing Research Conference, FCRC, San Jose, CA, United States, 6/6/11. https://doi.org/10.1145/1993806.1993846

@inproceedings{d5de3a5873fc47768ba1b24b953415de,

title = "Easy impossibility proofs for k-set agreement in message passing systems",

keywords = "asynchonous system, failure detectors, impossibility, k-set agreement",

author = "Martin Biely and Peter Robinson and Ulrich Schmid",

year = "2011",

doi = "10.1145/1993806.1993846",

language = "English (US)",

isbn = "9781450307192",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

pages = "227--228",

booktitle = "PODC'11 - Proceedings of the 2011 ACM Symposium Principles of Distributed Computing",

note = "30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC'11, Held as Part of the 5th Federated Computing Research Conference, FCRC ; Conference date: 06-06-2011 Through 08-06-2011",

}

TY - GEN

T1 - Easy impossibility proofs for k-set agreement in message passing systems

AU - Biely, Martin

AU - Robinson, Peter

AU - Schmid, Ulrich

PY - 2011

Y1 - 2011

KW - asynchonous system

KW - failure detectors

KW - impossibility

KW - k-set agreement

UR - http://www.scopus.com/inward/record.url?scp=79959873681&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79959873681&partnerID=8YFLogxK

U2 - 10.1145/1993806.1993846

DO - 10.1145/1993806.1993846

M3 - Conference contribution

AN - SCOPUS:79959873681

SN - 9781450307192

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 227

EP - 228

BT - PODC'11 - Proceedings of the 2011 ACM Symposium Principles of Distributed Computing

T2 - 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC'11, Held as Part of the 5th Federated Computing Research Conference, FCRC

Y2 - 6 June 2011 through 8 June 2011

ER -

Easy impossibility proofs for k-set agreement in message passing systems

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this