Author:
Das Ananda Swarup,Gupta Prosenjit,Srinathan Kannan
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Lecture Notes in Computer Science;G.S. Brodal,2011
2. Clark, D.R., Munro, J.I.: Efficient suffix trees on secondary storage (extended abstract). In: SODA, pp. 383–391 (1996)
3. Lecture Notes in Computer Science;A.S. Das,2012
4. Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM J. Comput. 13(2), 338–355 (1984)
5. Lecture Notes in Computer Science;A.K. Kalavagattu,2012
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献