{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T16:02:54Z","timestamp":1769097774942,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642028816","type":"print"},{"value":"9783642028823","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02882-3_22","type":"book-chapter","created":{"date-parts":[[2009,7,10]],"date-time":"2009-07-10T06:49:21Z","timestamp":1247208561000},"page":"215-224","source":"Crossref","is-referenced-by-count":10,"title":["Space Efficient Multi-dimensional Range Reporting"],"prefix":"10.1007","author":[{"given":"Marek","family":"Karpinski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yakov","family":"Nekrich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_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":"22_CR2","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"},{"issue":"5","key":"22_CR3","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0020-0190(79)90117-0","volume":"8","author":"J.L. Bentley","year":"1979","unstructured":"Bentley, J.L.: Decomposable Searching Problems. Information Processing Letters\u00a08(5), 244\u2013251 (1979)","journal-title":"Information Processing Letters"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/358841.358850","volume":"23","author":"J.L. Bentley","year":"1980","unstructured":"Bentley, J.L.: Multidimensional Divide-and-Conquer. Commun. ACM\u00a023, 214\u2013229 (1980)","journal-title":"Commun. ACM"},{"issue":"1","key":"22_CR5","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1093\/comjnl\/40.1.22","volume":"40","author":"P. Bozanis","year":"1997","unstructured":"Bozanis, P., Kitsios, N., Makris, C., Tsakalidis, A.: New Results on Intersection Query Problems. The Computer Journal\u00a040(1), 22\u201329 (1997)","journal-title":"The Computer Journal"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1137\/0217026","volume":"17","author":"B. Chazelle","year":"1988","unstructured":"Chazelle, B.: A Functional Approach to Data Structures and its Use in Multidimensional Searching. SIAM J. on Computing\u00a017, 427\u2013462 (1988)","journal-title":"SIAM J. on Computing"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF02187875","volume":"2","author":"B. Chazelle","year":"1987","unstructured":"Chazelle, B., Edelsbrunner, H.: Linear Space Data Structures for Two Types of Range Search. Discrete & Computational Geometry\u00a02, 113\u2013126 (1987)","journal-title":"Discrete & Computational Geometry"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Chazelle, B., Guibas, L.J.: Fractional Cascading: I. A Data Structuring Technique. Algorithmica\u00a01, 133\u2013162 (1986); see also ICALP (1985)","DOI":"10.1007\/BF01840440"},{"issue":"3","key":"22_CR9","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","volume":"6","author":"P. Emde Boas van","year":"1977","unstructured":"van Emde Boas, P.: Preserving Order in a Forest in Less Than Logarithmic Time and Linear Space. Inf. Process. Lett.\u00a06(3), 80\u201382 (1977)","journal-title":"Inf. Process. Lett."},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Gabow, H., Bentley, J.L., Tarjan, R.E.: Scaling and Related Techniques for Geometry Problems. In: Proc. STOC 1984, pp. 135\u2013143 (1984)","DOI":"10.1145\/800057.808675"},{"key":"22_CR11","unstructured":"Karpinski, M., Nekrich, Y.: Space Efficient Multi-Dimensional Range Reporting, arXiv0806.4361"},{"issue":"2","key":"22_CR12","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/s00453-007-9030-9","volume":"49","author":"Y. Nekrich","year":"2007","unstructured":"Nekrich, Y.: Space Efficient Dynamic Orthogonal Range Reporting. Algorithmica\u00a049(2), 94\u2013108 (2007)","journal-title":"Algorithmica"},{"key":"22_CR13","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":"22_CR14","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)"},{"key":"22_CR15","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","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02882-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T06:44:51Z","timestamp":1558421091000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02882-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642028816","9783642028823"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02882-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}