2084 search results - page 39 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
90
Voted
ESA
2001
Springer
15 years 2 months ago
2001
Springer
Computing the Delaunay triangulation of n points requires usually a minimum of (n log n) operations, but in some special cases where some additional knowledge is provided, faster a...
121
click to vote
SIGECOM
2011
ACM
14 years 15 days ago
2011
ACM
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
100
click to vote
STOC
2006
ACM
15 years 10 months ago
2006
ACM
Classes of graphs with bounded expansion have been introduced in [15], [12]. They generalize both proper minor closed classes and classes with bounded degree. For any class with b...
85
Voted
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
64
Voted
JACM
2011
14 years 4 months ago
2011
We analyze the convergence of randomized trace estimators. Starting at 1989, several algorithms have been proposed for estimating the trace of a matrix by 1 M M i=1 zT i Azi, where...