{"_id":{"_str":"534279600e946d920a0012fc"},"__v":2,"authorIDs":[],"author_short":["Sproull, R."],"bibbaseid":"sproull-refinementstonearestneighborsearchinginkdimensionaltrees-1991","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["R.F."],"propositions":[],"lastnames":["Sproull"],"suffixes":[]}],"journal":"Algorithmica","pages":"579–589","title":"Refinements to Nearest-neighbor Searching in k-dimensional Trees","volume":"6","year":"1991","bibtex":"@article{sproull:1991,\n\tAuthor = {R.F. Sproull},\n\tJournal = {Algorithmica},\n\tPages = {579--589},\n\tTitle = {Refinements to Nearest-neighbor Searching in k-dimensional Trees},\n\tVolume = {6},\n\tYear = {1991}}\n\n","author_short":["Sproull, R."],"key":"sproull:1991","id":"sproull:1991","bibbaseid":"sproull-refinementstonearestneighborsearchinginkdimensionaltrees-1991","role":"author","urls":{},"downloads":0,"html":""},"bibtype":"article","biburl":"http://www.cs.toronto.edu/cogs/bib/standard-long.bib","downloads":0,"keywords":[],"search_terms":["refinements","nearest","neighbor","searching","dimensional","trees","sproull"],"title":"Refinements to Nearest-neighbor Searching in k-dimensional Trees","year":1991,"dataSources":["2cjnbEWxd35GBeqEe"]}