Author:
Bille Philip,Gawrychowski Paweł,Gørtz Inge Li,Landau Gad M.,Weimann Oren
Funder
Danish Research Council
Danish National Advanced Technology Foundation
Israel Science Foundation
United States–Israel Binational Science Foundation
DFG
Subject
General Computer Science,Theoretical Computer Science
Reference37 articles.
1. Nearest common ancestors: a survey and a new algorithm for a distributed environment;Alstrup;Theory Comput. Syst.,2004
2. Improved algorithms for finding level ancestors in dynamic trees;Alstrup,2000
3. Minimizing diameters of dynamic trees;Alstrup,1997
4. Maintaining center and median in dynamic trees;Alstrup,2000
5. Faster algorithms for string matching with k mismatches;Amir;J. Algorithms,2004
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Efficiently computing runs on a trie;Theoretical Computer Science;2021-10
2. Minimal Unique Palindromic Substrings After Single-Character Substitution;String Processing and Information Retrieval;2021
3. Predecessor Search;ACM Computing Surveys;2020-10-15