{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T16:39:23Z","timestamp":1769099963944,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642401039","type":"print"},{"value":"9783642401046","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40104-6_4","type":"book-chapter","created":{"date-parts":[[2013,7,11]],"date-time":"2013-07-11T01:36:30Z","timestamp":1373506590000},"page":"37-48","source":"Crossref","is-referenced-by-count":7,"title":["On (Dynamic) Range Minimum Queries in External Memory"],"prefix":"10.1007","author":[{"given":"Lars","family":"Arge","sequence":"first","affiliation":[]},{"given":"Johannes","family":"Fischer","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Sanders","sequence":"additional","affiliation":[]},{"given":"Nodari","family":"Sitchinava","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"9","key":"4_CR1","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A. Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J.S.: The input\/output complexity of sorting and related problems. Communications of the ACM\u00a031(9), 1116\u20131127 (1988)","journal-title":"Communications of the ACM"},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-003-1021-x","volume":"37","author":"L. Arge","year":"2003","unstructured":"Arge, L.: The buffer tree: A technique for designing batched external data structures. Algorithmica\u00a037(1), 1\u201324 (2003)","journal-title":"Algorithmica"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Arge, L., Goodrich, M.T., Nelson, M.J., Sitchinava, N.: Fundamental parallel algorithms for private-cache chip multiprocessors. In: SPAA, pp. 197\u2013206 (2008)","DOI":"10.1145\/1378533.1378573"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Arge, L., Goodrich, M.T., Sitchinava, N.: Parallel external memory graph algorithms. In: IPDPS, pp. 1\u201311 (2010)","DOI":"10.1109\/IPDPS.2010.5470440"},{"key":"4_CR5","unstructured":"Arge, L., Procopiuc, O., Ramaswamy, S., Suel, T., Vitter, J.S.: Theory and practice of I\/O-efficient algorithms for multidimensional batched searching problems. In: SODA, pp. 685\u2013694 (1998)"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Arge, L., Toma, L., Zeh, N.: I\/O-efficient topological sorting of planar DAGs. In: SPAA, pp. 85\u201393. ACM Press (2003)","DOI":"10.1145\/777426.777427"},{"key":"4_CR7","unstructured":"Chiang, Y.J., Goodrich, M.T., Grove, E.F., Tamassia, R., Vengroff, D.E., Vitter, J.S.: External-memory graph algorithms. In: SODA, pp. 139\u2013149 (1995)"},{"issue":"2","key":"4_CR8","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.\u00a040(2), 465\u2013492 (2011)","journal-title":"SIAM J. Comput."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Fischer, J., M\u00e4kinen, V., V\u00e4lim\u00e4ki, N.: Space efficient string mining under frequency constraints. In: Proc. ICDM, pp. 193\u2013202. IEEE Computer Society (2008)","DOI":"10.1109\/ICDM.2008.32"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1007\/978-3-540-27836-8_52","volume-title":"Automata, Languages and Programming","author":"G. Franceschini","year":"2004","unstructured":"Franceschini, G., Grossi, R.: A general technique for managing strings in comparison-driven data structures. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 606\u2013617. Springer, Heidelberg (2004)"},{"issue":"6","key":"4_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1217856.1217858","volume":"53","author":"J. K\u00e4rkk\u00e4inen","year":"2006","unstructured":"K\u00e4rkk\u00e4inen, J., Sanders, P., Burkhardt, S.: Linear work suffix array construction. J. ACM\u00a053(6), 1\u201319 (2006)","journal-title":"J. ACM"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/978-3-642-35926-2_30","volume-title":"IWOCA 2012","author":"R. Raman","year":"2012","unstructured":"Raman, R.: Range extremum queries. In: Smyth, B. (ed.) IWOCA 2012. LNCS, vol.\u00a07643, pp. 280\u2013287. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40104-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,17]],"date-time":"2019-07-17T21:09:34Z","timestamp":1563397774000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40104-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401039","9783642401046"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40104-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}