13 search results - page 1 / 3 » Tight bounds for k-set agreement |
FOCS
1993
IEEE
13 years 9 months ago
1993
IEEE
: Weprove tight bounds on the time needed to solve k-set agreement, a natural generalization of consensus. We analyze this problem in a synchronous, message-passing model where pro...
CORR
2011
Springer
13 years 8 days ago
2011
Springer
In this paper we consider the k-set agreement problem in distributed round-based systems where processes communicate by message passing. We capture the synchrony and reliability o...
TIT
2008
13 years 4 months ago
2008
Abstract--In the bounded-storage model (BSM) for information-theoretic secure encryption and key agreement, one makes use of a random string R whose length t is greater than the as...
JACM
2000
13 years 5 months ago
2000
STOC
2005
ACM
14 years 5 months ago
2005
ACM
Assume that Alice and Bob, given an authentic channel, have a protocol where they end up with a bit SA and SB, respectively, such that with probability 1+ 2 these bits are equal. ...