Linear Probing with Constant Independence

DOI10.1137/070702278zbMath1192.68204OpenAlexW1982689753WikidataQ61386873 ScholiaQ61386873MaRDI QIDQ3575161

Milan Ruzic, Rasmus Pagh, Anna Pagh

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

zbMATH Keywords

hashinglinear probing

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Randomized algorithms (68W20)

Related Items (4)

Near-Linear Time Local Polynomial Nonparametric Estimation with Box Kernels ⋮ Three‐wise independent random walks can be slightly unbounded ⋮ Unnamed Item ⋮ Some New Orders of Hadamard and Skew‐Hadamard Matrices

This page was built for publication: Linear Probing with Constant Independence