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

DOI10.1007/BF02074879zbMath0752.68020MaRDI QIDQ1198971

Harry G. Mairson

Publication date: 16 January 1993

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

perfect hashinghash function complexity

Mathematics Subject Classification ID

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

Related Items (2)

Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions ⋮ Cache-oblivious hashing

Cites Work

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

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