31 search results - page 4 / 7 » podc 2003 |
142
Voted
PODC
2003
ACM
15 years 10 months ago
2003
ACM
We introduce a novel game that models the creation of Internet-like networks by selfish node-agents without central design or coordination. Nodes pay for the links that they esta...
166
click to vote
PODC
2003
ACM
15 years 10 months ago
2003
ACM
We investigate issues related to the probe complexity of quorum systems and their implementation in a dynamic environment. Our contribution is twofold. The first regards the algo...
153
click to vote
PODC
2003
ACM
15 years 10 months ago
2003
ACM
The distinction between safety and liveness properties is due to Lamport who gave the following informal characterization. Safety properties assert that nothing bad ever happens w...
126
click to vote
PODC
2003
ACM
15 years 10 months ago
2003
ACM
We present the first lock-free implementation of an extensible hash table running on current architectures. Our algorithm provides concurrent insert, delete, and find operations ...
119
Voted
PODC
2003
ACM
15 years 10 months ago
2003
ACM
This paper presents compact roundtrip routing schemes with local tables of size ˜O( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tabl...