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
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=10.1.1.21.7565
Network Applications of Bloom Filters: A Survey, Internet Mathematics, vol.1, issue.4, pp.485-509, 2002. ,
DOI : 10.1080/15427951.2004.10129096
Beyond Bloom filters: From approximate membership checks to approximate state machines, Proc. ACM SIGCOMM, pp.315-326, 2006. ,
Summary cache: a scalable wide-area Web cache sharing protocol, IEEE/ACM Transactions on Networking, vol.8, issue.3, pp.281-293, 2000. ,
DOI : 10.1109/90.851975
Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator, ACM Transactions on Modeling and Computer Simulation, vol.8, issue.1, pp.3-30, 1998. ,
DOI : 10.1145/272991.272995
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.1141
Fast hash table lookup using extended Bloom filter: An aid to network processing, Proc. ACM SIGCOMM, pp.181-192, 2005. ,
DOI : 10.1145/1080091.1080114
Topology discovery by active probing, Proceedings 2002 Symposium on Applications and the Internet (SAINT) Workshops, pp.90-96, 2002. ,
DOI : 10.1109/SAINTW.2002.994558
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.6275
DIMES, ACM SIGCOMM Computer Communication Review, vol.35, issue.3, pp.71-74, 2005. ,
DOI : 10.1145/1096536.1096546
Efficient algorithms for large-scale topology discovery, Proc. ACM SIGMETRICS, pp.327-338, 2005. ,
DOI : 10.1145/1064212.1064256
URL : https://hal.archives-ouvertes.fr/hal-01491665
A statistical approach to the traceroute-like exploration of networks: theory and simulations, Proc. CAAN Workshop, pp.140-153, 2004. ,
Development of a Spelling List, IEEE Transactions on Communications, vol.30, issue.1, pp.91-99, 1982. ,
DOI : 10.1109/TCOM.1982.1095395
A tale of three spelling checkers, Software ? Practice and Experience, pp.625-630, 1990. ,
DOI : 10.1002/spe.4380200607
Hashing methods and relational algebra operations, Proc. 10th International Conference on Very Large Databases, pp.323-333, 1984. ,
DOI : 10.1007/3-540-54132-2_48
Join and Semijoin Algorithms for a Multiprocessor Database Machine, ACM Transactions on Database Systems, vol.9, issue.1, pp.133-161, 1984. ,
DOI : 10.1145/348.318590
Designing a Bloom filter for differential file access, Communications of the ACM, vol.25, issue.9, pp.600-604, 1982. ,
DOI : 10.1145/358628.358632
A second look at bloom filters, Communications of the ACM, vol.26, issue.8, pp.570-571, 1983. ,
DOI : 10.1145/358161.358167
Efficient web profiling by time-decaying Bloom filters, DBSJ Letters, vol.4, issue.1, pp.137-140, 2005. ,
Approximate caches for packet classification, IEEE INFOCOM 2004, pp.2196-2207, 2004. ,
DOI : 10.1109/INFCOM.2004.1354643
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.1751
Time-Out Bloom Filter: A New Sampling Method for Recording More Flows, Proc. Internation Conference on Information Networking (ICOIN), 2006. ,
DOI : 10.1007/11919568_59
Less hashing, same performance: Building a better Bloom filter, Proc. 14th Annual European Symposium on Algorithms (ESA), pp.456-467, 2006. ,
DOI : 10.1002/rsa.20208
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.152.579
Space-code Bloom filter for efficient per-flow traffic measurement, Proc. ACM Internet Measurement Conference (IMC), pp.167-172, 2003. ,
DOI : 10.1109/infcom.2004.1354587
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.1621
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
Weighted Bloom Filter, 2006 IEEE International Symposium on Information Theory, 2006. ,
DOI : 10.1109/ISIT.2006.261978
Split Bloom filters, Chinese Journal of Electronic, vol.32, issue.2, pp.241-245, 2004. ,
Theory and Network Applications of Dynamic Bloom Filters, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications, 2006. ,
DOI : 10.1109/INFOCOM.2006.325
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.135.7314
Bloom filters CS 270?Class Notes, 2004. ,
A little Bloom filter theory (and a bag of filter tricks), 1999. ,
A new IP traceback system against distributed denial-of-service attacks, Proc. 12th International Conference on Telecommunications (ICT), 2005. ,
Generalized Bloom filters, Electrical Engineering Program, COPPE/UFRJ, 2005. ,
Distance-Sensitive Bloom Filters, Proc. Algorithm Engineering and Experiments (ALENEX), 2006. ,
DOI : 10.1137/1.9781611972863.4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.185.1588
Artificial Intelligence: A Modern Approach, 2003. ,
PlanetP: using gossiping to build content addressable peer-to-peer information sharing communities, High Performance Distributed Computing, 2003. Proceedings. 12th IEEE International Symposium on, pp.236-246, 2003. ,
DOI : 10.1109/HPDC.2003.1210033
URL : http://athos.rutgers.edu/~rmartin/papers/planetp.pdf
Informed content delivery over adaptive overlay networks, Proc. ACM SIGCOMM, pp.47-60, 2002. ,
DOI : 10.1145/633030.633031
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.124.9552
Probabilistic location and routing, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, pp.1248-1257, 2002. ,
DOI : 10.1109/INFCOM.2002.1019375
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.3696
An architecture for a secure service discovery service, Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking , MobiCom '99, pp.24-35, 1999. ,
DOI : 10.1145/313451.313462
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.4636
Deep packet inspection using parallel bloom filters, IEEE Micro, vol.24, issue.1, pp.52-61, 2003. ,
DOI : 10.1109/MM.2004.1268997
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.4863
Improved Algorithms for Network Topology Discovery, Proc. PAM Workshop, pp.149-162, 2005. ,
DOI : 10.1007/978-3-540-31966-5_12
URL : https://hal.archives-ouvertes.fr/hal-01487808