Direct-chaining with coalescing lists

DOI10.1016/0196-6774(84)90036-1MaRDI QIDQ3321500zbMATH OpenOpenAlexFDO

Authors G. D. Knott

Publication date 1984

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

Full work available at URL https://doi.org/10.1016/0196-6774(84)90036-1

zbMATH Keywords

direct-chaining with coalescing listshash table collision resolution

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Recommendations

• Listing combinatorial objects in parallel
• scientific article; zbMATH DE number 1263185
• Merging multiple lists on hierarchical-memory multiprocessors
• Calculating with acyclic and cyclic lists
• scientific article; zbMATH DE number 3760081
• scientific article; zbMATH DE number 1678386
• Parallel comparison merging of many-ordered lists
• Combining initial segments of lists

Cited in

(9)

• Individual Displacements in Hashing with Coalesced Chains
• On Search Times for Early-Insertion Coalesced Hashing
• Linear open addressing and Peterson's theorem rehashed
• scientific article; zbMATH DE number 4045254 (Why is no real title available?)
• Optimum Algorithms for a Model of Direct Chaining
• Deletion Algorithms for Coalesced Hashing
• Search performance of double-linked coalesced hashing can not exceed bucketing
• Hash table collision resolution with direct chaining
• Analysis of new variants of coalesced hashing

This page was built for publication: Direct-chaining with coalescing lists

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