4 search results - page 1 / 1 » opodis 2000 |
110
Voted
OPODIS
2000
15 years 8 days ago
2000
We assume a link-register communication model under read/write atomicity, where every process can read from but cannot write into its neighbours' registers. The paper present...
80
Voted
OPODIS
2004
15 years 9 days ago
2004
The main contribution of this paper is that it shows that it is possible to have reactive distributed trees for counting and balancing with no need for the user to fix manually any...
OPODIS
2008
15 years 11 days ago
2008
Kleinberg [17] proposed in 2000 the first random graph model achieving to reproduce small world navigability, i.e. the ability to greedily discover polylogarithmic routes between a...
95
Voted
OPODIS
2007
15 years 10 days ago
2007
Abstract. In small-world networks, each peer is connected to its closest neighbors in the network topology, as well as to additional long-range contact(s), also called shortcut(s)....