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

DOI10.1007/BF02074879zbMATH Open0752.68020MaRDI QIDQ1198971FDOQ1198971

Authors: Harry G. Mairson 

Publication date: 16 January 1993

Published in: BIT (Search for Journal in Brave)

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

zbMATH Keywords

perfect hashinghash function complexity

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
• Two results on tables
• Cache-oblivious hashing

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)