Data structures and network algorithms
Data structures and network algorithms
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
Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Dynamic Perfect Hashing: Upper and Lower Bounds
SIAM Journal on Computing
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
The role of lazy evaluation in amortized data structures
Proceedings of the first ACM SIGPLAN international conference on Functional programming
Purely functional, real-time deques with catenation
Journal of the ACM (JACM)
Simple Confluently Persistent Catenable Lists
SIAM Journal on Computing
Fully Persistent Arrays (Extended Array)
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Two Simplified Algorithms for Maintaining Order in a List
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
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
Purely functional worst case constant time catenable sorted lists
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
A survey of persistent data structures
ICCOMP'05 Proceedings of the 9th WSEAS International Conference on Computers
Confluently Persistent Tries for Efficient Version Control
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Super-efficient aggregating history-independent persistent authenticated dictionaries
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Confluent persistence revisited
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Rank-Sensitive data structures
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
| Hi-index | 0.00 |
We address a longstanding open problem of [J.R. Driscoll, N. Sarnak, D. Sleator, R. Tarjan, J. Comput. System Sci. 38 (1989) 86-124, J. Driscoll, D. Sleator, R. Tarjan, J. ACM, 41 (5) (1994) 943-959], and present a general transformation that transforms any pointer based data structure to be confluently persistent. Such transformations for fully persistent data structures are given in [J.R. Driscoll, N. Sarnak, D. Sleator, R. Tarjan, J. Comput. System Sci. 38 (1989) 86-124], greatly improving the performance compared to the naive scheme of simply copying the inputs. Unlike fully persistent data structures, where both the naive scheme and the fully persistent scheme of [J.R. Driscoll, N. Sarnak, D. Sleator, R. Tarjan, J. Comput. System Sci. 38 (1989) 86-124] are feasible, we show that the naive scheme for confluently persistent data structures is itself infeasible (requires exponential space and time). Thus, prior to this paper there was no feasible method for making any data structure confluently persistent at all. Our methods give an exponential reduction in space and time compared to the naive method, placing confluently persistent data structures in the realm of possibility.