272 citations · 273 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2008
Range Medians
Sariel Har-Peled, S. Muthukrishnan
We study a generalization of the classical median finding problem to batched query case: given an array of unsorted items and (not necessarily disjoint) intervals in the ar…
cs.DS2004★ 272 cited
Fast Construction of Nets in Low Dimensional Metrics, and Their Applications
Sariel Har-Peled, Manor Mendel
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain i…