Skip to main content
SpringerLink
Log in

The nearest neighbor problem on bounded domains

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1985)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 194))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.

    Google Scholar 

  2. 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.

    Google Scholar 

  3. 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.

    Article  Google Scholar 

  4. 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.

    Google Scholar 

  5. van Emde Boas, P., Kaas, R. and Ziljstra, E., “Design and Analysis of an Efficient Priority Queue,” Math. Systems Theory 10 (1977), 99–127.

    Article  Google Scholar 

  6. 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.

    Article  Google Scholar 

  7. Willard, D.E., “Two Very Fast Trie Data Structures,” 19th Allerton Conference (1981), 355–363.

    Google Scholar 

  8. Willard, D.E., “Log-logarithmic Worst-case Range Queries Are Possible in Space Θ(n),” Information Processing Lett. 17 (Aug. 1983), 81–84.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Data Structuring Group Department of Computer Science, University of Waterloo, N2L 3G1, Waterloo, Ont., Canada

    Rolf G. Karlsson & J. Ian Munro

  2. Department of Computer Science, Indiana University, 47405, Bloomington, Indiana, USA

    Edward L. Robertson

Authors
  1. Rolf G. Karlsson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Ian Munro
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Edward L. Robertson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wilfried Brauer

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation