Purely Functional Random-Access Lists

Purely Functional Random-Access Lists (1995)

Cached

Download Links

[www.cs.columbia.edu]

Other Repositories/Bibliography

DBLP

by Chris Okasaki

Venue:	In Functional Programming Languages and Computer Architecture
Citations:	15 - 2 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Purely Functional Random-Access Lists	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	5000 Forbes Avenue, Pittsburgh, Pennsylvania, USA 15213	SVM HeaderParse 0.1
ABSTRACT	We present a new data structure, called a random-access list, that supports array lookup and update operations in O(log n) time, while simultaneously providing O(1) time list operations (cons, head, tail). A closer analysis of the array operations improves the bound to O(minfi; log ng) in the worst case and O(log i) in the expected case, where i is the index of the desired element. Empirical evidence suggests that this data structure should be quite efficient in practice. 1 Introduction Lists are the primary data structure in every functional programmer 's toolbox. They are simple, convenient, and usually quite efficient. The main drawback of lists is that accessing the ith element requires O(i) time. In such situations, functional programmers often find themselves longing for the efficient random access of arrays. Unfortunately, arrays can be quite awkward to implement in a functional setting, where previous versions of the array must be available even after an update. Since arra...	user correction - Legacy Corrections
YEAR	1995	INFERENCE
VENUE	In Functional Programming Languages and Computer Architecture	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	86--95	INFERENCE
CITATIONS	36 found	ParsCit 1.0