Maintaining order in a generalized linked list
Acta Informatica
Planar point location using persistent search trees
Communications of the ACM
AVL-trees for localized search
Information and Control
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
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Persistence, amortization and randomization
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Real-time deques, multihead Turing machines, and purely functional programming
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
Journal of Management Information Systems
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
Space-optimal hidden line elimination for rectangles
Information Processing Letters
The space-optimal version of a known rectangle enclosure reporting algorithm
Information Processing Letters
Purely functional data structures
Purely functional data structures
Comparison of access methods for time-evolving data
ACM Computing Surveys (CSUR)
Purely functional, real-time deques with catenation
Journal of the ACM (JACM)
A persistent runtime system using persistent data structures
SAC '96 Proceedings of the 1996 ACM symposium on Applied Computing
Incremental Context-Dependent Analysis for Language-Based Editors
ACM Transactions on Programming Languages and Systems (TOPLAS)
Simple Confluently Persistent Catenable Lists
SIAM Journal on Computing
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
An Efficient Multiversion Access Structure
IEEE Transactions on Knowledge and Data Engineering
Designing Access Methods for Bitemporal Databases
IEEE Transactions on Knowledge and Data Engineering
Partially persistent data structures of bounded degree with constant update time
Nordic Journal of Computing
A Unifying Framework for Version Control in a CAD Environment
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Fully Persistent Arrays (Extended Array)
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
An asymptotically optimal multiversion B-tree
The VLDB Journal — The International Journal on Very Large Data Bases
A programming and problem-solving seminar
A programming and problem-solving seminar
Making data structures confluently persistent
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
I/O-efficient point location using persistent B-trees
Journal of Experimental Algorithmics (JEA)
Hi-index | 0.00 |
Several years after the introduction of the notion of persistence by Driscoll et al. [15] we review, in this paper, the most important data structuring paradigms and applications both in main and secondary memory.