Amortization, Lazy Evaluation, and Persistence: Lists with Catenation via Lazy Linking

Amortization, Lazy Evaluation, and Persistence: Lists with Catenation via Lazy Linking (1995)

Cached

Download Links

[www.cs.columbia.edu]

Other Repositories/Bibliography

DBLP

by Chris Okasaki

Venue:	Pages 646--654 of: IEEE Symposium on Foundations of Computer Science
Citations:	6 - 1 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Amortization, Lazy Evaluation, and Persistence: Lists with Catenation via Lazy Linking	user correction - Legacy Corrections
AUTHOR NAME	Chris Okasaki	SVM HeaderParse 0.1
AUTHOR AFFIL	School of Computer Science; Carnegie Mellon University	SVM HeaderParse 0.2
AUTHOR ADDR	Pittsburgh, PA 15213	SVM HeaderParse 0.1
ABSTRACT	Amortization has been underutilized in the design of persistent data structures, largely because traditional accounting schemes break down in a persistent setting. Such schemes depend on saving "credits" for future use, but a persistent data structure may have multiple "futures", each competing for the same credits. We describe how lazy evaluation can often remedy this problem, yielding persistent data structures with good amortized efficiency. In fact, such data structures can be implemented purely functionally in any functional language supporting lazy evaluation. As an example of this technique, we present a purely functional (and therefore persistent) implementation of lists that simultaneously support catenation and all other usual list primitives in constant amortized time. This data structure is much simpler than the only existing data structure with comparable bounds, the recently discovered catenable lists of Kaplan and Tarjan, which support all operations in constant worst-ca...	user correction - Legacy Corrections
YEAR	1995	INFERENCE
VENUE	Pages 646--654 of: IEEE Symposium on Foundations of Computer Science	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	646--654	INFERENCE
CITATIONS	23 found	ParsCit 1.0