Linear open addressing and Peterson's theorem rehashed

DOI10.1007/BF01934101zbMATH Open0647.68021OpenAlexW1977169037MaRDI QIDQ1104732FDOQ1104732

Authors: G. D. Knott 

Publication date: 1988

Published in: BIT (Search for Journal in Brave)

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

Recommendations

• scientific article; zbMATH DE number 4062573
• Linear probing with constant independence
• scientific article; zbMATH DE number 1156718
• Linear probing with 5-wise independence
• Last-come-first-served hashing

zbMATH Keywords

clusteringhashingopen addressing

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• Title not available (Why is that?)

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

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