{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:21:22Z","timestamp":1725571282165},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175138"},{"type":"electronic","value":"9783642175145"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17514-5_3","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T15:09:23Z","timestamp":1291388963000},"page":"25-36","source":"Crossref","is-referenced-by-count":2,"title":["Dynamic Range Reporting in External Memory"],"prefix":"10.1007","author":[{"given":"Yakov","family":"Nekrich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Afshani, P.: On Dominance Reporting in 3D. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol.\u00a05193, pp. 41\u201351. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-87744-8_4"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Afshani, P., Arge, L., Larsen, K.D.: Orthogonal Range Reporting in Three and Higher Dimensions. In: Proc. FOCS 2009, pp. 149\u2013158 (2009)","DOI":"10.1109\/FOCS.2009.58"},{"key":"3_CR3","first-page":"1","volume-title":"Advances in Discrete and Computational Geometry","author":"P.K. Agarwal","year":"1999","unstructured":"Agarwal, P.K., Erickson, J.: Geometric Range Searching and its Relatives. In: Chazelle, B., Goodman, J.E., Pollack, R. (eds.) Advances in Discrete and Computational Geometry, pp. 1\u201356. AMS Press, Providence (1999)"},{"issue":"9","key":"3_CR4","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"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Alstrup, S., Brodal, G.S., Rauhe, T.: New Data Structures for Orthogonal Range Searching. In: Proc. FOCS 2000, pp. 198\u2013207 (2000)","DOI":"10.1109\/SFCS.2000.892088"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Alstrup, S., Husfeldt, T., Rauhe, T.: Marked Ancestor Problems. In: Proc. FOCS 1998, pp. 534\u2013544 (1998)","DOI":"10.1109\/SFCS.1998.743504"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44676-1_1","volume-title":"Algorithms - ESA 2001","author":"L. Arge","year":"2001","unstructured":"Arge, L.: External Memory Data Structures. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 1\u201329. Springer, Heidelberg (2001)"},{"key":"3_CR8","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\u201324 (2003)","journal-title":"Algorithmica"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Arge, L., Samoladas, V., Vitter, J.S.: On Two-Dimensional Indexability and Optimal Range Search Indexing. In: Proc. PODS 1999, pp. 346\u2013357 (1999)","DOI":"10.1145\/303976.304010"},{"issue":"6","key":"3_CR10","doi-asserted-by":"publisher","first-page":"1488","DOI":"10.1137\/S009753970240481X","volume":"32","author":"L. Arge","year":"2003","unstructured":"Arge, L., Vitter, J.S.: Optimal External Memory Interval Management. SIAM J. Comput.\u00a032(6), 1488\u20131508 (2003)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"3_CR11","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF01840441","volume":"1","author":"B. Chazelle","year":"1986","unstructured":"Chazelle, B., Guibas, L.J.: Fractional Cascading: II. Applications. Algorithmica\u00a01(2), 163\u2013191 (1986)","journal-title":"Algorithmica"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1006\/jcss.1998.1577","volume":"57","author":"P.B. Miltersen","year":"1998","unstructured":"Miltersen, P.B., Nisan, N., Safra, S., Wigderson, A.: On Data Structures and Asymmetric Communication Complexity. J. Comput. Syst. Sci.\u00a057, 37\u201349 (1998)","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"3_CR13","doi-asserted-by":"publisher","first-page":"1494","DOI":"10.1137\/S0097539703436722","volume":"35","author":"C.W. Mortensen","year":"2006","unstructured":"Mortensen, C.W.: Fully Dynamic Orthogonal Range Reporting on RAM. SIAM J. Computing\u00a035(6), 1494\u20131525 (2006)","journal-title":"SIAM J. Computing"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Nekrich, Y.: A Data Structure for Multi-Dimensional Range Reporting. In: Proc. SoCG 2007, pp. 344\u2013353 (2007)","DOI":"10.1145\/1247069.1247130"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/978-3-540-77120-3_46","volume-title":"Algorithms and Computation","author":"Y. Nekrich","year":"2007","unstructured":"Nekrich, Y.: External Memory Range Reporting on a Grid. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol.\u00a04835, pp. 525\u2013535. Springer, Heidelberg (2007)"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/978-3-540-78773-0_59","volume-title":"LATIN 2008: Theoretical Informatics","author":"Y. Nekrich","year":"2008","unstructured":"Nekrich, Y.: I\/O-Efficient Point Location in a Set of Rectangles. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol.\u00a04957, pp. 687\u2013698. Springer, Heidelberg (2008)"},{"key":"3_CR17","unstructured":"Nekrich, Y.: Dynamic Range Reporting in External Memory, arXiv: 1006.4093v1"},{"issue":"2","key":"3_CR18","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/0196-6774(88)90041-7","volume":"9","author":"M.H. Overmars","year":"1988","unstructured":"Overmars, M.H.: Efficient Data Structures for Range Searching on a Grid. J. Algorithms\u00a09(2), 254\u2013275 (1988)","journal-title":"J. Algorithms"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"P\u01cetra\u015fcu, M.: (Data) Structures. In: Proc. FOCS 2008, pp. 434-443 (2008)","DOI":"10.1109\/FOCS.2008.69"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"P\u01cetra\u015fcu, M., Thorup, M.: Time-space Trade-offs for Predecessor Search. In: Proc. STOC 2006, pp. 232\u2013240 (2006)","DOI":"10.1145\/1132516.1132551"},{"key":"3_CR21","unstructured":"Subramanian, S., Ramaswamy, S.: The P-range Tree: A New Data Structure for Range Searching in Secondary Memory. In: Proc. SODA 1995, pp. 378\u2013387 (1995)"},{"issue":"2","key":"3_CR22","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/384192.384193","volume":"33","author":"J.S. Vitter","year":"2001","unstructured":"Vitter, J.S.: External Memory Algorithms and Data Structures: Dealing with Massive Data. ACM Computing Surveys\u00a033(2), 209\u2013271 (2001)","journal-title":"ACM Computing Surveys"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Vengroff, D.E., Vitter, J.S.: Efficient 3-D Range Searching in External Memory. In: Proc. STOC 1996, pp. 192\u2013201 (1996)","DOI":"10.1145\/237814.237864"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17514-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T15:49:08Z","timestamp":1559836148000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17514-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175138","9783642175145"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17514-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}