{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:24:22Z","timestamp":1757629462977,"version":"3.44.0"},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,5,1]],"date-time":"1992-05-01T00:00:00Z","timestamp":704678400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1992,5,1]],"date-time":"1992-05-01T00:00:00Z","timestamp":704678400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1992,5]]},"DOI":"10.1016\/0743-7315(92)90059-v","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"70-74","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"title":["Range search in parallel using distributed data structures"],"prefix":"10.1016","volume":"15","author":[{"given":"Radhakrishnan","family":"Sridhar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sitharama S.","family":"Iyengar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subbiah","family":"Rajanarayanan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-7315(92)90059-V_BIB1","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."},{"key":"10.1016\/0743-7315(92)90059-V_BIB2","series-title":"International Conf. on Parallel Processing","article-title":"Dilation-2 embeddings of grids into hypercubes","author":"Chan","year":"1988"},{"key":"10.1016\/0743-7315(92)90059-V_BIB3","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0020-0190(88)90188-3","article-title":"Normalized divide-and-conquer: A scaling technique for solving multi-dimensional problems","volume":"26","author":"Karlsson","year":"1987","journal-title":"In Form. Process. Lett."},{"article-title":"A survey of parallel algorithms for shared-memory machines","year":"1988","author":"Karp","key":"10.1016\/0743-7315(92)90059-V_BIB4"},{"key":"10.1016\/0743-7315(92)90059-V_BIB5","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/0743-7315(88)90034-2","article-title":"Geometric retrieval in parallel","volume":"5","author":"Katz","year":"1988","journal-title":"J. Parallel Distrib. Comput."},{"year":"1985","series-title":"Computational Geometry: An Introduction","author":"Preparata","key":"10.1016\/0743-7315(92)90059-V_BIB6"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159290059V?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159290059V?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:30:11Z","timestamp":1757514611000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074373159290059V"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,5]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["074373159290059V"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(92)90059-v","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1992,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Range search in parallel using distributed data structures","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(92)90059-V","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1992 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}