P. David and . Anderson, Boinc: A system for public-resource computing and storage, Proceedings of the Fifth IEEE/ACM International Workshop on Grid Computing, pp.4-10, 2004.

D. P. Anderson, J. Cobb, E. Korpela, M. Lebofsky, and D. Werthimer, SETI@home: an experiment in public-resource computing, Communications of the ACM, vol.45, issue.11, pp.4556-61, 2002.
DOI : 10.1145/581571.581573

J. Aspnes and G. Shah, Skip graphs, Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, pp.384-393, 2003.
DOI : 10.1145/1290672.1290674

S. F. Assmann, D. S. Johnson, D. J. Kleitman, and J. Y. Leung, On a dual version of the one-dimensional bin packing problem, Journal of Algorithms, vol.5, issue.4, pp.502-525, 1984.
DOI : 10.1016/0196-6774(84)90004-X

O. Beaumont, N. Bonichon, P. Duchon, and H. Larcheveque, Distributed Approximation Algorithm for Resource Clustering, Proceedings of SIROCCO'08, 2008.
DOI : 10.1007/978-3-540-69355-0_7
URL : https://hal.archives-ouvertes.fr/hal-00396449

R. Cox, F. Dabek, F. Kaashoek, J. Li, and R. Morris, Practical, distributed network coordinates, ACM SIGCOMM Computer Communication Review, vol.34, issue.1, pp.113-118, 2004.
DOI : 10.1145/972374.972394

J. Csirik, D. S. Johnson, and C. Kenyon, Better approximation algorithms for bin covering, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, pp.557-566, 2001.

J. Csirik and G. J. Woeginger, Resource augmentation for online bounded space bin packing, Journal of Algorithms, vol.44, issue.2, pp.308-320, 2002.
DOI : 10.1016/S0196-6774(02)00202-X

F. Dabek, R. Cox, F. Kaashoek, and R. Morris, Vivaldi: a decentralized network coordinate system, Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications, pp.15-26, 2004.

L. Epstein and R. Van-stee, Online Bin Packing with Resource Augmentation, WAOA, pp.23-35, 2004.
DOI : 10.1007/978-3-540-31833-0_4

M. Franceschetti, M. Cook, and J. Bruck, A geometric theorem for approximate disk covering algorithms, 2001.

A. J. Ganesh, A. M. Kermarrec, and L. Massoulié, Peer-to-peer membership management for gossip-based protocols, IEEE Transactions on Computers, vol.52, issue.2, 2003.
DOI : 10.1109/TC.2003.1176982
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.159.7026

J. I. Munro, T. Papadakis, and R. Sedgewick, Deterministic skip lists, Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, pp.367-375, 1992.

T. S. Ng and H. Zhang, Predicting Internet network distance with coordinates-based approaches, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, pp.170-179, 2002.
DOI : 10.1109/INFCOM.2002.1019258
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.1445

J. Orenstein, A comparison of spatial query processing techniques for native and parameter spaces, ACM SIGMOD Record, vol.19, issue.2, pp.343-352, 1990.
DOI : 10.1145/93605.98743

W. Pugh, Skip Lists: A Probabilistic Alternative to Balanced Trees, Communications of the ACM, vol.33, issue.6, 1990.

S. Voulgaris, D. Gavidia, and M. Van-steen, CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays, INRIA Centre de recherche INRIA Bordeaux ? Sud Ouest Domaine Universitaire -351, cours de la Libération -33405 Talence Cedex, pp.197-217, 2005.
DOI : 10.1007/s10922-005-4441-x

I. Centre-de-recherche, ?. Grenoble, and . Rhône-alpes, Europe -38334 Montbonnot Saint-Ismier Centre de recherche INRIA Lille ? Nord Europe : Parc Scientifique de la Haute Borne -40, avenue Halley -59650 Villeneuve d'Ascq Centre de recherche INRIA Nancy ? Grand Est : LORIA, Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès-Nancy Cedex Centre de recherche INRIA Paris ? Rocquencourt : Domaine de Voluceau -Rocquencourt -BP 105 -78153 Le Chesnay Cedex Centre de recherche INRIA Rennes ? Bretagne Atlantique : IRISA, Campus universitaire de Beaulieu -35042 Rennes Cedex Centre de recherche INRIA Saclay ? Île-de-France, des Vignes : 4, rue Jacques Monod -91893 Orsay Cedex Centre de recherche INRIA, pp.105-78153, 2004.