G. S. Brodal. Finger search trees with constant insertion time. In Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 540--549, 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....x) and we will simply say O(log d) when the elements a i and a j are not made explicit. A finger is a reference to an element in the list and historically it is often realized by a simple pointer to an element. Indeed some papers mandate this representation in their definitions, e.g. see [5]. Typically, we maintain the invariant that the finger is on the most recently found element and we refer to this element as the current element. The finger search operation uses the finger as an extra hint to search for its new target and also shifts the finger to the element found. Section 2 ....

....[8] There are other designs that are not entirely based on balanced search trees as well. For example, Kosaraju [14] designed a more general structure with the finger search property using on a collection of 2 3 trees. Skip Lists by Pugh [18] also support finger searching. More recently, Brodal [5] has investigated finger search trees designed to improve insertion and deletion time. Of special note are the purely functional catenable sorted lists of Kaplan and Tarjan [12] Their design not only has the finger search property, but it also requires very little space overhead. We will contrast ....

G. S. Brodal. Finger search trees with constant insertion time. In Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 540--549, 1998.

....x ) and we will simply say O(logd) when the elements ai and aj are not made explicit. A finger is a reference to an element in the list and historically it is often realized by a simple pointer to an element. Indeed some papers mandate this representation in their definitions, e.g. see [5]. Typically, we maintain the invariant that the finger is on the most recently found element and we refer to this element as the current element. The finger search operation uses the finger as an extra hint to search for its new target and also shifts the finger to the element found. Section 2 ....

....[8] There are other designs that are not entirely based on balanced search trees as well. For example, Kosaraju [14] designed a more general structure with the finger search property using on a collection of 2 3 trees. Skip Lists by Pugh [18] also support finger searching. More recently, Brodal [5] has investigated finger search trees designed to improve insertion and deletion time. Of special note are the purely functional catenable sorted lists of Kaplan and Tarjan [12] Their design not only has the finger search property, but it also requires very little space overhead. We will contrast ....

G. S. Brodal. Finger search trees with constant inser- tion time. In Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 540-549, 1998.

....( 1] have surpassed the logarithmic bound on the search procedure. These two papers are based on a global rebalancing scheme combined with the bucketing techniques presented in [13] For the pointer machine model of computation, steps have been made towards this direction by researchers (see [3, 4, 8, 9, 10, 12, 17]) but the problem remained tantalizingly open. The best solution is given by Brodal ( 3] who proposed a nger search tree with constant insertion, but with O(log n) deletion time. This time bound of the delete operation is a direct result of our diculty to handle eciently deletions in a ....

....rebalancing scheme combined with the bucketing techniques presented in [13] For the pointer machine model of computation, steps have been made towards this direction by researchers (see [3, 4, 8, 9, 10, 12, 17] but the problem remained tantalizingly open. The best solution is given by Brodal ([3]) who proposed a nger search tree with constant insertion, but with O(log n) deletion time. This time bound of the delete operation is a direct result of our diculty to handle eciently deletions in a local rebalancing setting. In this paper we will present the rst constant update nger ....

[Article contains additional citation context not shown here]

G.S. Brodal. Finger Search Trees with Constant Insertion Time. In Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms(SODA), pages 540-549, 1998.

No context found.

Brodal, G.S. Finger search trees with constant insertion time. In Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 540-549, 1998.

No context found.

G.S. Brodal. Finger Search Trees with Constant Insertion Time. In Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms(SODA), pages 540-549, 1998.

No context found.

Brodal, G. S. Finger search trees with constant insertion time. In Proc.9th Annual ACM--SIAM Symposium on Discrete Algorithms, pp. 540--549, 1998.

....( 1] have surpassed the logarithmic bound on the search procedure. These two papers are based on a global rebalancing scheme combined with the bucketing techniques presented in [13] For the pointer machine model of computation, steps have been made towards this direction by researchers (see [3, 4, 8, 9, 10, 12, 17]) but the problem remained tantalizingly open. The best solution is given by Brodal ( 3] who proposed a finger search tree with constant insertion, but with O(log # n) deletion time. This time bound of the delete operation is a direct result of our di#culty to handle e#ciently deletions in a ....

....rebalancing scheme combined with the bucketing techniques presented in [13] For the pointer machine model of computation, steps have been made towards this direction by researchers (see [3, 4, 8, 9, 10, 12, 17] but the problem remained tantalizingly open. The best solution is given by Brodal ([3]) who proposed a finger search tree with constant insertion, but with O(log # n) deletion time. This time bound of the delete operation is a direct result of our di#culty to handle e#ciently deletions in a local rebalancing setting. In this paper we will present the first constant update finger ....

[Article contains additional citation context not shown here]

G.S. Brodal. Finger Search Trees with Constant Insertion Time. In Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms(SODA), pages 540-549, 1998.

No context found.

G. S. Brodal. Finger search trees with constant insertion time. In Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 540--549, 1998.

No context found.

G. S. Brodal. Finger search trees with constant insertion time. In ACM-SIAM Symposium on Discrete Algorithms, 1998.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC