{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T08:00:36Z","timestamp":1781078436490,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540241317","type":"print"},{"value":"9783540305514","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_49","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:15:37Z","timestamp":1279044937000},"page":"558-568","source":"Crossref","is-referenced-by-count":45,"title":["Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting"],"prefix":"10.1007","author":[{"given":"Joseph","family":"JaJa","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian W.","family":"Mortensen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qingmin","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"49_CR1","doi-asserted-by":"crossref","unstructured":"Alstrup, S., Brodal, G.S., Rauhe, T.: New data structures for orthogonal range searching. In: Proceedings of IEEE Symposium on Foundations of Computer Science, Redondo Beach, pp. 198\u2013207 (2000)","DOI":"10.1109\/SFCS.2000.892088"},{"key":"49_CR2","doi-asserted-by":"crossref","unstructured":"Alstrup, S., Gavoille, C., Kaplan, H., Rauhe, T.: Nearest common ancestors: A survey and a new distributed algorithm. In: Proceedings of the 14th ACM Symp. on Parallel Algorithms and Architecture (SPAA), August, pp. 258\u2013264 (2002)","DOI":"10.1145\/564870.564914"},{"issue":"4","key":"49_CR3","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/358841.358850","volume":"23","author":"J.L. Bentley","year":"1980","unstructured":"Bentley, J.L.: Jon\u00a0Louis Bentley. Multidimensional divide-and-conquer. Communications of the ACM\u00a023(4), 214\u2013229 (1980)","journal-title":"Communications of the ACM"},{"key":"49_CR4","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF02187875","volume":"3","author":"B. Chazelle","year":"1987","unstructured":"Chazelle, B., Edelsbrunner, H.: Bernard Chazelle and H.\u00a0Edelsbrunner. Linear space data structures for two types of range search. Discrete Comput. Geom.\u00a03, 113\u2013126 (1987)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"49_CR5","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01840440","volume":"1","author":"B. Chazelle","year":"1986","unstructured":"Chazelle, B., Guibas, L.J.: Fractional Cascading: I. A data structure technique. Algorithmica\u00a01(2), 133\u2013162 (1986)","journal-title":"Algorithmica"},{"issue":"3","key":"49_CR6","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1137\/0217026","volume":"17","author":"B. Chazelle","year":"1988","unstructured":"Chazelle, B.: Bernard Chazelle. A functional approach to data structures and its use in multidimensional searching. SIAM Journal on Computing\u00a017(3), 427\u2013463 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"49_CR7","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/0020-0190(82)90068-0","volume":"14","author":"H. Edelsbrunner","year":"1982","unstructured":"Edelsbrunner, H., Overmars, M.H.: On the equivalence of some rectangle problems. Information Processing Letters\u00a014, 124\u2013127 (1982)","journal-title":"Information Processing Letters"},{"key":"49_CR8","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/0022-0000(93)90040-4","volume":"47","author":"M.L. Fredman","year":"1993","unstructured":"Fredman, M.L., Willard, D.E.: Surpassing the information theoretic bound with fusion trees. Journal of Computer and System Sciences\u00a047, 424\u2013436 (1993)","journal-title":"Journal of Computer and System Sciences"},{"key":"49_CR9","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/S0022-0000(05)80064-9","volume":"48","author":"M.L. Fredman","year":"1994","unstructured":"Fredman, M.L., Willard, D.E.: Trans-dichotomous algorithms for minimum spanning trees and shortest paths. Journal of Computer and System Sciences\u00a048, 533\u2013551 (1994)","journal-title":"Journal of Computer and System Sciences"},{"key":"49_CR10","doi-asserted-by":"crossref","unstructured":"Govindarajan, S., Agarwal, P.K., Arge, L.: CRB-Tree: an efficient indexing scheme for range-aggregate queries. In: Proceedings of the 9th International Conference on Database Theory, Siena, Italy (2003)","DOI":"10.1007\/3-540-36285-1_10"},{"key":"49_CR11","unstructured":"Mortensen, C.W.: Fully-dynamic orthogonal range reporting on RAM (Preliminary version). Technical Report TR-2003-22, The IT University of Copenhagen (2003)"},{"issue":"6","key":"49_CR12","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0020-0190(98)00075-1","volume":"66","author":"C. Makris","year":"1998","unstructured":"Makris, C., Tsakalidis, A.K.: Algorithms for three-dimensional dominance searching in linear space. Information Processing Letters\u00a066(6), 277\u2013283 (1998)","journal-title":"Information Processing Letters"},{"key":"49_CR13","unstructured":"Qingmin Shi and Joseph JaJa. Fast algorithms for 3-d dominance reporting and counting. Technical Report CS-TR-4437, Institute of Advanced Computer Studies (UMIACS), University of Maryland (2003)"},{"key":"49_CR14","unstructured":"Qingmin Shi and Joseph JaJa. Fast fractional cascading and its applications. Technical Report CS-TR-4502, Institute of Advanced Computer Studies (UMIACS), University of Maryland (2003)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30551-4_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:29:37Z","timestamp":1620012577000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}