Add to ORKGWe present a new finger search tree with O(log log d) expected search time in the Random Access Machine (RAM) model of computation for a large class of input distributions. The parameter d represents the number of elements (distance) be-tween the search element and an element pointed to by a finger, in a finger search tree that stores n elements. Our data structure improves upon a previous result by Anders
. We analyze the expected time complexity of range searching with k-d trees in all dimensions when t...
A random suffix search tree is a binary search tree constructed for the suffixes X i = 0:B i B i+1 B...
We introduce 2-3 finger trees, a functional representation of persistent sequences supporting access...
We consider the problem of implementing finger search trees on the pointer machine, {\it i.e.}, how ...
For the random binary search tree with n nodes inserted the number of ancestors of the elements with...
We consider the problem of implementing finger search trees on the pointer machine, i.e., how to mai...
We show how to support the finger search operation on degree-balanced search trees in a space-effici...
It is shown that the online binary search tree data structure GreedyASS performs asymptotically as w...
Levcopolous and Overmars [L088] described a search tree in which the time to insert or delete a key ...
AbstractWe develop a new finger search tree with worst-case constant update time in the pointer mach...
We show how to support he finger search operation on degree-balanced search trees in a space-efficie...
We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maint...
We study multi-finger binary search trees (BSTs), a far-reaching extension of the classical BST mode...
A finger is a point in a file near which updates and searches can be conducted particularly efficien...
Grammar-based compression, where one replaces a long string by a small context-free grammar that gen...
. We analyze the expected time complexity of range searching with k-d trees in all dimensions when t...
A random suffix search tree is a binary search tree constructed for the suffixes X i = 0:B i B i+1 B...
We introduce 2-3 finger trees, a functional representation of persistent sequences supporting access...
We consider the problem of implementing finger search trees on the pointer machine, {\it i.e.}, how ...
For the random binary search tree with n nodes inserted the number of ancestors of the elements with...
We consider the problem of implementing finger search trees on the pointer machine, i.e., how to mai...
We show how to support the finger search operation on degree-balanced search trees in a space-effici...
It is shown that the online binary search tree data structure GreedyASS performs asymptotically as w...
Levcopolous and Overmars [L088] described a search tree in which the time to insert or delete a key ...
AbstractWe develop a new finger search tree with worst-case constant update time in the pointer mach...
We show how to support he finger search operation on degree-balanced search trees in a space-efficie...
We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maint...
We study multi-finger binary search trees (BSTs), a far-reaching extension of the classical BST mode...
A finger is a point in a file near which updates and searches can be conducted particularly efficien...
Grammar-based compression, where one replaces a long string by a small context-free grammar that gen...
. We analyze the expected time complexity of range searching with k-d trees in all dimensions when t...
A random suffix search tree is a binary search tree constructed for the suffixes X i = 0:B i B i+1 B...
We introduce 2-3 finger trees, a functional representation of persistent sequences supporting access...