Buscar
Mostrando ítems 1-1 de 1
Ponencia
Space-efficient geometric divide-and-conquer algorithms
(2004)
We present an approach to simulate divide-and-conquer algorithms in a space-efficient way, and illustrate it by giving space-efficient algorithms for the closest-pair, bichromatic closest-pair, all-nearest-neighbors, and ...