ESA
2006
Springer
15 years 6 months ago
2006
Springer
ESA
2006
Springer
15 years 6 months ago
2006
Springer
We study the bandwidth allocation problem (bap) in bounded degree trees. In this problem we are given a tree and a set of connection requests. Each request consists of a path in t...
ESA
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Define a static algorithm as an algorithm that computes some combinatorial property of its input consisting of static, i.e., non-moving, objects. In this paper, we descri...
110
click to vote
ESA
2006
Springer
15 years 6 months ago
2006
Springer
We design compact and responsive kinetic data structures for detecting collisions between n convex fat objects in 3-dimensional space that can have arbitrary sizes. Our main result...
116
click to vote
ESA
2006
Springer
15 years 6 months ago
2006
Springer
We study the problem of designing kinetic data structures (KDS's for short) when event times cannot be computed exactly and events may be processed in a wrong order. In tradi...