Sparse Randomized Partition Trees for Nearest Neighbor Search. - Kaushik Sinha; Omid Keivani (AISTATS, 2017)

Improved maximum inner product search with better theoretical guarantees. - Omid Keivani; Kaushik Sinha; Parikshit Ram (IJCNN, 2017)

Improved nearest neighbor search using auxiliary information and priority functions. - Omid Keivani; Kaushik Sinha (ICML, 2018)

Improved maximum inner product search with better theoretical guarantee using randomized partition trees. - Omid Keivani; Kaushik Sinha; Parikshit Ram (Mach. Learn., 2018)

Random projection-based auxiliary information can improve tree-based nearest neighbor search. - Omid Keivani; Kaushik Sinha (Inf. Sci., 2021)