The following pages link to Perfect hashing functions (Q4135041):
Displaying 13 items.
- The self-indexed search algorithm: a bit-level approach to minimal perfect hashing (Q294669) (← links)
- Minimal perfect hashing in polynomial time (Q911304) (← links)
- Performance analysis of temporal queries (Q918668) (← links)
- Minimal and almost minimal perfect hash function search with application to natural language lexicon design (Q1055206) (← links)
- A backtracking method for constructing perfect hash functions from a set of mapping functions (Q1059411) (← links)
- An ordered minimal perfect hashing scheme based upon Euler's theorem (Q1060014) (← links)
- A practical method for implementing string pattern matching machines (Q1193694) (← links)
- Polynomial-time compression (Q1198955) (← links)
- A refinement of a compression-oriented addressing scheme (Q1317853) (← links)
- Perfect hashing (Q1391123) (← links)
- A scheme for constructing ordered minimal perfect hashing functions (Q1820600) (← links)
- An algebraic approach to Cichelli's perfect hashing (Q1825632) (← links)
- Perfect Storage Representations for Families of Data Structures (Q3036701) (← links)