Sciweavers

PODC
2003
ACM
13 years 9 months ago
On using network attached disks as shared memory
Marcos Kawazoe Aguilera, Burkhard Englert, Eli Gaf...
PODC
2003
ACM
13 years 9 months ago
Adapting to a reliable network path
We consider the model of unreliable network links, where at each time unit a link might be either up or down. We consider two related problems. The first, establishing end to end...
Baruch Awerbuch, Yishay Mansour
PODC
2003
ACM
13 years 9 months ago
Asynchronous resource discovery
Consider a dynamic, large-scale communication infrastructure (e.g., the Internet) where nodes (e.g., in a peer to peer system) can communicate only with nodes whose id (e.g., IP a...
Ittai Abraham, Danny Dolev
PODC
2003
ACM
13 years 9 months ago
Cryptography and competition policy: issues with 'trusted computing'
The most significant strategic development in information technology over the past year has been ‘trusted computing’. This is popularly associated with Microsoft’s ‘Pallad...
Ross J. Anderson
PODC
2003
ACM
13 years 9 months ago
Compact roundtrip routing with topology-independent node names
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...
Marta Arias, Lenore Cowen, Kofi A. Laing