Date of Original Version
Copyright © 2004 by the Association for Computing Machinery, Inc. and the Society for industrial and Applied Mathematics.
Abstract or Description
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.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 531-540.