Author:
Takagi Takuya,Inenaga Shunsuke,Sadakane Kunihiko,Arimura Hiroki
Publisher
Springer International Publishing
Reference22 articles.
1. Alstrup, S., Gavoille, C., Kaplan, H., Rauhe, T.: Nearest common ancestors: a survey and a new distributed algorithm. Theory Comp. Sys. 37, 441–456 (2002)
2. Andersson, A., Thorup, M.: Dynamic ordered sets with exponential search trees. J. ACM 54(3), 13 (2007)
3. Beame, P., Fich, F.E.: Optimal bounds for the predecessor problem and related problems. J. Comput. Syst. Sci. 65(1), 38–72 (2002)
4. Lecture Notes in Computer Science;D Belazzougui,2010
5. Ben-Kiki, O., Bille, P., Breslauer, D., Gasieniec, L., Grossi, R., Weimann, O.: Optimal packed string matching. In: FSTTCS 2011, pp. 423–432 (2011)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献