SODA
2004
ACM
13 years 5 months ago
2004
ACM
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
SODA
2004
ACM
13 years 5 months ago
2004
ACM
srn.com/abstract=423560
SODA
2004
ACM
13 years 5 months ago
2004
ACM
SODA
2004
ACM
13 years 5 months ago
2004
ACM
We give a forbidden substructure characterization of set families that have the consecutive-ones property, and a linear time algorithm to find the forbidden substructure if a set ...
SODA
2004
ACM
13 years 5 months ago
2004
ACM
SODA
2004
ACM
13 years 5 months ago
2004
ACM
We study the mixing time of the Glauber dynamics for general spin systems on bounded-degree trees, including the Ising model, the hard-core model (independent sets) and the antife...
SODA
2004
ACM
13 years 5 months ago
2004
ACM
Motivated by the need for maintaining multiple, large queues of data in modern high-performance systems, we study the problem of caching queues in memory under the following simpl...
SODA
2004
ACM
13 years 5 months ago
2004
ACM
SODA
2004
ACM
13 years 5 months ago
2004
ACM
In this paper we present a Delaunay refinement algorithm for generating good aspect ratio and optimal size triangulations. This is the first algorithm known to have sub-quadratic ...
SODA
2004
ACM
13 years 5 months ago
2004
ACM
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...