Hash table collision resolution with direct chaining

DOI10.1016/0196-6774(89)90021-7zbMATH Open0685.68024OpenAlexW1970850252MaRDI QIDQ4203804FDOQ4203804

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

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

zbMATH Keywords

hashingdirect chainingstorag and retrieval

Mathematics Subject Classification ID

Data structures (68P05)

Cited In (5)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimum Algorithms for a Model of Direct Chaining
• Analysis of hashing with chaining in the prime area
• 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)