Recommendations
- Linear probing with 5-wise independence
- On the \(k\)-independence required by linear probing and minwise independence
- On the \(k\)-independence required by linear probing and minwise independence
- Tabulation-based 5-independent hashing with applications to linear probing and second moment estimation
- Tabulation based 5-universal hashing and linear probing
Cited in
(20)- Linear open addressing and Peterson's theorem rehashed
- Analysis of random probing hashing
- Tabulation-based 5-independent hashing with applications to linear probing and second moment estimation
- Linear probing with 5-wise independence
- On the \(k\)-independence required by linear probing and minwise independence
- Hash table reorganization
- scientific article; zbMATH DE number 4047207 (Why is no real title available?)
- scientific article; zbMATH DE number 1156718 (Why is no real title available?)
- String hashing for linear probing
- Linear hashing is awesome
- Cache-oblivious hashing
- Linear probing: The probable largest search time grows logarithmically with the number of records
- On the \(k\)-independence required by linear probing and minwise independence
- Some new orders of Hadamard and skew-Hadamard matrices
- Near-Linear Time Local Polynomial Nonparametric Estimation with Box Kernels
- Tabulation based 5-universal hashing and linear probing
- Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
- scientific article; zbMATH DE number 7650130 (Why is no real title available?)
- Three‐wise independent random walks can be slightly unbounded
- Fixed-strength spherical designs
This page was built for publication: Linear probing with constant independence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3575161)
