Given n elements, an integer k and a parameter ε, we study to
select an ...
We develop the first fast spectral algorithm to decompose a random
third...
We develop machinery to design efficiently computable and consistent
est...
Every finite graph admits a simple (topological) drawing, that is, a
dra...
We study k nearest neighbor queries in the plane for general (convex,
pa...
We consider the approximate minimum selection problem in presence of
ind...
We consider the problem of sorting n elements in the case of
persistent ...
The geodesic Voronoi diagram of m point sites inside a simple polygon of...