Self-adjusting binary search trees
Journal of the ACM (JACM)
Information and Control
Planar point location using persistent search trees
Communications of the ACM
Searching and sorting similar lists
Journal of Algorithms
Two algorithms for maintaining order in a list
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Abstract continuations: a mathematical semantics for handling full jumps
LFP '88 Proceedings of the 1988 ACM conference on LISP and functional programming
Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Stores and partial continuations as first-class objects in a language and its environment
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The theory and practice of first-class prompts
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Control delimiters and their hierarchies
Lisp and Symbolic Computation
Fully persistent lists with catenation
Journal of the ACM (JACM)
Confluently persistent deques via data-structural bootstrapping
SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
Persistent lists with catenation via recursive slow-down
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The role of lazy evaluation in amortized data structures
Proceedings of the first ACM SIGPLAN international conference on Functional programming
Purely functional representations of catenable sorted lists
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Purely functional, real-time deques with catenation
Journal of the ACM (JACM)
Simple Confluently Persistent Catenable Lists (Extended Abstract)
SWAT '98 Proceedings of the 6th Scandinavian Workshop on Algorithm Theory
Fully Persistent Arrays (Extended Array)
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Amortization, lazy evaluation, and persistence: lists with catenation via lazy linking
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Persistent data structures
Purely functional data structures
Purely functional data structures
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
ACM Transactions on Algorithms (TALG)
Authenticated and persistent skip graph: a data structure for cloud based data-centric applications
Proceedings of the International Conference on Advances in Computing, Communications and Informatics
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
We address a longstanding open problem of [8, 7], and present a general transformation that takes any data structure and transforms it to a confluently persistent data structure. We model this general problem using the concepts of a version DAG (Directed Acyclic Graph) and an instantiation of a version DAG. We introduce the concept of the effective depth of a vertex in the version DAG and use it to derive information theoretic lower bounds on the space expansion of any such transformation for this DAG. We then give a confluently persistent data structure, such that for any version DAG, the time slowdown and space expansion match the information theoretic lower bounds to within a factor of &Ogr;(log2(¦V¦)).