An efficient implementation of trie structures
- 1 September 1992
- journal article
- research article
- Published by Wiley in Software: Practice and Experience
- Vol. 22 (9) , 695-721
- https://doi.org/10.1002/spe.4380220902
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Implementing dynamic minimal-prefix triesSoftware: Practice and Experience, 1991
- A Method for Improving String Pattern Matching MachinesIEEE Transactions on Software Engineering, 1984
- A practical method for reducing sparse matrices with invariant entriesInternational Journal of Computer Mathematics, 1982
- Storing a sparse tableCommunications of the ACM, 1979
- Compressed triesCommunications of the ACM, 1976
- Trie memoryCommunications of the ACM, 1960