Linear probing with constant independence
From MaRDI portal
Publication:3575161
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
(18)- Near-Linear Time Local Polynomial Nonparametric Estimation with Box Kernels
- Tabulation-based 5-independent hashing with applications to linear probing and second moment estimation
- Linear open addressing and Peterson's theorem rehashed
- scientific article; zbMATH DE number 4047207 (Why is no real title available?)
- Linear hashing is awesome
- Three‐wise independent random walks can be slightly unbounded
- Hash table reorganization
- String hashing for linear probing
- On the \(k\)-independence required by linear probing and minwise independence
- Tabulation based 5-universal hashing and linear probing
- Analysis of random probing hashing
- Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
- Linear probing: The probable largest search time grows logarithmically with the number of records
- scientific article; zbMATH DE number 7650130 (Why is no real title available?)
- Cache-oblivious hashing
- Linear probing with 5-wise independence
- Some new orders of Hadamard and skew-Hadamard matrices
- On the \(k\)-independence required by linear probing and minwise independence
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)
