Preview
Unable to display preview. Download preview PDF.
References
Adel'son-Vel'skii, G.M. and Landis, E.M., “An Algorithm for the Organization of Information,” Doklady Akademia Nauk USSR 146, 2 (1962), 263–266.
Ajtai, M., Fredman, M.L. and Komlos, J., “Hash Functions for Priority Queues,” Proc. 24th Annual IEEE Symposium on Foundations of Computer Science (1983), 299–303.
Johnson, D.B., “A Priority Queue in which Initialization and Queue Operations Take O(log log D) Time,” Math. Systems Theory 15, 4 (Dec. 1982), 295–310.
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.
van Emde Boas, P., Kaas, R. and Ziljstra, E., “Design and Analysis of an Efficient Priority Queue,” Math. Systems Theory 10 (1977), 99–127.
van Emde Boas, P., “Preserving Order in a Forest in Less Than Logarithmic Time and Linear Space,” Information Processing Lett. 6, 3 (June 1977), 80–82.
Willard, D.E., “Two Very Fast Trie Data Structures,” 19th Allerton Conference (1981), 355–363.
Willard, D.E., “Log-logarithmic Worst-case Range Queries Are Possible in Space Θ(n),” Information Processing Lett. 17 (Aug. 1983), 81–84.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Karlsson, R.G., Ian Munro, J., Robertson, E.L. (1985). The nearest neighbor problem on bounded domains. In: Brauer, W. (eds) Automata, Languages and Programming. ICALP 1985. Lecture Notes in Computer Science, vol 194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015757
Download citation
DOI: https://doi.org/10.1007/BFb0015757
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15650-5
Online ISBN: 978-3-540-39557-7
eBook Packages: Springer Book Archive