A New Approach to the Analysis of Linear Probing Schemes

DOI10.1145/322203.322209MaRDI QIDQ3930672zbMATH OpenOpenAlexFDO

Authors Haim Mendelson, Uri Yechiali

Publication date 1980

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/322203.322209

zbMATH Keywords

ballot theoremcollision resolutioncyclic probing schemehash table performanceoptimal storage allocationprobabilistic analysis

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Discrete mathematics in relation to computer science (68R99)

Cited in

(1)

• Lattice path combinatorics and linear probing

This page was built for publication: A New Approach to the Analysis of Linear Probing Schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3930672)