Robert F. Cohen Roberto Tamassia Department of Computer Science Brown...  Home/Search
Context Related
| brown.edu/cgc/papers/ctdet95.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: brown.edu/cgc/cgcpa...cgcpapers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a technique for dynamically maintaining a collection of arithmetic expressions represented by binary trees (whose leaves are variables and whose internal nodes are operators). A query operation asks for the value of an expression (associated with the root of a tree). Update operations include changing the value of a variable and combining or decomposing expressions by linking or cutting the corresponding trees. Our dynamic data structure uses linear space and supports queries... (Update)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
R. F. Cohen and R. Tamassia. Dynamic expression trees. Algorithmica, 13:245--265, 1995. http://citeseer.ist.psu.edu/cohen95dynamic.html More
@article{ cohen95dynamic,
author = "Robert F. Cohen and Roberto Tamassia",
title = "Dynamic Expression Trees",
journal = "Algorithmica",
volume = "13",
number = "3",
pages = "245-265",
year = "1995",
url = "citeseer.ist.psu.edu/cohen95dynamic.html" }
Citations (may not include all citations):258 Data Structures and Network Algorithms (context) - Tarjan - 1983
183 A Data Structure for Dynamic Trees (context) - Sleator, Tarjan - 1983
174 The Parallel Evaluation of General Arithmetic Expressions (context) - Brent - 1974
102 A Survey of Parallel Algorithms for Shared Memory Machines (context) - Karp, Ramachandran - 1990
74 The Recognition of Series Parallel Digraphs (context) - Valdes, Tarjan et al. - 1982
68 Incremental Computation via Function Caching (context) - Pugh, Teitelbaum - 1989
50 Maintenance of a Minimum Spanning Forest in a Dynamic Plane .. - Eppstein, Italiano et al. - 1992
50 Incremental Algorithms for Minimal Length Paths (context) - Ausiello, Italiano et al. - 1990
49 Incremental Evaluation of Computational Circuits (context) - Alpern, Hoover et al. - 1990
38 Sequencing Jobs to Minimize Total Weighted Completion Time S.. (context) - Lawler - 1978
35 Shortest-Path Algorithms: Taxonomy and Annotations (context) - Deo, Pang - 1984
34 Optimal Orientation of Cells in Slicing Floorplan Design (context) - Stockmeyer - 1983
33 Biased Search Trees (context) - Bent, Sleator et al. - 1985
33 Updating Distances in Dynamic Graphs (context) - Even, Gazit - 1985
31 On Finding and Updating Spanning Trees and Shortest Paths (context) - Spira, Pan - 1975
[Article contains additional citations not shown here]
Documents on the same site (http://www.cs.brown.edu/cgc/cgc-papers/cgc-papers.html): More
An Experimental Comparison of Four Graph Drawing Algorithms - Di Battista, Garg, Liotta, .. (1997) (Correct)
An Experimental Comparison of Three Graph Drawing.. - Di Battista, Tamassia, .. (1995) (Correct)
Planar Upward Tree Drawings With Optimal Area - Garg, Goodrich, Tamassia (2003) (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