An Improved Algorithm Finding Nearest Neighbor Using Kd-trees

Rina Panigrahy. An Improved Algorithm Finding Nearest Neighbor Using Kd-trees. In Eduardo Sany Laber, Claudson F. Bornstein, Loana Tito Nogueira, Luerbio Faria, editors, LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings. Volume 4957 of Lecture Notes in Computer Science, pages 387-398, Springer, 2008. [doi]

@inproceedings{Panigrahy08,
  title = {An Improved Algorithm Finding Nearest Neighbor Using Kd-trees},
  author = {Rina Panigrahy},
  year = {2008},
  doi = {10.1007/978-3-540-78773-0_34},
  url = {http://dx.doi.org/10.1007/978-3-540-78773-0_34},
  researchr = {https://researchr.org/publication/Panigrahy08},
  cites = {0},
  citedby = {0},
  pages = {387-398},
  booktitle = {LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings},
  editor = {Eduardo Sany Laber and Claudson F. Bornstein and Loana Tito Nogueira and Luerbio Faria},
  volume = {4957},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-78772-3},
}