Linear open addressing and Peterson's theorem rehashed

DOI10.1007/BF01934101zbMath0647.68021OpenAlexW1977169037MaRDI QIDQ1104732

Gary D. Knott

Publication date: 1988

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01934101

zbMATH Keywords

clusteringhashingopen addressing

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05)

Cites Work

• Unnamed Item
• Direct-chaining with coalescing lists
• Hashing functions
• Optimal Arrangement of Keys in a Hash Table
• Computer Science and Its Relation to Mathematics
• Ordered hash tables
• An Occupancy Discipline and Applications
• Some properties of the scatter storage technique with linear probing
• Reducing the retrieval time of scatter storage techniques
• A Note on the Efficiency of Hashing Functions

This page was built for publication: Linear open addressing and Peterson's theorem rehashed