Tomasz Radzik  Home/Search
Context Related
| dcs.kcl.ac.uk/staff/rad...dt_techrep.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: dcs.kcl.ac.uk/staff/radzik/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We describe an implementation of dynamic trees with \in-subtree" operations. Our implementation follows Sleator and Tarjan's framework of dynamic-tree implementations based on splay trees. We consider the following two examples of \in-subtree" operations. (a) For a given node v, nd a node with the minimum key in the subtree rooted at v. (b) For a given node v, nd a random node with key X in the subtree rooted at v (value X is xed throughout the whole computation). The rst operation may... (Update)
Context of citations to this paper: More
...Of course, one may try to increase the applicability of the axiomatic interface by augmenting it with further operations. For example, [25] shows how to nd a minimum weight node in a subtree. However, dealing with non local properties is not so immediate, and we nd it...
Cited by: More
Maintaining Center and Median in Dynamic Trees - Alstrup, Holm, Thorup (2000) (Correct)
Active bibliography (related documents): More All
0.4: Implementations of Dynamic Tree Collections Based on Splay Trees - Radzik (Correct)
0.2: An Experimental Study of Dynamic Algorithms for.. - Frigioni, Miller.. (2000) (Correct)
0.2: Revised version of "Efficient Cross-Trees for External Memory" - Grossi, Italiano (2000) (Correct)
Similar documents based on text: More All
0.6: Randomized Splay Trees: Theoretical and Experimental Results - Albers, Karpinski (2002) (Correct)
0.6: Splay Trees - In This Lecture (Correct)
0.3: Image Modelling with Position-Encoding Dynamic Trees - Storkey, Williams (2003) (Correct)
BibTeX entry: (Update)
T. Radzik. Implementations of dynamic trees with in-subtree operations. ACM J. Experimental Algorithmics, 3:Article 9, 1998. http://citeseer.ist.psu.edu/radzik98implementation.html More
@article{ radzik98implementation,
author = "Tomasz Radzik",
title = "Implementation of Dynamic Trees with In-Subtree Operations",
journal = "ACM Journal of Experimental Algorithms",
volume = "3",
pages = "9",
year = "1998",
url = "citeseer.ist.psu.edu/radzik98implementation.html" }
Citations (may not include all citations):1527 Optimization by simulated annealing - Kirkpatrick, Gelatt et al. - 1983
258 Data Structures and Network Algorithms (context) - Tarjan - 1983
192 Self-adjusting binary search trees (context) - Sleator, Tarjan - 1985
183 A Data Structure for Dynamic Trees (context) - Sleator, Tarjan - 1983
72 A platform for combinatorial and geometric computing (context) - Mehlhorn, aher - 1995
59 A thermodynamical approach to the traveling salesman problem.. (context) - Cerny - 1985
33 Biased Search Trees (context) - Bent, Sleator et al. - 1985
31 Finding Minimum-Cost Circulations by Successive Approximatio.. (context) - Goldberg, Tarjan - 1990
29 Finding minimum-cost circulations by canceling negative cycl.. (context) - Goldberg, Tarjan - 1989
25 Improved Time Bounds for the Maximum Flow Problem (context) - Ahuja, Orlin et al. - 1989
23 Network Flow Algorithms (context) - Goldberg, Tardos et al. - 1990
19 Data structures for traveling salesmen - Fredman, Johnson et al. - 1995
13 Maintaining minimum spanning trees in dynamic graphs - Henzinger, King - 1997
13 Experimental analysis of dynamic minimum spanning tree algor.. - Amato, Cattaneo et al. - 1997
5 a technique for speeding up dynamic graph algorithms (context) - Eppstein, Galil et al. - 1992
1 Data structures for on-line updateing of minimum spanning tr.. (context) - Frederickson - 1985
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