M. Bender, S. Michel, P. Triantafillou, G. Weikum, and C. Zimmer, Improving collection selection with overlap awareness in P2P search engines, Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval, SIGIR '05, p.SIGIR, 2005.
DOI : 10.1145/1076034.1076049
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.8161

B. Bloom, Space/time tradeoffs in hash coding with allowable errors, Comm. of the ACM, vol.13, issue.7, 1970.
DOI : 10.1145/362686.362692
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.2080

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

J. Byers, J. Considine, M. Mitzenmacher, and S. Rost, Informed content delivery across adaptive overlay networks, IEEE/ACM Trans. on Netw, vol.12, issue.5, 2004.
DOI : 10.1145/633025.633031
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.124.9552

D. Charles and K. Chellapilla, Bloomier Filters: A Second Look, p.ESA, 2008.
DOI : 10.1007/978-3-540-87744-8_22
URL : http://arxiv.org/abs/0807.0928

B. Chazelle, J. Kilian, R. Rubinfeld, and A. Tal, The bloomier filter: An efficient data structure for static support lookup tables, p.SIAM, 2004.

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

C. Dorn, H. L. Truong, and S. Dustdar, Measuring and Analyzing Emerging Properties for Autonomic Collaboration Service Adaptation, p.ATC, 2008.
DOI : 10.1007/978-3-540-69295-9_15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.4928

A. Ferscha, C. Holzmann, and S. Oppl, Context awareness for group interaction support, Proceedings of the second international workshop on Mobility management & wireless access protocols , MobiWac '04, p.MobiWac, 2004.
DOI : 10.1145/1023783.1023801
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.5223

D. Guo, J. Wu, H. Chen, and X. Luo, Theory and Network Applications of Dynamic Bloom Filters, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications, p.INFOCOM, 2006.
DOI : 10.1109/INFOCOM.2006.325
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.135.7314

G. Hackmann, C. Julien, J. Payton, and G. C. Roman, Supporting Generalized Context Interactions, p.SEM, 2005.
DOI : 10.1007/11407386_8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.6773

T. Hagerup and T. Tholey, Efficient Minimal Perfect Hashing in Nearly Minimal Space, p.STACS, 2001.
DOI : 10.1007/3-540-44693-1_28

P. Hebden and A. Pearce, Bloom filters for data aggregation and discovery: a hierarchical clustering approach, 2005 International Conference on Intelligent Sensors, Sensor Networks and Information Processing, p.ISSNIP, 2005.
DOI : 10.1109/ISSNIP.2005.1595575
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.5700

C. Jardak, J. Riihijarvi, and P. Mahonen, Analyzing the Optimal Use of Bloom Filters in Wireless Sensor Networks Storing Replicas, 2009 IEEE Wireless Communications and Networking Conference, p.WCNC, 2009.
DOI : 10.1109/WCNC.2009.4917599

T. Jun and C. Julien, Automated routing protocol selection in mobile ad hoc networks, p.SAC, 2007.

D. Kostic, A. Rodriguez, J. Albrecht, and A. Vahdat, Bullet: High bandwidth data dissemination using an overlay mesh, p.SOSP, 2003.

A. Kumar, J. Xu, and J. Wang, Space-code bloom filter for efficient per-flow traffic measurement, IEEE J. on Selected Areas in Comm, vol.24, issue.12, 2006.
DOI : 10.1109/jsac.2006.884032
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.1621

J. Ledlie, J. Taylor, L. Serben, and M. Seltzer, Self-organization in peer-to-peer systems, Proceedings of the 10th workshop on ACM SIGOPS European workshop: beyond the PC , EW10, 2002.
DOI : 10.1145/1133373.1133397
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.1287

M. Mitzenmacher, Compressed bloom filters, IEEE Trans. on Netw, vol.10, issue.5, 2002.
DOI : 10.1145/383962.384004
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.7565

A. Pagh, R. Pagh, and S. Rao, An optimal bloom filter replacement, p.SODA, 2005.

E. Porat, An Optimal Bloom Filter Replacement Based on Matrix Solving, p.CSR, 2009.
DOI : 10.1109/TIT.1986.1057137
URL : http://arxiv.org/abs/0804.1845

S. Rhea and J. Kubiatowicz, Probabilistic location and routing, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, 2002.
DOI : 10.1109/INFCOM.2002.1019375
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.3696

D. Salber, A. K. Dey, and G. D. Abowd, The context toolkit, Proceedings of the SIGCHI conference on Human factors in computing systems the CHI is the limit, CHI '99, p.CHI, 1999.
DOI : 10.1145/302979.303126

B. Wang, J. Bodily, and S. Gupta, Supporting persistent social groups in ubiquitous computing environments using context-aware ephemeral group service, p.PerCom, 2004.