Y Fast Trie Search
Search for an integer key using a Y fast trie, combining hashing with balanced trees for linear space.
Tag
Integer-Set
3 notes
3 notes
Search for an integer key using a Y fast trie, combining hashing with balanced trees for linear space.
Search for an integer key in an X fast trie using hashed prefixes over a binary trie.
Search for an integer key in a van Emde Boas tree using recursive universe decomposition.