A trie compaction algorithm for a large set of keys
- 1 June 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 8 (3) , 476-491
- https://doi.org/10.1109/69.506713
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Applications of finite automata representing large vocabulariesSoftware: Practice and Experience, 1993
- An efficient implementation of trie structuresSoftware: Practice and Experience, 1992
- Implementing dynamic minimal-prefix triesSoftware: Practice and Experience, 1991
- Dynamic hashing schemesACM Computing Surveys, 1988
- The world's fastest Scrabble programCommunications of the ACM, 1988
- Complete inverted files for efficient text retrieval and analysisJournal of the ACM, 1987
- Storing a Sparse Table with 0 (1) Worst Case Access TimeJournal of the ACM, 1984
- Storing a sparse tableCommunications of the ACM, 1979
- Extendible hashing—a fast access method for dynamic filesACM Transactions on Database Systems, 1979
- Trie memoryCommunications of the ACM, 1960