The effect of table expansion on the program complexity of perfect hash functions
From MaRDI portal
Publication:1198971
DOI10.1007/BF02074879zbMath0752.68020MaRDI QIDQ1198971
Publication date: 16 January 1993
Published in: BIT (Search for Journal in Brave)
Related Items (2)
Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions ⋮ Cache-oblivious hashing
Cites Work
This page was built for publication: The effect of table expansion on the program complexity of perfect hash functions