{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:14:53Z","timestamp":1759637693671},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319024318"},{"type":"electronic","value":"9783319024325"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-02432-5_29","type":"book-chapter","created":{"date-parts":[[2013,9,29]],"date-time":"2013-09-29T20:51:58Z","timestamp":1380487918000},"page":"263-270","source":"Crossref","is-referenced-by-count":2,"title":["Faster Range LCP Queries"],"prefix":"10.1007","author":[{"given":"Manish","family":"Patil","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rahul","family":"Shah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sharma V.","family":"Thankachan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/978-3-642-25591-5_70","volume-title":"Algorithms and Computation","author":"A. Amir","year":"2011","unstructured":"Amir, A., Apostolico, A., Landau, G.M., Levy, A., Lewenstein, M., Porat, E.: Range LCP. In: Asano, T., Nakano, S.-i., Okamoto, Y., Watanabe, O. (eds.) ISAAC 2011. LNCS, vol.\u00a07074, pp. 683\u2013692. Springer, Heidelberg (2011)"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Chan, T.M., Larsen, K.G., Patrascu, M.: Orthogonal range searching on the ram, revisited. In: Symposium on Computational Geometry, pp. 1\u201310 (2011)","DOI":"10.1145\/1998196.1998198"},{"key":"29_CR3","unstructured":"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\u2013330 (2005)"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.tcs.2012.02.015","volume":"434","author":"M. Crochemore","year":"2012","unstructured":"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.\u00a0434, 23\u201334 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-642-02441-2_3","volume-title":"Combinatorial Pattern Matching","author":"O. Keller","year":"2009","unstructured":"Keller, O., Kopelowitz, T., Landau, S., Lewenstein, M.: Generalized substring compression. In: Kucherov, G., Ukkonen, E. (eds.) CPM 2009 Lille. LNCS, vol.\u00a05577, pp. 26\u201338. Springer, Heidelberg (2009)"},{"issue":"2","key":"29_CR6","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0196-6774(89)90010-2","volume":"10","author":"G.M. Landau","year":"1989","unstructured":"Landau, G.M., Vishkin, U.: Fast parallel and serial approximate string matching. Journal of algorithms\u00a010(2), 157\u2013169 (1989)","journal-title":"Journal of algorithms"},{"issue":"1","key":"29_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/TIT.1976.1055501","volume":"22","author":"A. Lempel","year":"1976","unstructured":"Lempel, A., Ziv, J.: On the complexity of finite sequences. IEEE Transactions on Information Theory\u00a022(1), 75\u201381 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"29_CR8","first-page":"25","volume":"28","author":"H.-P. Lenhof","year":"1994","unstructured":"Lenhof, H.-P., Smid, M.H.M.: Using persistent data structures for adding range restrictions to searching problems. ITA\u00a028(1), 25\u201349 (1994)","journal-title":"ITA"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Nekrich, Y., Navarro, G.: Sorted range reporting. In: SWAT, pp. 271\u2013282 (2012)","DOI":"10.1007\/978-3-642-31155-0_24"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Patrascu, M., Thorup, M.: Time-space trade-offs for predecessor search. In: STOC, pp. 232\u2013240 (2006)","DOI":"10.1145\/1132516.1132551"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear Pattern Matching Algorithms. In: SWAT, pp. 1\u201311 (1973)","DOI":"10.1109\/SWAT.1973.13"},{"issue":"3","key":"29_CR12","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.comgeo.2010.09.001","volume":"44","author":"C.-C. Yu","year":"2011","unstructured":"Yu, C.-C., Hon, W.-K., Wang, B.-F.: Improved data structures for the orthogonal range successor problem. Comput. Geom.\u00a044(3), 148\u2013159 (2011)","journal-title":"Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-02432-5_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T12:40:17Z","timestamp":1558096817000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-02432-5_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319024318","9783319024325"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-02432-5_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}