We study several polygonal curve problems under the Fréchet distance via...
We propose κ-approximate nearest neighbor (ANN) data structures for
n po...
We present experimental and theoretical results on a method that applies...
We present new approximation results on curve simplification and cluster...
We consider an online allocation problem that involves a set P of n
play...
We propose a self-improving algorithm for computing Voronoi diagrams und...
Ailon et al. [SICOMP'11] proposed self-improving algorithms for sorting ...
We propose a dynamic data structure for the distribution-sensitive point...
Ailon et al. (SICOMP 2011) proposed a self-improving sorter that tunes i...
Asadpour, Feige, and Saberi proved that the integrality gap of the
confi...
Let M⊂R^d be a compact, smooth and boundaryless
manifold with dimension ...
We study self-improving sorting with hidden partitions. Our result is an...
We present self-adjusting data structures for answering point location
q...
Given n data points in R^d, an appropriate edge-weighted graph connectin...
The max-min fair allocation problem seeks an allocation of resources to
...
The restricted max-min fair allocation problem seeks an allocation of
re...
Surface reconstruction from an unorganized point cloud is an important
p...