Research graph
References from A dynamic construction algorithm for the Compact Patricia trie using the hierarchical structure. Local targets link to admitted publications; unresolved targets remain external evidence.
Unresolved reference
1983 · External reference
An efficient digital search algorithm by using a double-array structure
10.1109/32.31365 · 1989 · External reference
Unresolved reference
1991 · External reference
A trie compaction algorithm for a large set of keys
10.1109/69.506713 · 1996 · External reference
Complete inverted files for efficient text retrieval and analysis
10.1145/28869.28873 · 1987 · External reference
Unresolved reference
External reference
Unresolved reference
External reference
Two access methods using compact binary trees
10.1109/tse.1987.233491 · 1987 · External reference
Trie hashing with controlled load
10.1109/32.83904 · 1991 · External reference
PATRICIA: practical algorithm to retrieve information coded in alpha-numeric
10.1145/321479.321481 · 1968 · External reference
Coding grams of variable length into fixed bytes for fast full text retrieval with compact indices
1999 · External reference
An algorithm for string matching with a sequence of don't cares
10.1016/0020-0190(91)90032-d · 1991 · External reference
Unresolved reference
External reference
