Author:
Genuzio Marco,Ottaviano Giuseppe,Vigna Sebastiano
Publisher
Springer International Publishing
Reference22 articles.
1. Lecture Notes in Computer Science;M Aumüller,2009
2. Belazzougui, D., Boldi, P., Ottaviano, G., Venturini, R., Vigna, S.: Cache-oblivious peeling of random hypergraphs. In: 2014 Data Compression Conference (DCC 2014), pp. 352–361. IEEE (2014)
3. Belazzougui, D., Boldi, P., Pagh, R., Vigna, S.: Monotone minimal perfect hashing: searching a sorted table with
$$O(1)$$
O
(
1
)
accesses. In: Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Mathematics (SODA), pp. 785–794. ACM, New York (2009)
4. Lecture Notes in Computer Science;D Belazzougui,2010
5. Belazzougui, D., Boldi, P., Pagh, R., Vigna, S.: Theory and practice of monotone minimal perfect hashing. ACM J. Exp. Algorithm. 16(3), 3.2:1–3.2:26 (2011)
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. VisionEmbedder: Bit-Level-Compact Key-Value Storage with Constant Lookup, Rapid Updates, and Rare Failure;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13
2. Bloomier Filters on 3-Hypergraphs;Lecture Notes in Computer Science;2024
3. On the Privacy of Multi-Versioned Approximate Membership Check Filters;IEEE Transactions on Dependable and Secure Computing;2024
4. Lightweight Acquisition and Ranging of Flows in the Data Plane;Proceedings of the ACM on Measurement and Analysis of Computing Systems;2023-12-07
5. TCAM-Hash: A Combined Routing Lookup for Network Applications;2023 5th International Conference on Electronic Engineering and Informatics (EEI);2023-06-30