25 search results - page 1 / 5 » Optimal finger search trees in the pointer machine |
STOC
2002
ACM
14 years 5 months ago
2002
ACM
SODA
1998
ACM
13 years 6 months ago
1998
ACM
We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maintain a sorted list such that searching for an element x, starting the search at ...
ESA
2003
Springer
13 years 10 months ago
2003
Springer
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
WABI
2004
Springer
13 years 10 months ago
2004
Springer
—The problem of reconstructing the duplication history of a set of tandemly repeated sequences was first introduced by Fitch [4]. Many recent studies deal with this problem, show...
PPSC
2001
13 years 6 months ago
2001
As the gap between processor and memory performance widens, careful analyses and optimizations of cache memory behavior become increasingly important. While analysis of regular lo...