Fully persistent lists with catenation

Authors:
James R. Driscoll;Daniel D. K. Sleator;Robert E. Tarjan
Affiliations:
Dartmouth College, Hanover, NH;Carnegie Mellon Univ., Pittsburgh, PA;Princeton Univ., Princeton, NJ/ and NEC Research Institute, Princeton, NJ
Venue:
Journal of the ACM (JACM)
Year:
1994

Citing 12
Cited 14

Data structures and network algorithms

Data structures and network algorithms
How to search history

Information and Control
Searching and sorting similar lists

Journal of Algorithms
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
Confluently persistent deques via data structuaral bootstrapping

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Incremental Context-Dependent Analysis for Language-Based Editors

ACM Transactions on Programming Languages and Systems (TOPLAS)
Fully Persistent Arrays (Extended Array)

WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Efficient applicative data types

POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Localized search in sorted lists

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
A new representation for linear lists

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Persistent data structures

Persistent data structures

Purely functional representations of catenable sorted lists

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Catenable double-ended queues

ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
Purely functional, real-time deques with catenation

Journal of the ACM (JACM)
Making data structures confluently persistent

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Adaptive functional programming

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Making data structures confluently persistent

Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
An optimal-time algorithm for shortest paths on a convex polytope in three dimensions

Proceedings of the twenty-second annual symposium on Computational geometry
Dynamic state restoration using versioning exceptions

Higher-Order and Symbolic Computation
Adaptive functional programming

ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Topics in data structures

Algorithms and theory of computation handbook
Confluent persistence revisited

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the problem of representing stacks with catenation so that any stack, old or new, is available for access or update operations. This problem arises in the implementation of list-based and functional programming languages. A solution is proposed requiring constant time and space for each stack operation except catenation, which requires O(log log k) time and space. Here k is the number of stack operations done before the catenation. All the resource bounds are amortized over the sequence of operations.