Perfect hashing functions
From MaRDI portal
Publication:4135041
DOI10.1145/359863.359887zbMath0361.68137MaRDI 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
68P20: Information storage and retrieval of data
68N01: General topics in the theory of software
68W99: Algorithms in computer science
Related Items
Minimal perfect hashing in polynomial time, Performance analysis of temporal queries, 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 practical method for implementing string pattern matching machines, Polynomial-time compression, A refinement of a compression-oriented addressing scheme, Perfect hashing, A scheme for constructing ordered minimal perfect hashing functions, An algebraic approach to Cichelli's perfect hashing, Perfect Storage Representations for Families of Data Structures