{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T23:23:50Z","timestamp":1705015430439},"reference-count":18,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1997,8,1]],"date-time":"1997-08-01T00:00:00Z","timestamp":870393600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5829,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1997,8]]},"DOI":"10.1016\/s0925-7721(97)00005-9","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T15:57:07Z","timestamp":1051113427000},"page":"115-122","source":"Crossref","is-referenced-by-count":5,"title":["On the difficulty of range searching"],"prefix":"10.1016","volume":"8","author":[{"given":"Arne","family":"Andersson","sequence":"first","affiliation":[]},{"given":"Kurt","family":"Swanson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(97)00005-9_BIB1","series-title":"Proc. 36th IEEE Symposium on Foundations of Computer Science","first-page":"655","article-title":"Sublogarithmic searching without multiplications","author":"Andersson","year":"1995"},{"key":"10.1016\/S0925-7721(97)00005-9_BIB2","series-title":"Proc. 37th IEEE Symposium on Foundations of Computer Science","article-title":"Faster deterministic sorting and searching in linear space","author":"Andersson","year":"1996"},{"issue":"5","key":"10.1016\/S0925-7721(97)00005-9_BIB3","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0020-0190(79)90117-0","article-title":"Decomposable searching problems","volume":"8","author":"Bentley","year":"1979","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/S0925-7721(97)00005-9_BIB4","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF00263991","article-title":"Efficient worst-case data structures for range searching","volume":"13","author":"Bentley","year":"1980","journal-title":"Acta Inform"},{"issue":"3","key":"10.1016\/S0925-7721(97)00005-9_BIB5","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1137\/0215051","article-title":"Filtering search: a new approach to query-answering","volume":"15","author":"Chazelle","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0925-7721(97)00005-9_BIB6","series-title":"Proc. 26th IEEE Symposium on Foundations of Computer Science","first-page":"165","article-title":"Slimming down search structures: A functional approach to algorithm design","author":"Chazelle","year":"1985"},{"issue":"3","key":"10.1016\/S0925-7721(97)00005-9_BIB7","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1137\/0217026","article-title":"A functional approach to data structures and its use in multidimensional searching","volume":"17","author":"Chazelle","year":"1988","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/S0925-7721(97)00005-9_BIB8","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1145\/77600.77614","article-title":"Lower bounds for orthogonal range searching: I. The reporting case","volume":"37","author":"Chazelle","year":"1990","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/S0925-7721(97)00005-9_BIB9","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1145\/79147.79149","article-title":"Lower bounds for orthogonal range searching: II. The arithmetic model","volume":"37","author":"Chazelle","year":"1990","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/S0925-7721(97)00005-9_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00288933","article-title":"Quad trees: a data structure for retrieval on composite keys","volume":"4","author":"Finkel","year":"1974","journal-title":"Acta Inform"},{"issue":"3","key":"10.1016\/S0925-7721(97)00005-9_BIB11","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1016\/0022-0000(93)90040-4","article-title":"Surpassing the information theoretic barrier with fusion trees","volume":"47","author":"Fredman","year":"1993","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0925-7721(97)00005-9_BIB12","series-title":"Proc. 19th IEEE Symposium on Foundations of Computer Science","first-page":"28","article-title":"A data structure for orthogonal range queries","author":"Lueker","year":"1978"},{"issue":"2","key":"10.1016\/S0925-7721(97)00005-9_BIB13","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1137\/0214021","article-title":"Priority search trees","volume":"14","author":"McCreight","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0925-7721(97)00005-9_BIB14","unstructured":"P.B. Miltersen, Personal communication."},{"key":"10.1016\/S0925-7721(97)00005-9_BIB15","series-title":"Proc. 26th ACM Symposium on Theory of Computing","first-page":"625","article-title":"Lower bounds for union-split-find related problems on random access machines","author":"Miltersen","year":"1994"},{"key":"10.1016\/S0925-7721(97)00005-9_BIB16","series-title":"Proc. 27th ACM Symposium on Theory of Computing","article-title":"On data structures and asymmetric communication complexity","author":"Miltersen","year":"1995"},{"key":"10.1016\/S0925-7721(97)00005-9_BIB17","series-title":"Proc. 20th IEEE Symposium on Foundations of Computer Science","first-page":"148","article-title":"Transforming static data structures to dynamic structures","author":"Saxe","year":"1979"},{"key":"10.1016\/S0925-7721(97)00005-9_BIB18","series-title":"Proc. 20th Allerton Conf. Commun. Control Comput.","first-page":"462","article-title":"A new time complexity for orthogonal range queries","author":"Willard","year":"1982"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772197000059?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772197000059?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T17:25:06Z","timestamp":1556385906000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772197000059"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,8]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,8]]}},"alternative-id":["S0925772197000059"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(97)00005-9","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1997,8]]}}}