168 search results - page 5 / 34 » Lower Bounds for Distributed Coin-Flipping and Randomized Co... |
75
Voted
COCOON
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The worst-case complexity of an implementation of Quicksort depends on the random number generator that is used to select the pivot elements. In this paper we estimate th...
98
Voted
EUROCRYPT
2004
Springer
15 years 2 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...
WDAG
1990
Springer
15 years 1 months ago
1990
Springer
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
ICML
2002
IEEE
15 years 10 months ago
2002
IEEE
We study generalization properties of linear learning algorithms and develop a data dependent approach that is used to derive generalization bounds that depend on the margin distr...