Making data structures persistent

Making data structures persistent (1989)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by James R. Driscoll , Neil Sarnak

Venue:	Journal of Computer and System Sciences
Citations:	231 - 6 self

BibTeX

@ARTICLE{Driscoll89makingdata,
    author = {James R. Driscoll and Neil Sarnak},
    title = {Making data structures persistent},
    journal = {Journal of Computer and System Sciences},
    year = {1989},
    volume = {38},
    pages = {86--124}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

557	Data structures and network algorithms - Tarjan - 1983
212	A dichromatic framework for balanced trees - Guibas, Sedgewick - 1978
160	Planar point location using persistent search trees - Sarnak, Tarjan - 1986
143	Two algorithms for maintaining order in a list - Dietz, Sleator - 1987
142	Fractional cascading: I. A data structuring technique - Chazelle, Guibas - 1986
129	Amortized computational complexity - Tarjan - 1985
97	Decomposable searching problems I: Static-to-dynamic transformation - Bentley, Saxe - 1980
97	Filtering search: a new approach to query-answering - Chazelle - 1986
94	A new data structure for representing sorted lists - Huddleston, Mehlhorn - 1982
80	Maintaining order in a linked list - Dietz - 1982
79	Incremental Context-Dependent Analysis for Language-Based Editors - Reps, Teitelbaum, et al. - 1983
70	Binary Search Trees of Bounded Balance - Nievergelt, Reingold - 1972
64	Data Structures and Network Algorithms (Society for industrial and applied mathematics - Tarjan - 1983
49	Design and analysis of a data structure for representing sorted lists - Brown, Tarjan - 1980
48	Searching and storing similar lists - Cole - 1986
34	Organization of Large Ordered Indexes - Bayer, McCreight - 1972
31	Efficient applicative data types - Myers - 1984
29	Maintaining order in a generalized linked list - Tsakalidis - 1984
25	How to search in history - Chazelle - 1985
23	Real-time queue operations - Hood, Melville - 1981
22	Localized search in sorted lists - Kosaraju - 1981
20	On the average number of rebalancing operations in weightbalanced trees - BLUM, MEHLHORN - 1980
19	Efficient use of the past - Dobkin, Munro - 1980
15	Updating a Balanced Search Tree - Tarjan - 1983
13	An applicative random-access stack - Myers - 1983
13	Persistent data structures - Sarnak - 1986
11	Searching in the past, i - Overmars - 1981
11	Searching in the past, II: General Transforms - H, Overmars - 1981
10	Updating a Balanced Search Tree in O(1) Rotations - Tarjan - 1983
10	Making B-trees work for B - KRIJNEN, MEERTENS - 1983
10	AVL dags - Myers - 1982
8	An efficient scheme for fast local updates in linear lists - HUDDLESTON - 1981
8	Efficient algorithms for computing geometric intersections - Swart - 1985
7	S.C.: Hysterical B-trees - Maier, Salveter - 1979
5	How to Search - Chazelle - 1985
5	Tsakiladis. AVL-trees for localized search - K - 1985
4	Robust balancing in B-trees - HUDDLESTON, MEHLHORN - 1981
4	Tarjan, "Planar point location using persistent search trees - Sarnak, E - 1986
4	Persistent Data Structures,” Ph - SARNAK - 1986
4	An Optimal Implementation for Localized Search,” A84/06, Fachbereich Angewandte Mathematik und Informatik, Universitat des Saarlandes - Tsakalidis - 1984
3	Searching in the Past 11: General Transforms - OVERMARS - 1981
2	Tarjan, "Design and analysis of a data structure for representing sorted lists - Brown, E - 1980
1	Real-time queue ol~rations in pure LISP - Hood, Melville - 1981
1	Meertens, "Making Btrees work for B - Krijnen, T - 1983
1	AVL dags - Meyers - 1982
1	An improved method for maintaining order in a list,"to appear - Sleator
1	An Efficient Scheme for Fast Local Updates in Linear Lists - HUDDLESMN - 1981
1	Localized search in sorted lists - Kosmu - 1981