2924 search results - page 101 / 585 » Lower Bounds in Distributed Computing |
105
click to vote
IPPS
2002
IEEE
15 years 5 months ago
2002
IEEE
Sort can be speeded up on parallel computers by dividing and computing data individually in parallel. Merge sort can be parallelized, however, the conventional algorithm implement...
118
click to vote
SPIN
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...
ICS
2010
Tsinghua U.
15 years 10 months ago
2010
Tsinghua U.
104
Voted
MSS
2011
IEEE
14 years 4 months ago
2011
IEEE
Paul Milgrom (The Bell Journal of Economics, 12(2): 380–391) showed that if the strict monotone likelihood ratio property (MLRP) does not hold for a conditional distribution the...
113
click to vote
FOCS
2000
IEEE
15 years 5 months ago
2000
IEEE
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...