BibTeX record journals/pami/ZakarauskasO96

download as .bib file

@article{DBLP:journals/pami/ZakarauskasO96,
  author       = {Pierre Zakarauskas and
                  John M. Ozard},
  title        = {Complexity Analysis for Partitioning Nearest Neighbor Searching Algorithms},
  journal      = {{IEEE} Trans. Pattern Anal. Mach. Intell.},
  volume       = {18},
  number       = {6},
  pages        = {663--668},
  year         = {1996},
  url          = {https://doi.org/10.1109/34.506419},
  doi          = {10.1109/34.506419},
  timestamp    = {Wed, 17 May 2017 10:56:23 +0200},
  biburl       = {https://dblp.org/rec/journals/pami/ZakarauskasO96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.