Pages that link to "Item:Q1199953"
From MaRDI portal
The following pages link to An optimal algorithm for generating minimal perfect hash functions (Q1199953):
Displaying 9 items.
- The self-indexed search algorithm: a bit-level approach to minimal perfect hashing (Q294669) (← links)
- Minimal perfect hashing in polynomial time (Q911304) (← links)
- An ordered minimal perfect hashing scheme based upon Euler's theorem (Q1060014) (← links)
- Finding succinct ordered minimal perfect hash functions (Q1336764) (← links)
- Perfect hashing (Q1391123) (← links)
- Hash function design for cloud storage data auditing (Q2333825) (← links)
- Construct a perfect word hash function in time independent of the size of integers (Q2404612) (← links)
- A Linear Time Algorithm for Finding Minimal Perfect Hash Functions (Q3140119) (← links)
- Vowel-consonant addressing mode on hashing for English letter-oriented keys (Q4678474) (← links)