Tomasz Radzik May 23, 1997  Home/Search
Context
Related
| hypatia.dcs.qmw.ac.uk/d...tr9705.ps.gz 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: hypatia.dcs.qmw.a...dcs.kcl.ac.uk (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We describe implementations of two closely related variants of dynamic rooted trees. These variants are similar to Sleator and Tarjan's dynamic trees, but instead of the operation of finding the minimum key on the path from a given node to the root, we have the operation of finding the minimum key in the subtree of a given node (the first variant) and the operation of finding a fixed key value in the subtree of a given node (the second variant). The first variant may provide support for edge... (Update)
Similar documents (at the sentence level):
24.3%: Implementations of Dynamic Tree Collections Based on Splay Trees - Radzik (Correct)
Active bibliography (related documents): More All
0.1: Implementation of Dynamic Trees with In-Subtree Operations - Radzik (1998) (Correct)
0.0: Experimental Analysis of Dynamic Algorithms for.. - Frigioni.. (1997) (Correct)
0.0: Dynamic Capacitated Minimum Spanning Trees - Jothi, Raghavachari (2004) (Correct)
Similar documents based on text: More All
0.3: On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof - Cole (Correct)
0.3: On the Dynamic Finger Conjecture for Splay Trees. Part .. - Cole, Mishra.. (Correct)
0.2: Dynamic Trees: Learning to Model Outdoor Scenes - Adams, Williams (Correct)
BibTeX entry: (Update)
@misc{ radzik-implementations,
author = "Tomasz Radzik",
title = "Implementations of Dynamic Tree Collections Based on Splay Trees",
url = "citeseer.ist.psu.edu/168135.html" }
Citations (may not include all citations):25 Improved Time Bounds for the Maximum Flow Problem (context) - Ahuja, Orlin et al. - 1989
13 Experimental analysis of dynamic minimum spanning tree algor.. - Amato, Cattaneo et al.
Documents on the same site (http://hypatia.dcs.qmw.ac.uk/site/dcs.kcl.ac.uk): More
Efficient Algorithms for Counting and Reporting Pairwise.. - Gupta, Janardan, Smid (1996) (Correct)
Two-dimensional Prefix String Matching and Covering on .. - Crochemore.. (1995) (Correct)
Towards Optimal Learning from Very Small Data Sets - Plumbley (1994) (Correct)
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