On the k-independence required by linear probing and minwise independence
From MaRDI portal
(Redirected from Publication:4962205)
On the \(k\)-independence required by linear probing and minwise independence (scientific article; zbMATH DE number 6968334)
On the \(k\)-independence required by linear probing and minwise independence (scientific article; zbMATH DE number 6968334)
Recommendations
- On the \(k\)-independence required by linear probing and minwise independence
- Linear probing with constant independence
- Linear probing with 5-wise independence
- Tabulation-based 5-independent hashing with applications to linear probing and second moment estimation
- Quicksort, largest bucket, and min-wise hashing with limited independence
Cited in
(14)- Independence of tabulation-based hash classes
- Tabulation-based 5-independent hashing with applications to linear probing and second moment estimation
- From independence to expansion and back again
- Linear probing with 5-wise independence
- Quicksort, largest bucket, and min-wise hashing with limited independence
- The Spatial Complexity of Oblivious k-Probe Hash Functions
- Linear probing with constant independence
- On the \(k\)-independence required by linear probing and minwise independence
- Engineering practical Lempel-Ziv tries
- LZ78 compression in low main memory space
- Bottom-k and priority sampling, set similarity and subset sums with minimal independence
- scientific article; zbMATH DE number 7650130 (Why is no real title available?)
- Three‐wise independent random walks can be slightly unbounded
- Universal Hashing via Integer Arithmetic Without Primes, Revisited
This page was built for publication: On the \(k\)-independence required by linear probing and minwise independence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4962205)
