Purely Functional Representations of Catenable Sorted Lists. (1996)
Cached
Download Links
- [www.math.tau.ac.il]
- [ftp.cs.princeton.edu]
- [dimacs.rutgers.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the 28th Annual ACM Symposium on Theory of Computing |
| Citations: | 16 - 5 self |
BibTeX
@INPROCEEDINGS{Kaplan96purelyfunctional,
author = {Haim Kaplan and Robert E. Tarjan},
title = {Purely Functional Representations of Catenable Sorted Lists.},
booktitle = {In Proceedings of the 28th Annual ACM Symposium on Theory of Computing},
year = {1996},
pages = {202--211},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The power of purely functional programming in the construction of data structures has received much attention, not only because functional languages have many desirable properties, but because structures built purely functionally are automatically fully persistent: any and all versions of a structure can coexist indefinitely. Recent results illustrate the surprising power of pure functionality. One such result was the development of a representation of double-ended queues with catenation that supports all operations, including catenation, in worst-case constant time [19].
