research article
A Topological Treatment of Early-Deciding Set-Agreement
The k-set-agreement problem consists for a set of n processes to agree on less than k among n possibly different Values, each initially known to only one process. The problem is at the heart of distributed computing and generalizes the celebrated consensus problem.
Type
research article
Web of Science ID
WOS:000263635200009
Author(s)
Date Issued
2009
Published in
Volume
410
Issue
6-7
Start page
570
End page
580
Editorial or Peer reviewed
REVIEWED
Written at
EPFL
EPFL units
Available on Infoscience
June 11, 2008
Use this identifier to reference this record