5 citations · 5 across the 2 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2021
Parallel Nearest Neighbors in Low Dimensions with Batch Updates
Magdalen Dobson, Guy Blelloch
We present a set of parallel algorithms for computing exact k-nearest neighbors in low dimensions. Many k-nearest neighbor algorithms use either a kd-tree or the Morton ordering of…
cs.DS2021
The Geometry of Tree-Based Sorting
Guy Blelloch, Magdalen Dobson
We study the connections between sorting and the binary search tree (BST) model, with an aim towards showing that the fields are connected more deeply than is currently appreciated…