|Title:||A Direct Proof of the Asynchronous Lower Bound for k-Set Consensus
|Abstract:||This paper presents a direct proof, using elementary graph theory, for the impossibility of solving $k$-set consensus in the presence of $f$ failures using only read and write operations, when $k \leq f$.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1998/CS/CS0930), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1998
To the main CS technical reports page
Computer science department, Technion