{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:59:10Z","timestamp":1743040750488,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319199283"},{"type":"electronic","value":"9783319199290"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19929-0_33","type":"book-chapter","created":{"date-parts":[[2015,6,15]],"date-time":"2015-06-15T13:09:49Z","timestamp":1434373789000},"page":"385-395","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Encoding Nearest Larger Values"],"prefix":"10.1007","author":[{"given":"Patrick K.","family":"Nicholson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajeev","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,16]]},"reference":[{"key":"33_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-642-03456-5_17","volume-title":"Efficient Algorithms","author":"T Asano","year":"2009","unstructured":"Asano, T., Bereg, S., Kirkpatrick, D.: Finding nearest larger neighbors. In: Albers, S., Alt, H., N\u00e4her, S. (eds.) Efficient Algorithms. LNCS, vol. 5760, pp. 249\u2013260. Springer, Heidelberg (2009). http:\/\/dx.doi.org\/10.1007\/978-3-642-03456-5_17"},{"key":"33_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-40104-6_6","volume-title":"Algorithms and Data Structures","author":"T Asano","year":"2013","unstructured":"Asano, T., Kirkpatrick, D.: Time-space tradeoffs for all-nearest-larger-neighbors problems. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 61\u201372. Springer, Heidelberg (2013). http:\/\/dx.doi.org\/10.1007\/978-3-642-40104-6_6"},{"issue":"3","key":"33_CR3","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1006\/jagm.1993.1018","volume":"14","author":"O Berkman","year":"1993","unstructured":"Berkman, O., Schieber, B., Vishkin, U.: Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values. J. Algorithms 14(3), 344\u2013370 (1993). http:\/\/dx.doi.org\/10.1006\/jagm.1993.1018","journal-title":"J. Algorithms"},{"issue":"2016","key":"33_CR4","doi-asserted-by":"publisher","first-page":"1471","DOI":"10.1098\/rsta.2013.0131","volume":"372","author":"P Davoodi","year":"2014","unstructured":"Davoodi, P., Navarro, G., Raman, R., Rao, S.: Encoding range minima and range top-2 queries. Philos. Trans. R. Soc. A 372(2016), 1471\u20132962 (2014)","journal-title":"Philos. Trans. R. Soc. A"},{"issue":"1","key":"33_CR5","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/s00453-012-9664-0","volume":"68","author":"A Farzan","year":"2014","unstructured":"Farzan, A., Munro, J.J.: A uniform paradigm to succinctly encode various families of trees. Algorithmica 68(1), 16\u201340 (2014). http:\/\/dx.doi.org\/10.1007\/s00453-012-9664-0","journal-title":"Algorithmica"},{"issue":"22","key":"33_CR6","doi-asserted-by":"publisher","first-page":"2451","DOI":"10.1016\/j.tcs.2011.01.036","volume":"412","author":"J Fischer","year":"2011","unstructured":"Fischer, J.: Combined data structure for previous- and next-smaller-values. Theor. Comput. Sci. 412(22), 2451\u20132456 (2011). http:\/\/dx.doi.org\/10.1016\/j.tcs.2011.01.036","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"33_CR7","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1137\/090779759","volume":"40","author":"J Fischer","year":"2011","unstructured":"Fischer, J., Heun, V.: Space-efficient preprocessing schemes for range minimum queries on static arrays. SIAM J. Comput. 40(2), 465\u2013492 (2011)","journal-title":"SIAM J. Comput."},{"issue":"51","key":"33_CR8","doi-asserted-by":"publisher","first-page":"5354","DOI":"10.1016\/j.tcs.2009.09.012","volume":"410","author":"J Fischer","year":"2009","unstructured":"Fischer, J., M\u00e4kinen, V., Navarro, G.: Faster entropy-bounded compressed suffix trees. Theor. Comput. Sci. 410(51), 5354\u20135364 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"33_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-642-25591-5_20","volume-title":"Algorithms and Computation","author":"M Golin","year":"2011","unstructured":"Golin, M., Iacono, J., Krizanc, D., Raman, R., Rao, S.S.: Encoding 2d range maximum queries. In: Asano, T., Nakano, S., Okamoto, Y., Watanabe, O. (eds.) ISAAC 2011. LNCS, vol. 7074, pp. 180\u2013189. Springer, Heidelberg (2011)"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Jayapaul, V., Jo, S., Raman, V., Satti, S.R.: Space efficient data structures for nearest larger neighbor. In: Proceedings of IWOCA 2014 (2014, to appear)","DOI":"10.1007\/978-3-319-19315-1_16"},{"key":"33_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-319-15612-5_6","volume-title":"WALCOM: Algorithms and Computation","author":"S Jo","year":"2015","unstructured":"Jo, S., Raman, R., Rao Satti, S.: Compact encodings and indexes for the nearest larger neighbor problem. In: Rahman, M.S., Tomita, E. (eds.) WALCOM 2015. LNCS, vol. 8973, pp. 53\u201364. Springer, Heidelberg (2015). http:\/\/dx.doi.org\/10.1007\/978-3-319-15612-5_6"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19929-0_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T08:35:57Z","timestamp":1676018157000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19929-0_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319199283","9783319199290"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19929-0_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}