Hash table collision resolution with direct chaining

DOI10.1016/0196-6774(89)90021-7MaRDI QIDQ4203804zbMATH OpenOpenAlexFDO

Authors G. D. Knott, Pilar de la Torre

Publication date 1989

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

Full work available at URL https://doi.org/10.1016/0196-6774(89)90021-7

zbMATH Keywords

direct chaininghashingstorag and retrieval

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Direct-chaining with coalescing lists
• Analysis of hashing with chaining in the prime area
• scientific article; zbMATH DE number 562726
• Optimum Algorithms for a Model of Direct Chaining
• On the expected longest length probe sequence for hashing with separate chaining

Cited in

(5)

• Analysis of hashing with chaining in the prime area
• Optimum Algorithms for a Model of Direct Chaining
• scientific article; zbMATH DE number 4045254 (Why is no real title available?)
• scientific article; zbMATH DE number 4062573 (Why is no real title available?)
• On the expected longest length probe sequence for hashing with separate chaining

This page was built for publication: Hash table collision resolution with direct chaining

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