Simple and efficient purely functional queues and deques (1995)

Cached

Download Links

by Chris Okasaki
Venue:JOURNAL OF FUNCTIONAL PROGRAMMING
Citations:25 - 6 self

Documents Related by Co-Citation

250 Making Data Structures Persistent – James R. Driscoll, Neil Sarnak, Daniel D. Sleator, Robert E. Tarjan - 1989
25 Persistent lists with catenation via recursive slow-down – H Kaplan, R E Tarjan - 1995
23 Real-time queue operations – Robert Hood, Robert Melville - 1981
226 Functional Data Structures – Chris Okasaki - 1996
12 Real-Time Deques, Multihead Turing Machines, and Purely Functional Programming – Tyng-Ruey Chuang, Benjamin Goldberg - 1993
138 Amortized computational complexity – R E Tarjan - 1985
12 A symmetric set of efficient list operations – R R Hoogerwoord - 1992
15 Confluently Persistent Deques via Data-Structural Bootstrapping – Adam L. Buchsbaum, Robert E. Tarjan - 1993
9 Real-time queue operations in pure lisp – R Hood, R Melville - 1981
1312 Monads for functional programming – Philip Wadler - 1995
1565 The Definition of Standard ML – Robin Milner, Mads Tofte - 1990
469 The Science of Programming – D Gries - 1981
16 Efficient functional implementation of FIFO queues – F Warren Burton - 1982
11 Functional Binomial Queues – David King - 1994
86 A data structure for manipulating priority queues – J Vuillemin - 1978
33 Fully persistent arrays – P F Dietz - 1989
6 The Efficient Implementation of Very-High-Level Programming Language Constructs – Robert Hood - 1982
11 Data Structures and Amortized Complexity in a Functional Setting – Berry Schoenmakers - 1992
13 The Role of Lazy Evaluation in Amortized Data Structures – Chris Okasaki - 1996