H. Kaplan and R. E. Tarjan. Purely functional, real-time deques with catenation. Journal of the ACM, 46(5):577-603, 1999. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Persistent data structures Haim Kaplan - Tel Aviv University Self-citation (Kaplan) (Correct)
No context found.
H. Kaplan and R. E. Tarjan. Purely functional, real-time deques with catenation. Journal of the ACM, 46(5):577-603, 1999.
Simple Confluently Persistent Catenable Lists - Kaplan, Okasaki, Tarjan (1998) (1 citation) Self-citation (Kaplan Tarjan) (Correct)
....and indeed con uently persistent. A simple but important problem in data structure design that makes the issue of con uent persistence concrete is that of implementing persistent double ended queues (deques) with catenation. A series of papers [2, 4] culminated in the work of Kaplan and Tarjan [11, 10], who developed a con uently persistent implementation of deques with catenation that has a worst case constant time and space bound for any deque operation, including catenation. The Kaplan Tarjan data structure and its precursors obtain con uent persistence by being purely functional. ....
....we extend our approach to handle stacks with catenation. In Section 5, we develop our solution for deques with catenation. We conclude in Section 6 with some remarks and open problems. An extended abstract of this work appeared in [9] 2. Preliminaries. The objects of our study are lists. As in [11, 10] we allow the following operations on lists: makelist(x) return a new list containing the single element x. push(x; L) return a new list formed by adding element x to the front of list L. pop(L) return a pair whose rst component is the rst element on list L and whose second component is ....
[Article contains additional citation context not shown here]
H. Kaplan and R. E. Tarjan, Purely functional, real-time deques with catenation, J. Assoc. Comput. Mach. to appear.
Making Data Structures Confluently Persistent - Fiat, Kaplan (2001) (1 citation) Self-citation (Kaplan) (Correct)
....operations. Driscoll, Sleator, and Tarjan [9] coined the term con uently persistent for fully persistent structures that support such meld operations. Much work has been done on making speci c data structures such as catenable deques and catenable nger search trees con uently persistent (see [1, 9, 17, 16, 19, 21, 20, 15]) Despite these results no progress has been made on the problem of obtaining a general transformation that can make any pointer based data structure con uently persistent. School of computer science, Tel Aviv University, Tel Aviv 69978, ffiat,haimkg math.tau.ac.il x=1, y=2 x=6 x=3 x=6 ....
H. Kaplan and R. E. Tarjan. Purely functional, real-time deques with catenation. J. Assoc. Comput. Mach. to appear.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC