{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:18:29Z","timestamp":1758266309381},"reference-count":5,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1987,6,1]],"date-time":"1987-06-01T00:00:00Z","timestamp":549504000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1987,6]]},"DOI":"10.1016\/0020-0190(87)90174-8","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"269-273","source":"Crossref","is-referenced-by-count":18,"title":["A log log n data structure for three-sided range queries"],"prefix":"10.1016","volume":"25","author":[{"given":"O.","family":"Fries","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Mehlhorn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"N\u00e4her","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Tsakalidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(87)90174-8_BIB1","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","article-title":"Fast algorithms for finding nearest common ancestors","volume":"13","author":"Harel","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(87)90174-8_BIB2","author":"Mehlhorn","year":"1984"},{"key":"10.1016\/0020-0190(87)90174-8_BIB3","article-title":"Priority search trees","author":"McCreight","year":"1981","journal-title":"Tech. Rept. Xerox PARC CSL-81-5"},{"key":"10.1016\/0020-0190(87)90174-8_BIB4","series-title":"Proc. WG'85, Internat. Workshop on Graph-Theoretic Concepts in Computer Science","article-title":"Range searching on a grid","author":"Overmars","year":"1985"},{"key":"10.1016\/0020-0190(87)90174-8_BIB5","series-title":"Computational Geometry, An Introduction","author":"Preparata","year":"1985"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087901748?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087901748?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T09:54:11Z","timestamp":1553594051000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019087901748"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,6]]},"references-count":5,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1987,6]]}},"alternative-id":["0020019087901748"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(87)90174-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1987,6]]}}}