Simple and efficient purely functional queues and deques

Simple and efficient purely functional queues and deques (1995)

by Chris Okasaki

Venue:	JOURNAL OF FUNCTIONAL PROGRAMMING
Citations:	24 - 6 self

Datum	Value	Source
TITLE	Simple and Efficient Purely Functional Queues	SVM HeaderParse 0.1
AUTHOR NAME	Deques	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
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 purely functional implementations of queues and double-ended queues (deques) requiring only O(1) time per operation in the worst case. Our algorithms are considerably simpler than previous designs with the same bounds. The inspiration for our approach is the incremental behavior of certain functions on lazy lists. Capsule Review This paper presents another example of the ability to write programs in functional languages that satisfy our desire for clarity while satisfying our need for efficiency. In this case, the subject (often-studied) is the implementation of queues and dequeues that are functional and exhibit constant-time worst-case insertion and deletion operations. Although the problem has been solved previously, this paper presents the simplest algorithm so far. As the author notes, it has a strange feature of requiring some laziness-- but not too much! 1	SVM HeaderParse 0.1
CITATIONS	8 found	ParsCit 1.0