Publisher
Springer International Publishing
Reference32 articles.
1. Arbitman, Y., Naor, M., Segev, G.: De-amortized cuckoo hashing: Provable worst-case performance and experimental results. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) Automata, Languages and Programming. ICALP 2009. Lecture Notes in Computer Science, vol. 5555. Springer, Berlin, Heidelberg (2009). https://doi.org/10.1007/978-3-642-02927-1_11
2. Arbitman, Y., Naor, M., Segev, G.: Backyard cuckoo hashing: constant worst-case operations with a succinct representation. In: 2010 IEEE 51st Annual Symposium on Foundations of Computer Science. pp. 787–796. IEEE (2010)
3. Bercea, I.O., Even, G.: A dynamic space-efficient filter with constant time operations. In: 17th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2020, June 22–24, 2020, pp. 11:1–11:17. Tórshavn, Faroe Islands (2020). https://doi.org/10.4230/LIPIcs.SWAT.2020.11, https://doi.org/10.4230/LIPIcs.SWAT.2020.11
4. Bercea, I.O., Even, G.: Fully-dynamic space-efficient dictionaries and filters with constant number of memory accesses. CoRR abs/1911.05060 (2019). http://arxiv.org/abs/1911.05060
5. Bercea, I.O., Even, G.: A space-efficient dynamic dictionary for multisets with constant time operations. CoRR abs/2005.02143 (2020). https://arxiv.org/abs/2005.02143
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献