Asymmetric balanced allocation with simple hash functions
From MaRDI portal
Publication:3581541
DOI10.1145/1109557.1109605zbMath1192.68233OpenAlexW4252592952MaRDI QIDQ3581541
Publication date: 16 August 2010
Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1109557.1109605
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Information storage and retrieval of data (68P20)
Related Items (3)
Efficient set intersection with simulation-based security ⋮ Unnamed Item ⋮ Explicit and efficient hash families suffice for cuckoo hashing with a stash
This page was built for publication: Asymmetric balanced allocation with simple hash functions
