Searching for "Dynamic Expression Trees." – sorted by Relevance.
-
Dynamic Expression Trees
- Dynamic Expression Trees Robert F. Cohen and Roberto Tamassia Department of Computer Science Brown
- Cited by 9 (3 self) – Add To MetaCart
-
Topology B-Trees and Their Applications
- -memory topology tree data structure of Frederickson. It allows for dynamic expression evaluation and updates
- Cited by 13 (0 self) – Add To MetaCart
-
Dynamizing Static Algorithms, with Applications to Dynamic Trees and History Independence
- extended their technique to maintain dynamic expression trees [5]. Frederickson developed Topology Trees
- Cited by 30 (19 self) – Add To MetaCart
-
Combine and Conquer
- technique extends and generalizes the dynamic trees of [28] and the dynamic expression trees of [9]. Our
- Cited by 2 (0 self) – Add To MetaCart
-
Data Structures
- , adjacency lists, link-cut tree, dynamic expression tree, topology tree, block-cutpoint tree, SPQR-tree
- Cited by 1 (0 self) – Add To MetaCart
-
Computing the quartet distance between evolutionary trees in time O(n log n
- related to the data structure for dynamic expression trees [8], the "extended smaller-half trick" [5
- Cited by 8 (3 self) – Add To MetaCart
-
[1] Accredited Standards Committee X3, Information Processing Systems, The
- ] Robert F. Cohen and Roberto Tamassia. Dynamic expression trees. Technical Report CS-90-35, Department
- Add To MetaCart
-
Dynamic Graph Algorithms
- compressions and expansions of edges efficiently, and the dynamic expression trees [5]. Rather than the dynamic
- Cited by 32 (0 self) – Add To MetaCart
-
LDT: a Logarithmic Distributed Search
- ] in the context of link-cut trees and dynamic expression trees: Given a binary tree T = (V;E), a topology tree
- Add To MetaCart
-
Design and Analysis of Data Structures for Dynamic Trees
- , 24, 33, 35]. Applications for maintaining dynamic expression trees have also been reported [16, 25
- Cited by 1 (1 self) – Add To MetaCart

