Minimal perfect hashing in polynomial time

DOI10.1007/BF02017345zbMath0696.68078OpenAlexW2040532663MaRDI QIDQ911304

Vincent G. Winters

Publication date: 1990

Published in: BIT (Search for Journal in Brave)

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

zbMATH Keywords

complexitysearchingminimal perfect hashing

Mathematics Subject Classification ID

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

• Fast modular transforms
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Reciprocal hashing
• Perfect hashing functions
• Unnamed Item
• Unnamed Item
• Unnamed Item