Dynamizing static algorithms, with applications to dynamic trees and history independence

Authors:
Umut A. Acar;Guy E. Blelloch;Robert Harper;Jorge L. Vittes;Shan Leung Maverick Woo
Affiliations:
Carnegie Mellon University, Pittsburgh, PA;Carnegie Mellon University, Pittsburgh, PA;Carnegie Mellon University, Pittsburgh, PA;Carnegie Mellon University, Pittsburgh, PA;Carnegie Mellon University, Pittsburgh, PA
Venue:
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2004

Citing 20
Cited 31

Self-adjusting binary search trees

Journal of the ACM (JACM)
Two algorithms for maintaining order in a list

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A data structure for dynamic trees

Journal of Computer and System Sciences
Making data structures persistent

Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Incremental computation via function caching

POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Parallel tree contraction part 2: further applications

SIAM Journal on Computing
Randomized multidimensional search trees: lazy balancing and dynamic shuffling (extended abstract)

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Dynamic maintenance of geometric structures made easy

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Dynamic expression trees and their applications

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
A data structure for dynamically maintaining rooted trees

Journal of Algorithms
Oblivious data structures: applications to cryptography

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm

Mathematical Programming: Series A and B
Data structures for mobile data

Journal of Algorithms
Randomized fully dynamic graph algorithms with polylogarithmic time per operation

Journal of the ACM (JACM)
Anti-presistence: history independent data structures

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Adaptive functional programming

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Design of Dynamic Data Structures

Design of Dynamic Data Structures
Incremental evaluation for attribute grammars with application to syntax-directed editors

POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Fully Persistent Arrays (Extended Array)

WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Characterizing History Independent Data Structures

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation

Self-adjusting top trees

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Maintaining information in fully dynamic trees with top trees

ACM Transactions on Algorithms (TALG)
Design of data structures for mergeable trees

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
An O (n log n) algorithm for maximum st-flow in a directed planar graph

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A subset spanner for Planar graphs,: with application to subset TSP

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
An experimental analysis of self-adjusting computation

Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Adaptive functional programming

ACM Transactions on Programming Languages and Systems (TOPLAS)
Kinetic 3D convex hulls via self-adjusting computation

SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
A proposal for parallel self-adjusting computation

Proceedings of the 2007 workshop on Declarative aspects of multicore programming
Kinetic algorithms via self-adjusting computation

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
A novel SoC design methodology combining adaptive software and reconfigurable hardware

Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Imperative self-adjusting computation

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Uniquely Represented Data Structures for Computational Geometry

SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Robust Kinetic Convex Hulls in 3D

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
A cost semantics for self-adjusting computation

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Self-adjusting computation: (an overview)

Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation
An O(n log n) algorithm for maximum st-flow in a directed planar graph

Journal of the ACM (JACM)
B-Treaps: A Uniquely Represented Alternative to B-Trees

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Dynamic trees in practice

Journal of Experimental Algorithmics (JEA)
An experimental analysis of self-adjusting computation

ACM Transactions on Programming Languages and Systems (TOPLAS)
A Library for Self-Adjusting Computation

Electronic Notes in Theoretical Computer Science (ENTCS)
A consistent semantics of self-adjusting computation

ESOP'07 Proceedings of the 16th European conference on Programming
Dynamic trees in practice

WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Self-adjusting computation with Delta ML

AFP'08 Proceedings of the 6th international conference on Advanced functional programming
Maximum flows and parametric shortest paths in planar graphs

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Data structures for mergeable trees

ACM Transactions on Algorithms (TALG)
Linear-space approximate distance oracles for planar, bounded-genus and minor-free graphs

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Balanced trees inhabiting functional parallel programming

Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Shortest path based planar graph cuts for bi-layer segmentation of binocular stereo video

ACCV'10 Proceedings of the 2010 international conference on Computer vision - Volume part II
Adaptive Exact Inference in Graphical Models

The Journal of Machine Learning Research
A deterministic o(m log m) time algorithm for the reeb graph

Proceedings of the twenty-eighth annual symposium on Computational geometry

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a machine model for automatically dynamizing static algorithms and apply it to history-independent 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 the 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 Algorithm of Miller and Reif to obtain a history-independent data structure for the dynamic trees problem of Sleator and Tarjan.