Author:
Pontelli Enrico,Ranjan Desh
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. S. Alstrup and M. Thorup. Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees. Journal of Algorithms, 35:169–188, 2000.
2. A.M. Ben-Amram. What is a Pointer Machine? Tech. Rep., U. Copenhagen, 1995.
3. M.A. Bender and M. Farach-Colton. The LCA Problem Revisited. In LATIN 2000, Springer Verlag, 2000.
4. O. Berkman and U. Vishkin. Recursive *-tree Parallel Data-structure. In FOCS, IEEE Computer Society, 1989.
5. R. Cole and R. Hariharan. Dynamic LCA Queries on Trees. In Proceedings of the Symposium on Discrete Algorithms (SODA), pages 235–244. ACM/SIAM, 1999.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献