Confluently Persistent Deques via Data-Structural Bootstrapping (1993)
| Venue: | J. of Algorithms |
| Citations: | 15 - 4 self |
BibTeX
@ARTICLE{Buchsbaum93confluentlypersistent,
author = {Adam L. Buchsbaum and Robert E. Tarjan},
title = {Confluently Persistent Deques via Data-Structural Bootstrapping},
journal = {J. of Algorithms},
year = {1993},
volume = {18},
pages = {18--513}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We introduce data-structural bootstrapping, a technique to design data structures recursively, and use it to design confluently persistent deques. Our data structure requires O(log 3 k) worstcase time and space per deletion, where k is the total number of deque operations, and constant worst-case time and space for other operations. Further, the data structure allows a purely functional implementation, with no side effects. This improves a previous result of Driscoll, Sleator, and Tarjan. 1 An extended abstract of this paper was presented at the 4th ACM-SIAM Symposium on Discrete Algorithms, 1993. 2 Supported by a Fannie and John Hertz Foundation fellowship, National Science Foundation Grant No. CCR-8920505, and the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) under NSF-STC88-09648. 3 Also affiliated with NEC Research Institute, 4 Independence Way, Princeton, NJ 08540. Research at Princeton University partially supported by the National Science Foundatio...
