@inproceedings{d76274644ff047dbafa124adb50130f3,

title = "Brief announcement: Pareto optimal solutions to consensus and set consensus",

abstract = "A protocol P is Pareto-optimal if no protocol Q can decide as fast as P for all adversaries, while allowing at least one process to decide strictly earlier, in at least one instance. Pareto optimal protocols cannot be improved upon. We present the first Pareto-optimal solutions to consensus and k-set consensus for synchronous message-passing with crashes failures. Our k-set consensus protocol strictly dominates all known solutions, and our results expose errors in [1, 7, 8, 12]. Our proofs of Pareto optimality are completely constructive, and are devoid of any topological arguments or reductions.",

keywords = "Consensus, K-set consensus, Knowledge, Optimality",

author = "Armando Casta{\~n}eda and Gonczarowski, {Yannai A.} and Yoram Moses",

year = "2013",

doi = "10.1145/2484239.2484280",

language = "אנגלית",

isbn = "9781450320658",

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

publisher = "Association for Computing Machinery",

pages = "113--115",

booktitle = "PODC 2013 - Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing",

note = "2013 ACM Symposium on Principles of Distributed Computing, PODC 2013 ; Conference date: 22-07-2013 Through 24-07-2013",

}