2084 search results - page 25 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
136
click to vote
ESA
2009
Springer
15 years 8 months ago
2009
Springer
We introduce the First Fit Matching Periods algorithm for rate-monotonic multiprocessor scheduling of periodic tasks with implicit deadlines and show that it yields asymptotically...
130
click to vote
SIAMCOMP
2000
15 years 2 months ago
2000
This paper presents a lower bound of (D + n/ log n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of ...
114
Voted
ECCC
2010
14 years 11 months ago
2010
We consider the randomized decision tree complexity of the recursive 3-majority function. For evaluating a height h formulae, we prove a lower bound for the -two-sided-error rando...
139
click to vote
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
112
click to vote
IPPS
1997
IEEE
15 years 6 months ago
1997
IEEE
We present a new randomized sorting algorithm on the Bulk-SynchronousParallel (BSP) model. The algorithm improves upon the parallel slack of previous algorithms to achieve optimal...