59 search results - page 2 / 12 » Finger Search Trees with Constant Insertion Time |
ADAEUROPE
2003
Springer
14 years 21 days ago
2003
Springer
ontainer. In particular, an iterator abstracts away differences in specific container types, allowing you to view the collection simply as a sequence of items. A generic algorith...
ESA
2006
Springer
13 years 9 months ago
2006
Springer
We present a purely functional implementation of search trees that requires O(log n) time for search and update operations and supports the join of two trees in worst case constant...
WABI
2009
Springer
14 years 2 months ago
2009
Springer
It becomes more and more important to search for similar structures from molecular 3-D structure databases in the structural biology of the post genomic era. Two molecules are said...
JPDC
2002
13 years 7 months ago
2002
In this paper we consider the dictionary problem in a message-passing distributed environment. We introduce a new version, based on AVL-trees, of distributed search trees, the fir...
WADS
1989
Springer
13 years 11 months ago
1989
Springer
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...