Burst tries
- 1 April 2002
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 20 (2) , 192-223
- https://doi.org/10.1145/506309.506312
Abstract
No abstract availableKeywords
This publication has 40 references indexed in Scilit:
- Dynamical sources in information theory: A general analysis of trie structuresAlgorithmica, 2001
- Fast text searching for regular expressions or automaton searching on triesJournal of the ACM, 1996
- A trie compaction algorithm for a large set of keysIEEE Transactions on Knowledge and Data Engineering, 1996
- Improved behaviour of tries by adaptive branchingInformation Processing Letters, 1993
- An evaluation of self‐adjusting binary search tree techniquesSoftware: Practice and Experience, 1993
- An efficient implementation of trie structuresSoftware: Practice and Experience, 1992
- Algorithms for trie compactionACM Transactions on Database Systems, 1984
- Analysis of a heuristic for full trie minimizationACM Transactions on Database Systems, 1981
- Heuristics for trie index minimizationACM Transactions on Database Systems, 1979
- The Complexity of Trie Index ConstructionJournal of the ACM, 1977