Gerth Stlting Brodal. Finger search trees with constant insertion time. In Proc. 9th ACM-SIAM Symp. on Discrete Algorithms (1998), 540-549.  Home/Search   Document Details and Download   Summary   Related Articles

.... for one dimensional keys given in [23] Finally, we can perform nger searching in O(k log d) time, where d is the di erence between the ranks of two keys searched consecutively [6, 16] Insertions take O(1) time and deletions O(log n) time by a recent result for one dimensional keys in [5]. To the best of our knowledge, this was not previously known. One of the applications of this result is the e cient implementation of set operations (union, intersection, etc. on two sets of m and n keys of dimension k in optimal (mk m log(n=m) time, where m n. We remark that all of these ....

....same cluster if they lead to the same node with 1 = 2 and 1 = 2 . In the full paper, we will show that each node requires only O(1) lcp values mantained in constant time under split, fuse and share operations [16] We can apply our technique to a recent result on nger search trees [5] to get the following theorem. Theorem 4. There exists a k dimensional nger search trees for a set of n keys that supports arbitrary nger searches in O(k log d) time, and neighbor insertions in O(1) time and deletions in O(log n) time in the worst case. If an insertion of a key is not ....

Gerth Stlting Brodal. Finger search trees with constant insertion time. In Proc. 9th ACM-SIAM Symp. on Discrete Algorithms (1998), 540-549.

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