A General Technique for Managing Strings in Comparison-Driven Data Structures
Authors:
- 1 January 2004
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 606-617
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- The suffix binary search tree and suffix AVL treeJournal of Discrete Algorithms, 2003
- Optimal External Memory Interval ManagementSIAM Journal on Computing, 2003
- Digital Access to Comparison-Based Tree Data Structures and AlgorithmsJournal of Algorithms, 2001
- Randomized search treesAlgorithmica, 1996
- A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case timeInformation and Computation, 1992
- Biased Search TreesSIAM Journal on Computing, 1985
- Self-adjusting binary search treesJournal of the ACM, 1985
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984
- Multidimensional B-tree: An efficient dynamic file structure for exact match queries1980
- Randomized binary searching with tree structuresCommunications of the ACM, 1964