2084 search results - page 28 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
ICC
2007
IEEE
14 years 4 months ago
2007
IEEE
— Many distributed multiple access (MAC) protocols use an exponential backoff mechanism. In that mechanism, a node picks a random backoff time uniformly in an interval that doubl...
ECCC
2008
13 years 9 months ago
2008
We obtain the first nontrivial time-space lower bound for quantum algorithms solving problems related to satisfiability. Our bound applies to MajSAT and MajMajSAT, which are compl...
EUROCRYPT
2004
Springer
14 years 3 months ago
2004
Springer
We prove a tight lower bound for generic protocols for secure multicast key distribution where the messages sent by the group manager for rekeying the group are obtained by arbitra...
EUROCRYPT
1999
Springer
14 years 2 months ago
1999
Springer
We prove the first general and non-trivial lower bound for the number of times a 1-out-of-n Oblivious Transfer of strings of length should be invoked so as to obtain, by an inform...
CDC
2009
IEEE
13 years 7 months ago
2009
IEEE
Abstract-- The problem of finding the eigenvector corresponding to the largest eigenvalue of a stochastic matrix has numerous applications in ranking search results, multi-agent co...