Optimal parallel all-nearest-neighbors using the well-separated pair decomposition
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Euclidean Steiner Spanners: Light and Sparse;SIAM Journal on Discrete Mathematics;2022-09
2. ParChain;Proceedings of the VLDB Endowment;2021-10
3. Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering;Proceedings of the 2021 International Conference on Management of Data;2021-06-09
4. Crowdsourcing emergency data in non-operational cellular networks;Information Systems;2017-03
5. $$\delta $$ -Greedy t-spanner;Lecture Notes in Computer Science;2017