The effect of table expansion on the program complexity of perfect hash functions

DOI10.1007/BF02074879MaRDI QIDQ1198971zbMATH OpenFDO

Authors Harry G. Mairson

Publication date 16 January 1993

Published in BIT (Search for Journal in Brave)

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

zbMATH Keywords

hash function complexityperfect hashing

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Collections of Functions for Perfect Hashing
• Simple and Space-Efficient Minimal Perfect Hash Functions
• scientific article; zbMATH DE number 1875411
• Two results on tables
• Hash, Displace, and Compress

Cites work

• Collections of Functions for Perfect Hashing
• Inequalities: theory of majorization and its applications
• Storing a Sparse Table with 0 (1) Worst Case Access Time

Cited in

(4)

• Two results on tables
• Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
• Cache-oblivious hashing
• Engineering minimal \(k\)-perfect hash functions

This page was built for publication: The effect of table expansion on the program complexity of perfect hash functions

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