Publisher
Springer Nature Singapore
Reference32 articles.
1. Bloom, B.H.: Space/time trade-offs in hash coding with allowable errors. Commun. ACM 13, 422–426 (1970). https://doi.org/10.1145/362686.362692
2. Cohen, S., Matias, Y.: Spectral bloom filters. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data (SIGMOD 2003). New York (2003). https://doi.org/10.1145/872757.872787
3. Chazelle, B., Kilian, J., Rubinfeld, R., Tal, A.: The Bloomier filter: an efficient data structure for static support lookup tables. In: ACM-SIAM Symposium on Discrete Algorithms (2004)
4. Fan, L., Cao, P., Almeida, J., Broder, A.Z.: Summary cache: a scalable wide-area Web cache sharing protocol. IEEE/ACM Trans. Netw. 8, 281–293 (2000). https://doi.org/10.1109/90.851975
5. Kumar, A., Xu, J., Zegara, E.W.: Efficient and scalable query routing for unstructured peer-to-peer networks. In: Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies (2005). https://doi.org/10.1109/infcom.2005.1498343