2924 search results - page 197 / 585 » Lower Bounds in Distributed Computing |
121
click to vote
HPCN
1995
Springer
15 years 6 months ago
1995
Springer
Abstract. In this paper we discuss the concept of space-time diagrams as a representation of the execution of an application, and then give a method, based on critical path analysi...
118
click to vote
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
We consider the problem of broadcasting a large message in a large scale distributed platform. The message must be sent from a source node, with the help of the receiving peers whi...
144
click to vote
CCCG
2009
15 years 4 months ago
2009
Let S be a finite set of points in the Euclidean plane, and let E be the complete graph whose point-set is S. Chew, in 1986, proved a lower bound of /2 on the stretch factor of th...
106
Voted
BIRTHDAY
2003
Springer
15 years 8 months ago
2003
Springer
The problem of cooperatively performing a collection of tasks in a decentralized setting where the computing medium is subject to adversarial perturbations is one of the fundament...
152
Voted
WDAG
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...