Parallel work-efficient construction of metric skip-lists achieving O(n log n) expected work and polylog span for nearest-neighbor search and derived applications under constant expansion rate.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Parallel Metric Skiplists and Nearest Neighbor Search
Parallel work-efficient construction of metric skip-lists achieving O(n log n) expected work and polylog span for nearest-neighbor search and derived applications under constant expansion rate.