D. Caromel and L. Henrio, A Theory of Distributed Objects, 2005.

P. R. Wilson, Uniprocessor garbage collection techniques, International Workshop on Memory Management
DOI : 10.1007/BFb0017182

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

L. Veiga and P. Ferreira, Asynchronous Complete Distributed Garbage Collection, 19th IEEE International Parallel and Distributed Processing Symposium, 2005.
DOI : 10.1109/IPDPS.2005.113

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

M. C. Lowry, A new approach to the train algorithm for distributed garbage collection, 2004.

S. E. Abdullahi and G. A. Ringwood, Garbage collecting the Internet: a survey of distributed garbage collection, ACM Computing Surveys, vol.30, issue.3, pp.330-373, 1998.
DOI : 10.1145/292469.292471

M. Shapiro, F. L. Fessant, and P. Ferreira, Recent Advances in Distributed Garbage Collection Advanced Distributed Computing: From Algorithms to Systems, Advances in Distributed Systems, pp.104-126, 1999.

F. L. Fessant, Detecting distributed cycles of garbage in large-scale systems, Proceedings of the twentieth annual ACM symposium on Principles of distributed computing , PODC '01, pp.200-209, 2001.
DOI : 10.1145/383962.384018

]. P. Bishop, Computer systems with a very large address space, and garbage collection, Massachusetts Institute of Technology, issue.11, 1977.

B. Liskov and R. Ladin, Highly available distributed services and faulttolerant distributed garbage collection, PODC'86: Proceedings of the fifth annual ACM symposium on Principles of distributed computing, pp.29-39, 1986.
DOI : 10.1145/10590.10593

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

U. Maheshwari and B. Liskov, Collecting cyclic distributed garbage by controlled migration, PODC'95: Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing, pp.57-63, 1995.

H. Rodrigues and R. Jones, Cyclic distributed garbage collection with group merger, ECCOP'98: Proceedings of the 12th European Conference on Object-Oriented Programming, pp.260-284, 1998.
DOI : 10.1007/BFb0054095

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

B. Lang, C. Queinnec, and J. Piquer, Garbage collecting the world, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '92, pp.39-50, 1992.
DOI : 10.1145/143165.143176

J. Hughes, A distributed garbage collection algorithm a conference on Functional programming languages and computer architecture, Proc. of, pp.256-272, 1985.

N. Richer and M. Shapiro, The Memory Behavior of the WWW, or The WWW Considered as a Persistent Store, POS-9: Revised Papers from the 9th International Workshop on Persistent Object Systems, pp.161-176, 2001.
DOI : 10.1007/3-540-45498-5_14

URL : https://hal.archives-ouvertes.fr/hal-01248218

A. Potanin, J. Noble, M. Frean, and R. Biddle, Scale-free geometry in OO programs, Communications of the ACM, vol.48, issue.5, 2005.
DOI : 10.1145/1060710.1060716

A. Birell, D. Evers, G. Nelson, S. Owicki, and E. Wobber, Distributed Garbage collection for Network Objects, 1993.

D. I. Bevan, Distributed garbage collection using reference counting, " in Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe, pp.176-187, 1987.

P. Leach, M. Mealling, and R. Salz, A Universally Unique IDentifier (UUID) URN Namespace, RFC 4122, 2005.

S. Muthukrisnan, Data streams: Algorithms ans applications

B. H. Bloom, Space/time trade-offs in hash coding with allowable errors, Communications of the ACM, vol.13, issue.7, pp.422-426, 1970.
DOI : 10.1145/362686.362692

A. Broder and M. Mitzenmacher, Network Applications of Bloom Filters: A Survey, Internet Mathematics, vol.1, issue.4, 2003.
DOI : 10.1080/15427951.2004.10129096

M. Mitzenmacher, Compressed Bloom filters, IEEE/ACM Transactions on Networking, vol.10, issue.5, pp.604-612, 2002.
DOI : 10.1109/TNET.2002.803864

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

A. Pagh, R. Pagh, and S. S. Rao, An optimal Bloom filter replacement, SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pp.823-829, 2005.

B. Chazelle, J. Kilian, R. Rubinfeld, and A. Tal, The Bloomier filter: an efficient data structure for static support lookup tables, SODA '04: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, pp.30-39, 2004.

S. Cohen and Y. Matias, Spectral bloom filters, Proceedings of the 2003 ACM SIGMOD international conference on on Management of data , SIGMOD '03, pp.241-252, 2003.
DOI : 10.1145/872757.872787

T. H. Cormen, C. Stein, R. L. Rivest, and C. E. Leiserson, Introduction to Algorithms, 2001.