Perfect hashing functions
From MaRDI portal
Publication:4135041
DOI10.1145/359863.359887zbMath0361.68137OpenAlexW2084325555MaRDI QIDQ4135041
Publication date: 1977
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/359863.359887
Information storage and retrieval of data (68P20) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items (14)
The self-indexed search algorithm: a bit-level approach to minimal perfect hashing ⋮ Perfect hashing ⋮ Graphs, hypergraphs and hashing ⋮ Minimal perfect hashing in polynomial time ⋮ Performance analysis of temporal queries ⋮ A practical method for implementing string pattern matching machines ⋮ Polynomial-time compression ⋮ Perfect Storage Representations for Families of Data Structures ⋮ A scheme for constructing ordered minimal perfect hashing functions ⋮ An algebraic approach to Cichelli's perfect hashing ⋮ Minimal and almost minimal perfect hash function search with application to natural language lexicon design ⋮ A backtracking method for constructing perfect hash functions from a set of mapping functions ⋮ An ordered minimal perfect hashing scheme based upon Euler's theorem ⋮ A refinement of a compression-oriented addressing scheme
This page was built for publication: Perfect hashing functions
