Minimal perfect hashing in polynomial time
From MaRDI portal
Publication:911304
DOI10.1007/BF02017345zbMath0696.68078OpenAlexW2040532663MaRDI QIDQ911304
Publication date: 1990
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02017345
Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Information storage and retrieval of data (68P20)
Related Items
Perfect hashing ⋮ Secure two-party input-size reduction: challenges, solutions and applications ⋮ Graphs, hypergraphs and hashing ⋮ An optimal algorithm for generating minimal perfect hash functions
Cites Work