Author:
Fischer Johannes,Mäkinen Veli,Navarro Gonzalo
Subject
General Computer Science,Theoretical Computer Science
Reference47 articles.
1. Replacing suffix trees with enhanced suffix arrays;Abouelhoda;Journal of Discrete Algorithms,2004
2. S. Alstrup, C. Gavoille, H. Kaplan, T. Rauhe, Nearest common ancestors: A survey and a new distributed algorithm, in: Proc. 14th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA, 2002, pp. 258–264
3. The myriad virtues of subword trees;Apostolico,1985
4. Lowest common ancestors in trees and directed acyclic graphs;Bender;Journal of Algorithms,2005
5. Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values;Berkman;Journal of Algorithms,1993
Cited by
64 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献