SWAT
2010
Springer
13 years 9 months ago
2010
Springer
We present the zipper tree, the first O(log log n)-competitive online binary search tree that performs each access in O(log n) worst-case time. This shows that for binary search ...
SWAT
2010
Springer
13 years 9 months ago
2010
Springer
SWAT
2010
Springer
13 years 9 months ago
2010
Springer
A t-interval is a union of at most t half-open intervals on the real line. An interval is
SWAT
2010
Springer
13 years 9 months ago
2010
Springer
This paper presents an O(n2 ) algorithm for deciding isomorphism of graphs that have bounded feedback vertex set number. This number is defined as the minimum number of vertex de...
SWAT
2010
Springer
13 years 9 months ago
2010
Springer
SWAT
2010
Springer
13 years 9 months ago
2010
Springer
We attend to the classic setting where an observer needs to inform a tracker about an arbitrary time varying function f : N0 → Z. This is an optimization problem, where both wron...
SWAT
2010
Springer
13 years 9 months ago
2010
Springer
SWAT
2010
Springer
13 years 9 months ago
2010
Springer
SWAT
2010
Springer
13 years 9 months ago
2010
Springer
SWAT
2010
Springer
13 years 9 months ago
2010
Springer