SWAT
2000
Springer
13 years 8 months ago
2000
Springer
SWAT
2000
Springer
13 years 8 months ago
2000
Springer
SWAT
2000
Springer
13 years 8 months ago
2000
Springer
We consider dictionaries over the universe U = {0, 1}w on a unit-cost RAM with word size w and a standard instruction set. We present a linear space deterministic dictionary with m...
SWAT
2000
Springer
13 years 8 months ago
2000
Springer
SWAT
2000
Springer
13 years 8 months ago
2000
Springer
SWAT
2000
Springer
13 years 8 months ago
2000
Springer
SWAT
2000
Springer
13 years 8 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
SWAT
2000
Springer
13 years 8 months ago
2000
Springer
SWAT
2000
Springer
13 years 8 months ago
2000
Springer
We define external memory (or I/O) models which capture space complexity and develop a general technique for deriving I/O-space trade-offs in these models from internal memory mode...
SWAT
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. We show how to maintain centers and medians for a collection of dynamic trees where edges may be inserted and deleted and node and edge weights may be changed. All update...