Author:
Patil Manish,Shah Rahul,Thankachan Sharma V.
Publisher
Springer International Publishing
Reference12 articles.
1. Lecture Notes in Computer Science;A. Amir,2011
2. Chan, T.M., Larsen, K.G., Patrascu, M.: Orthogonal range searching on the ram, revisited. In: Symposium on Computational Geometry, pp. 1–10 (2011)
3. Cormode, G., Muthukrishnan, S.: Substring compression problems. In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, pp. 321–330 (2005)
4. Crochemore, M., Iliopoulos, C.S., Kubica, M., Rahman, M.S., Tischler, G., Walen, T.: Improved algorithms for the range next value problem and applications. Theor. Comput. Sci. 434, 23–34 (2012)
5. Lecture Notes in Computer Science;O. Keller,2009
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献