{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:21:08Z","timestamp":1725456068913},"publisher-location":"Berlin\/Heidelberg","reference-count":8,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354015650X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0015757","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T05:45:47Z","timestamp":1132724747000},"page":"318-327","source":"Crossref","is-referenced-by-count":2,"title":["The nearest neighbor problem on bounded domains"],"prefix":"10.1007","author":[{"given":"Rolf G.","family":"Karlsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Ian Munro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edward L.","family":"Robertson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"32_CR1","first-page":"263","volume":"146","author":"G.M. Adel'son-Vel'skii","year":"1962","unstructured":"Adel'son-Vel'skii, G.M. and Landis, E.M., \u201cAn Algorithm for the Organization of Information,\u201d Doklady Akademia Nauk USSR 146, 2 (1962), 263\u2013266.","journal-title":"Doklady Akademia Nauk USSR"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Fredman, M.L. and Komlos, J., \u201cHash Functions for Priority Queues,\u201d Proc. 24th Annual IEEE Symposium on Foundations of Computer Science (1983), 299\u2013303.","DOI":"10.1109\/SFCS.1983.24"},{"issue":"4","key":"32_CR3","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01786986","volume":"15","author":"D.B. Johnson","year":"1982","unstructured":"Johnson, D.B., \u201cA Priority Queue in which Initialization and Queue Operations Take O(log log D) Time,\u201d Math. Systems Theory 15, 4 (Dec. 1982), 295\u2013310.","journal-title":"Math. Systems Theory"},{"key":"32_CR4","unstructured":"Karlsson, R.G., Algorithms in a Restricted Universe, Ph.D Thesis, University of Waterloo (Nov. 1984), and Computer Science Dept Research Report CS-84-50."},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF01683268","volume":"10","author":"P. Emde Boas van","year":"1977","unstructured":"van Emde Boas, P., Kaas, R. and Ziljstra, E., \u201cDesign and Analysis of an Efficient Priority Queue,\u201d Math. Systems Theory 10 (1977), 99\u2013127.","journal-title":"Math. Systems Theory"},{"issue":"3","key":"32_CR6","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., \u201cPreserving Order in a Forest in Less Than Logarithmic Time and Linear Space,\u201d Information Processing Lett. 6, 3 (June 1977), 80\u201382.","journal-title":"Information Processing Lett."},{"key":"32_CR7","unstructured":"Willard, D.E., \u201cTwo Very Fast Trie Data Structures,\u201d 19th Allerton Conference (1981), 355\u2013363."},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0020-0190(83)90075-3","volume":"17","author":"D.E. Willard","year":"1983","unstructured":"Willard, D.E., \u201cLog-logarithmic Worst-case Range Queries Are Possible in Space \u0398(n),\u201d Information Processing Lett. 17 (Aug. 1983), 81\u201384.","journal-title":"Information Processing Lett."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0015757.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,7]],"date-time":"2020-12-07T15:09:54Z","timestamp":1607353794000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0015757"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354015650X"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/bfb0015757","relation":{},"subject":[]}}