Surpassing the information theoretic bound with fusion trees
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Finding level-ancestors in trees
Journal of Computer and System Sciences
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Optimal bounds for the predecessor problem and related problems
Journal of Computer and System Sciences - STOC 1999
Perfect Hashing for Strings: Formalization and Algorithms
CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
The level ancestor problem simplified
Theoretical Computer Science - Latin American theorotical informatics
Efficient String Matching Algorithms for Combinatorial Universal Denoising
DCC '05 Proceedings of the Data Compression Conference
Time-space trade-offs for predecessor search
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Towards real-time suffix tree construction
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
The property suffix tree with dynamic properties
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Fast, precise and dynamic distance queries
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Efficient data structures for the factor periodicity problem
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Full-Fledged real-time indexing for constant size alphabets
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Cross-document pattern matching
Journal of Discrete Algorithms
| Hi-index | 0.00 |
In the weighted ancestor problem one preprocesses a weighted tree (the weights are on the nodes and increase with tree depth) to support predecessor queries, which are called weighted ancestors queries, on the paths from the query node to the root. Since, the weighted ancestor problem appears in numerous applications, the problem has been studied and solutions for static trees are well known. However, it has been an open question whether this can be solved optimally for the dynamic version of the problem, where node insertions are supported. Node insertions are leaf insertions or edge splittings. In this paper we present a solution for the dynamic weighted ancestors problem which supports queries and update operations in the same time bounds as those for dynamic predecessor structures.