Author:
Bille Philip,Cording Patrick Hagge,Gørtz Inge Li,Sach Benjamin,Vildhøj Hjalte Wedel,Vind Søren
Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. Lecture Notes in Computer Science;S. Alstrup,2000
2. Lecture Notes in Computer Science;A. Amir,1992
3. Andoni, A., Indyk, P.: Efficient algorithms for substring near neighbor problem. In: Proc. 17th SODA, pp. 1203–1212 (2006)
4. Belazzougui, D., Boldi, P., Vigna, S.: Predecessor search with distance-sensitive query time. arXiv:1209.5441 (2012)
5. Bender, M., Farach-Colton, M.: The level ancestor problem simplified. Theoret. Comput. Sci. 321, 5–12 (2004)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献