Publisher
Springer Nature Switzerland
Reference31 articles.
1. Behera, S., Gayen, S., Deogun, J.S., Vinodchandran, N.: KmerEstimate: a streaming algorithm for estimating k-mer counts with optimal space usage. In: Proceedings of the 2018 ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics, pp. 438–447 (2018)
2. Ben Mazziane, Y., Alouf, S., Neglia, G.: A formal analysis of the count-min sketch with conservative updates. In: IEEE INFOCOM WNA 2022 - The second Workshop on Networking Algorithms (WNA), New York, USA (2022). https://doi.org/10.1109/INFOCOMWKSHPS54753.2022.9798146
3. Ben Mazziane, Y., Alouf, S., Neglia, G.: Analyzing count min sketch with conservative updates. Comput. Netw. 217, 109315 (2022). https://www.sciencedirect.com/science/article/pii/S1389128622003607
4. Bercea, I.O., Houen, J.B.T., Pagh, R.: Daisy Bloom filters. CoRR abs/2205.14894 (2022)
5. Bianchi, G., Duffy, K., Leith, D.J., Shneer, V.: Modeling conservative updates in multi-hash approximate count sketches. In: 24th International Teletraffic Congress, ITC 2012, Kraków, Poland, 4–7 September 2012, pp. 1–8. IEEE (2012). https://ieeexplore.ieee.org/document/6331813/
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献