{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:29:26Z","timestamp":1761611366980},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319156118"},{"type":"electronic","value":"9783319156125"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-15612-5_6","type":"book-chapter","created":{"date-parts":[[2015,2,23]],"date-time":"2015-02-23T04:05:18Z","timestamp":1424664318000},"page":"53-64","source":"Crossref","is-referenced-by-count":1,"title":["Compact Encodings and Indexes for the Nearest Larger Neighbor Problem"],"prefix":"10.1007","author":[{"given":"Seungbum","family":"Jo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajeev","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srinivasa","family":"Rao Satti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_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.\u00a05760, pp. 249\u2013260. Springer, Heidelberg (2009)"},{"key":"6_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.\u00a08037, pp. 61\u201372. Springer, Heidelberg (2013)"},{"issue":"3","key":"6_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\u00a014(3), 344\u2013370 (1993)","journal-title":"J. Algorithms"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-642-40450-4_20","volume-title":"Algorithms \u2013 ESA 2013","author":"G.S. Brodal","year":"2013","unstructured":"Brodal, G.S., Brodnik, A., Davoodi, P.: The encoding complexity of two dimensional range minimum data structures. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol.\u00a08125, pp. 229\u2013240. Springer, Heidelberg (2013)"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-642-33090-2_20","volume-title":"Algorithms \u2013 ESA 2012","author":"G.S. Brodal","year":"2012","unstructured":"Brodal, G.S., Davoodi, P., Lewenstein, M., Raman, R., Srinivasa Rao, S.: Two dimensional range minimum queries and fibonacci lattices. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol.\u00a07501, pp. 217\u2013228. Springer, Heidelberg (2012)"},{"issue":"4","key":"6_CR6","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1007\/s00453-011-9499-0","volume":"63","author":"G.S. Brodal","year":"2012","unstructured":"Brodal, G.S., Davoodi, P., Rao, S.S.: On space efficient two dimensional range minimum data structures. Algorithmica\u00a063(4), 815\u2013830 (2012)","journal-title":"Algorithmica"},{"issue":"3","key":"6_CR7","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/s00453-012-9683-x","volume":"68","author":"E.D. Demaine","year":"2014","unstructured":"Demaine, E.D., Landau, G.M., Weimann, O.: On cartesian trees and range minimum queries. Algorithmica\u00a068(3), 610\u2013625 (2014)","journal-title":"Algorithmica"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Manzini, G., M\u00e4kinen, V., Navarro, G.: Compressed representations of sequences and full-text indexes. ACM Transactions on Algorithms 3(2) (2007)","DOI":"10.1145\/1240233.1240243"},{"issue":"22","key":"6_CR9","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.\u00a0412(22), 2451\u20132456 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"51","key":"6_CR10","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.\u00a0410(51), 5354\u20135364 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Jacobson, G.: Space-efficient static trees and graphs. In: FOCS, pp. 549\u2013554. IEEE Computer Society (1989)","DOI":"10.1109\/SFCS.1989.63533"},{"key":"6_CR12","unstructured":"Jayapaul, V., Jo, S., Raman, V., Satti, S.R.: Space efficient data structures for nearest larger neighbor. In: Proc. IWOCA 2014 (to appear, 2014)"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Okanohara, D., Sadakane, K.: Practical entropy-compressed rank\/select dictionary. In: ALENEX (2007)","DOI":"10.1137\/1.9781611972870.6"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15612-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:53:36Z","timestamp":1559123616000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-15612-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319156118","9783319156125"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15612-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}