2084 search results - page 55 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
PODC
2009
ACM
15 years 10 months ago
2009
ACM
d Abstract] Danny Hendler Department of Computer-Science Ben-Gurion University hendlerd@cs.bgu.ac.il Philipp Woelfel Department of Computer-Science University of Calgary woelfel@cp...
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
—We consider distributed iterative algorithms for the averaging problem over time-varying topologies. Our focus is on the convergence time of such algorithms when complete (unqua...
SPAA
1990
ACM
15 years 1 months ago
1990
ACM
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...
SPIRE
2001
Springer
15 years 2 months ago
2001
Springer
We constructively prove the exact distribution of deletion sizes for unavoidable strings, under the reductive decidability method of Zimin and Bean et al. Bounds such as these on ...
IPPS
1999
IEEE
15 years 2 months ago
1999
IEEE
A binary-tree algorithm, Bin(n), proceeds level-bylevel from the leaves of a 2n -leaf balanced binary tree to its root. This paper deals with running binary-tree algorithms on mul...