Perfect hashing functions

DOI10.1145/359863.359887zbMATH Open0361.68137OpenAlexW2084325555MaRDI QIDQ4135041FDOQ4135041

Renzo Sprugnoli

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

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Information storage and retrieval of data (68P20) Algorithms in computer science (68W99)

Cited In (14)

• Graphs, hypergraphs and hashing
• Polynomial-time compression
• The self-indexed search algorithm: a bit-level approach to minimal perfect hashing
• Perfect Storage Representations for Families of Data Structures
• A refinement of a compression-oriented addressing scheme
• An algebraic approach to Cichelli's perfect hashing
• Performance analysis of temporal queries
• Minimal perfect hashing in polynomial time
• A practical method for implementing string pattern matching machines
• 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
• Perfect hashing
• A scheme for constructing ordered minimal perfect hashing functions

This page was built for publication: Perfect hashing functions

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