2084 search results - page 37 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
119
click to vote
SODA
2004
ACM
15 years 3 months ago
2004
ACM
We present the first optimal algorithm to compute the maximum Tukey depth (also known as location or halfspace depth) for a non-degenerate point set in the plane. The algorithm is...
153
click to vote
DFG
1992
Springer
15 years 6 months ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
106
click to vote
APPROX
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
FS
2006
15 years 2 months ago
2006
Abstract The problem of finding the best-possible lower bound on the distribution of a non-decreasing function of n dependent risks is solved when n = 2 and a lower bound on the co...
213
click to vote
ICDT
2009
ACM
16 years 3 months ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...