Reciprocal hashing
From MaRDI portal
Publication:3919093
DOI10.1145/358800.358806zbMath0466.68051OpenAlexW2034428381MaRDI QIDQ3919093
Publication date: 1981
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/358800.358806
Searching and sorting (68P10) Data structures (68P05) Information storage and retrieval of data (68P20) Theory of operating systems (68N25)
Related Items
The self-indexed search algorithm: a bit-level approach to minimal perfect hashing ⋮ Perfect hashing ⋮ Secure two-party input-size reduction: challenges, solutions and applications ⋮ Graphs, hypergraphs and hashing ⋮ Minimal perfect hashing in polynomial time ⋮ Equivalence of the relational algebra and calculus for nested relations ⋮ A practical method for implementing string pattern matching machines ⋮ An optimal algorithm for generating minimal perfect hash functions ⋮ Vowel-consonant addressing mode on hashing for English letter-oriented keys ⋮ A reciprocal confluence tree unit and its applications ⋮ 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
