59 search results - page 5 / 12 » Finger Search Trees with Constant Insertion Time |
SCCC
2003
IEEE
14 years 22 days ago
2003
IEEE
The Dynamic Spatial Approximation Tree (dsa–tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alte...
WADS
2009
Springer
14 years 2 months ago
2009
Springer
Since the invention of AVL trees in 1962, a wide variety of ways to balance binary search trees have been proposed. Notable are red-black trees, in which bottom-up rebalancing afte...
ALGORITHMICA
2011
13 years 2 months ago
2011
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
SODA
2004
ACM
13 years 8 months ago
2004
ACM
We define a deterministic metric of "well-behaved data" that enables searching along the lines of interpolation search. Specifically, define to be the ratio of distance...
AAAI
1996
13 years 8 months ago
1996
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...