Reciprocal hashing

DOI10.1145/358800.358806MaRDI QIDQ3919093zbMATH OpenOpenAlexFDO

Authors G. Jaeschke

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

zbMATH Keywords

data structuresquotient reductionsearching

Mathematics Subject Classification ID

Theory of operating systems (68N25) Data structures (68P05) Searching and sorting (68P10) Information storage and retrieval of data (68P20)

Cited in

(15)

• 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
• 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
• Perfect hashing
• A scheme for constructing ordered minimal perfect hashing functions
• An algebraic approach to Cichelli's perfect hashing
• The self-indexed search algorithm: a bit-level approach to minimal perfect hashing
• Vowel-consonant addressing mode on hashing for English letter-oriented keys
• A reciprocal confluence tree unit and its applications
• Secure two-party input-size reduction: challenges, solutions and applications
• Graphs, hypergraphs and hashing
• Minimal perfect hashing in polynomial time

This page was built for publication: Reciprocal hashing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3919093)