Umut A. Acar, Guy E. Blelloch, Robert Harper, Jorge L. Vittes, Shan Leung Maverick Woo  Home/Search
Context Related
| cmu.edu/~rwh/papers/traces...soda03.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: cmu.edu/~rwh/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We describe a machine model for automatically dynamizing static algorithms and apply it to historyindependent data structures. Static programs expressed in this model are dynamized automatically by keeping track of dependences between code and data in the form of a dynamic dependence graph. To study performance of such automatically dynamized algorithms we present an analysis technique based on trace-stability. As an example of the use of the model, we dynamize the Parallel Tree Contraction... (Update)
Similar documents based on text: More All
1.4: Dynamizing Static Algorithms, with Applications to.. - Acar, Blelloch.. (2004) (Correct)
0.5: Selective Memoization - Acar, Blelloch, Harper (2003) (Correct)
0.5: The Data Locality of Work Stealing - Acar, Blelloch, Blumofe (2000) (Correct)
Related documents from co-citation: More All
12: Incremental computation via function caching (context) - Pugh, Teitelbaum - 1989
6: A categorized bibliography on incremental computation (context) - Ramalingam, Reps - 1993
6: ACM Transactions on Programming Languages and Systems (context) - Liu, Stoller et al. - 1998
BibTeX entry: (Update)
Umut A. Acar, Guy E. Blelloch, Robert Harper, Jorge L. Vittes, and Maverick Woo. Dynamizing static algorithms with applications to dynamic trees and history independence. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 2004. http://citeseer.ist.psu.edu/article/acar03dynamizing.html More
@misc{ acar04dynamizing,
author = "U. Acar and G. Blelloch and R. Harper and J. Vittes and M. Woo",
title = "Dynamizing static algorithms with applications to dynamic trees and history
independence",
text = "Umut A. Acar, Guy E. Blelloch, Robert Harper, Jorge L. Vittes, and Maverick
Woo. Dynamizing static algorithms with applications to dynamic trees and
history independence. In ACM-SIAM Symposium on Discrete Algorithms (SODA),
2004.",
year = "2004",
url = "citeseer.ist.psu.edu/article/acar03dynamizing.html" }
Citations (may not include all citations):192 Self-adjusting binary search trees (context) - Sleator, Tarjan - 1985
183 A data structure for dynamic trees (context) - Sleator, Tarjan - 1983
129 Making data structures persistent (context) - Driscoll, Sarnak et al. - 1989
122 Parallel tree contraction and its application (context) - Miller, Reif - 1985
121 Data structures for mobile data - Basch, Guibas et al. - 1999
118 Data structures for on-line updating of minimum spanning tre.. (context) - Frederickson - 1985
99 Two algorithms for maintaining order in a list (context) - Dietz, Sleator - 1987
92 The Design of Dynamic Data Structures (context) - Overmars - 1983
68 Incremental computation via function caching (context) - Pugh, Teitelbaum - 1989
60 Decomposable searching problems I: Static-to-dynamic transfo.. (context) - Bentley, Saxe - 1980
33 Fully persistent arrays (context) - Dietz - 1989
26 A data structure for dynamically maintaining rooted trees (context) - Frederickson - 1997
26 Dynamic maintenance of geometric structures made easy (context) - Schwarzkopf - 1991
26 Incremental evaluation of attribute grammars with applicatio.. (context) - Demers, Reps et al. - 1981
23 Adaptive functional programming - Acar, Blelloch et al. - 2002
22 Dynamic expression trees and their applications (context) - Cohen, Tamassia - 1991
19 Parallel tree contraction (context) - Miller, Reif - 1991
18 Randomized multidimensional search trees: Lazy balancing and.. (context) - Mulmuley - 1991
16 New classes and applications of hash functions (context) - Wegman, Carter - 1979
11 Oblivious data structures: applications to cryptography - Micciancio - 1997
7 Dynamization of order decomposable set problems (context) - Overmars - 1981
7 Randomized fully dynamic graph algorithms with polylogarithm.. - Henzinger, King - 1999
6 Separating structure from data in dynamic trees (context) - Acar, Blelloch et al. - 2003
6 Characterizing history independent data structures - Hartline, Hong et al. - 2002
5 Monads for incremental computing (context) - Carlsson - 2002
4 Anti-presistence: history independent data structures (context) - Naor, Teague - 2001
3 Top-trees and dynamic graph algorithms - Holm, de Lichtenberg - 1998
3 Dynamic trees as search trees via euler tours (context) - Tarjan - 1997
Documents on the same site (http://www-2.cs.cmu.edu/~rwh/papers.htm): More
A Type System for Higher-Order Modules - Dreyer, Crary, Harper (2001) (Correct)
An Effective Theory of Type Refinements - Mandelbaum, Walker, Harper (2003) (Correct)
Adaptive Functional Programming - Acar, Blelloch, Harper (2001) (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