Elkin, Y., & Kurlin, V. (2021). A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree.
Chicago Style (17th ed.) CitationElkin, Yury, and Vitaliy Kurlin. A New Near-linear Time Algorithm for K-nearest Neighbor Search Using a Compressed Cover Tree. 2021.
MLA (9th ed.) CitationElkin, Yury, and Vitaliy Kurlin. A New Near-linear Time Algorithm for K-nearest Neighbor Search Using a Compressed Cover Tree. 2021.
Warning: These citations may not always be 100% accurate.