Sciweavers

285 search results - page 38 / 57
» PODC: Paradigm-Oriented Distributed Computing
Sort
View
PODC
2004
ACM
14 years 2 months ago
Compact routing on euclidian metrics
We consider the problem of designing a compact communication network that supports efficient routing in an Euclidean plane. Our network design and routing scheme achieves 1+ stret...
Ittai Abraham, Dahlia Malkhi
PODC
2005
ACM
14 years 2 months ago
On the establishment of distinct identities in overlay networks
Abstract We study ways to restrict or prevent the damage that can be caused in a peer-to-peer network by corrupt entities creating multiple pseudonyms. We show that it is possible ...
Rida A. Bazzi, Goran Konjevod
PODC
2009
ACM
14 years 9 months ago
On a selfish caching game
In this work we define and study a new model for the caching problem in a heterogeneous wireless network under a flash-crowd scenario. Using non-cooperative game theory, we cast t...
Pietro Michiardi, Carla-Fabiana Chiasserini, Claud...
PODC
2003
ACM
14 years 2 months ago
Automatic discovery of mutual exclusion algorithms
We present a methodology for automatic discovery of synchronization algorithms. We built a tool and used it to automatically discover hundreds of new algorithms for the well-known ...
Yoah Bar-David, Gadi Taubenfeld
PODC
2009
ACM
14 years 9 months ago
Distributed and parallel algorithms for weighted vertex cover and other covering problems
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
Christos Koufogiannakis, Neal E. Young