2084 search results - page 271 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
COMPGEOM
2003
ACM
15 years 3 months ago
2003
ACM
Given a Morse function over a 2-manifold with or without boundary, the Reeb graph is obtained by contracting the connected components of the level sets to points. We prove tight u...
106
click to vote
CONSTRAINTS
2008
14 years 10 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
ESA
2007
Springer
15 years 4 months ago
2007
Springer
Given a family of k disjoint connected polygonal sites of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distance to a site is the dis...
CIAC
2006
Springer
15 years 1 months ago
2006
Springer
We investigate the computational hardness of the Connectivity, the Strong Connectivity and the Broadcast type of Range Assignment Problems in R2 and R3. We present new reductions ...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We introduce a new technique to bound the asymptotic performance of splay trees. The basic idea is to transcribe, in an indirect fashion, the rotations performed by the splay tree...