{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,19]],"date-time":"2025-04-19T04:05:31Z","timestamp":1745035531578,"version":"3.40.4"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031845420","type":"print"},{"value":"9783031845437","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-84543-7_2","type":"book-chapter","created":{"date-parts":[[2025,4,18]],"date-time":"2025-04-18T06:53:34Z","timestamp":1744959214000},"page":"15-26","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Sorted Range Selection and\u00a0Range Minima Queries"],"prefix":"10.1007","author":[{"given":"Waseem","family":"Akram","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjeev","family":"Saxena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,19]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Gabow, H.N., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: ACM STOC \u201984, pp. 135\u2013143 (1984)","DOI":"10.1145\/800057.808675"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Brodal, G.S., Fagerberg, R., Greve, M., L\u00f3pez-Ortiz, A.: Online sorted range reporting. In: Algorithms and Computation: 20th International Symposium, ISAAC, pp.\u00a0173\u2013182 (2009)","DOI":"10.1007\/978-3-642-10631-6_19"},{"issue":"9","key":"2_CR3","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/j.ipl.2008.12.006","volume":"109","author":"S Saxena","year":"2009","unstructured":"Saxena, S.: Dominance made simple. Info. Process. Lett. 109(9), 419\u2013421 (2009)","journal-title":"Info. Process. Lett."},{"issue":"2","key":"2_CR4","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0022-0000(82)90048-4","volume":"24","author":"GN Frederickson","year":"1982","unstructured":"Frederickson, G.N., Johnson, D.B.: The complexity of selection and ranking in X + Y and matrices with sorted columns. J. Comput. Syst. Sci. 24(2), 197\u2013208 (1982)","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Afshani, P., Brodal, G.S., Zeh, N.: Ordered and unordered top-k range reporting in large data sets. In: SODA, pp. 390\u2013400 (2011)","DOI":"10.1137\/1.9781611973082.31"},{"issue":"2","key":"2_CR6","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1006\/inco.1993.1030","volume":"104","author":"G Frederickson","year":"1993","unstructured":"Frederickson, G.: An optimal algorithm for selection in a Min-Heap. Info. Comput. 104(2), 197\u2013214 (1993)","journal-title":"Info. Comput."},{"key":"2_CR7","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, Third Edition. 3rd\u00a0edn. The MIT Press (2009)"},{"key":"2_CR8","unstructured":"Range Minimum Query. https:\/\/en.wikipedia.org\/wiki\/Range_minimum_query"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Fischer, J., Heun, V.: Theoretical and practical improvements on the RMQ-problem, with applications to LCA and LCE. In: Combinatorial Pattern Matching, pp. 36\u201348. Springer (2006)","DOI":"10.1007\/11780441_5"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Fischer, J., Heun, V.: A new succinct representation of RMQ-information and improvements in the enhanced suffix array. In: International Symposium on Combinatorics Probabilistic and Experimental Methodologies, Algorithms, pp. 459\u2013470 (2007)","DOI":"10.1007\/978-3-540-74450-4_41"},{"issue":"2","key":"2_CR11","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."},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/10719839_9","volume-title":"LATIN 2000: Theoretical Informatics","author":"MA Bender","year":"2000","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 88\u201394. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10719839_9"},{"issue":"2","key":"2_CR13","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.jalgor.2005.08.001","volume":"57","author":"MA Bender","year":"2005","unstructured":"Bender, M.A., Farach-Colton, M., Pemmasani, G., Skiena, S., Sumazin, P.: Lowest common ancestors in trees and directed acyclic graphs. J. Algorithms 57(2), 75\u201394 (2005)","journal-title":"J. Algorithms"},{"issue":"6","key":"2_CR14","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B Schieber","year":"1988","unstructured":"Schieber, B., Vishkin, U.: On finding lowest common ancestors: simplification and parallelization. SIAM J. Comput. 17(6), 1253\u20131262 (1988)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"2_CR15","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)","journal-title":"J. Algorithms"},{"issue":"2","key":"2_CR16","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1137\/0222017","volume":"22","author":"O Berkman","year":"1993","unstructured":"Berkman, O., Vishkin, U.: Recursive star-tree parallel data structure. SIAM J. Comput. 22(2), 221\u2013242 (1993)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"2_CR17","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1006\/jagm.1997.0905","volume":"28","author":"O Berkman","year":"1998","unstructured":"Berkman, O., Matias, Y., Ragde, P.: Triply-logarithmic parallel upper and lower bounds for minimum and range minima over small domains. J. Algorithms 28(2), 197\u2013215 (1998)","journal-title":"J. Algorithms"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Berg, M., Cheong, O., Krevel, M., Overmars, M.: More geometric data structures. In: Computational Geometry: Algorithms and Applications. 3rd Edn., pp. 219\u2013241 (2008)","DOI":"10.1007\/978-3-540-77974-2_10"},{"key":"2_CR19","unstructured":"https:\/\/stackoverflow.com\/questions\/27990143\/dynamic-prefix-sum"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Brodal, G.S., Davoodi, P., Srinivasa, R.S.: Path minima queries in dynamic weighted trees. In: Algorithms and Data Structures: 12th International Symposium, WADS, pp. 290\u2013301 (2011)","DOI":"10.1007\/978-3-642-22300-6_25"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511574931"}],"container-title":["Lecture Notes in Computer Science","Applied Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-84543-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,18]],"date-time":"2025-04-18T06:53:39Z","timestamp":1744959219000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-84543-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031845420","9783031845437"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-84543-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"19 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 January 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 January 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icaa2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}