Cache-oblivious hashing
From MaRDI portal
Publication:472489
Recommendations
Cites work
- scientific article; zbMATH DE number 989379 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- Cache-Oblivious B-Trees
- Cache-oblivious range reporting with optimal queries requires superlinear space
- Chernoff–Hoeffding Bounds for Applications with Limited Independence
- Cuckoo hashing
- Linear probing with 5-wise independence
- New hash functions and their use in authentication and set equality
- On the limits of cache-obliviousness
- Optimality in external memory hashing
- The cost of cache-oblivious searching
- The effect of table expansion on the program complexity of perfect hash functions
- The limits of buffering: a tight lower bound for dynamic membership in the external memory model
- Universal classes of hash functions
Cited in
(5)
This page was built for publication: Cache-oblivious hashing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q472489)