On the expected longest length probe sequence for hashing with separate chaining

DOI10.1016/J.JDA.2011.04.005MaRDI QIDQ635746zbMATH OpenOpenAlexFDO

Authors Pedro Reviriego, Lars Holst, Juan Antonio Maestro

Publication date 23 August 2011

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2011.04.005

zbMATH Keywords

analysis of algorithmshashingseparate chainingtable search

Mathematics Subject Classification ID

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

Recommendations

• The expected length of the longest probe sequence for bucket searching when the distribution is not uniform
• scientific article; zbMATH DE number 562726
• Hash table collision resolution with direct chaining
• Linear hashing is awesome
• Analysis of random probing hashing

Cites work

• Expected Length of the Longest Probe Sequence in Hash Code Searching
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)

Cited in

(1)

• Hash table collision resolution with direct chaining

This page was built for publication: On the expected longest length probe sequence for hashing with separate chaining

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