1. Bentley, J.L.: Multidimensional divide-and-conquer. Commun. ACM 23(4), 214–229 (1980)
2. Cai, Z., Miao, D., Li, Y.: Deletion propagation for multiple key preserving conjunctive queries: approximations and complexity. In: 35th IEEE International Conference on Data Engineering, ICDE 2019, Macao, China, 8–11 April 2019, pp. 506–517. IEEE (2019).
http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=8725877
3. Callahan, P.B.: Optimal parallel all-nearest-neighbors using the well-separated pair decomposition. In: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science, SFCS 1993, pp. 332–340. IEEE Computer Society, Washington (1993)
4. Clarkson, K.L.: Fast algorithms for the all nearest neighbors problem. In: 24th Annual Symposium on Foundations of Computer Science (SFCS 1983), vol. 16, pp. 226–232. IEEE, November 1983
5. Connor, M., Kumar, P.: Fast construction of k-nearest neighbor graphs for point clouds. IEEE Trans. Vis. Comput. Graph. 16(4), 599–608 (2010)