Linear probing with constant independence
From MaRDI portal
Publication:3575161
DOI10.1137/070702278zbMATH Open1192.68204OpenAlexW1982689753WikidataQ61386873 ScholiaQ61386873MaRDI QIDQ3575161FDOQ3575161
Authors: Anna Pagh, Rasmus Pagh, Milan Ružić 
Publication date: 7 July 2010
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.324.308
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 (17)
- Near-Linear Time Local Polynomial Nonparametric Estimation with Box Kernels
- Tabulation-based 5-independent hashing with applications to linear probing and second moment estimation
- Title not available (Why is that?)
- Linear open addressing and Peterson's theorem rehashed
- Three‐wise independent random walks can be slightly unbounded
- String hashing for linear probing
- Hash table reorganization
- On the \(k\)-independence required by linear probing and minwise independence
- Tabulation based 5-universal hashing and linear probing
- Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
- Analysis of random probing hashing
- Linear probing: The probable largest search time grows logarithmically with the number of records
- Title not available (Why is that?)
- 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)
