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
226 Functional Data Structures – Chris Okasaki - 1996
23 Real-time queue operations – Robert Hood, Robert Melville - 1981
15 Confluently Persistent Deques via Data-Structural Bootstrapping – Adam L. Buchsbaum, Robert E. Tarjan - 1993
33 Fully persistent arrays – P F Dietz - 1989
138 Amortized computational complexity – R E Tarjan - 1985
12 Real-Time Deques, Multihead Turing Machines, and Purely Functional Programming – Tyng-Ruey Chuang, Benjamin Goldberg - 1993
13 The Role of Lazy Evaluation in Amortized Data Structures – Chris Okasaki - 1996
22 Fully persistent lists with catenation – James R Driscoll, Daniel D K Sleator, Robert E Tarjan - 1994
9 Real-time queue operations in pure lisp – R Hood, R Melville - 1981
22 Deques with heap order – H Gajewska, R E Tarjan - 1986
15 Data Structural Bootstrapping, Linear Path Compression, and Catenable Heap Ordered Double Ended Queues – Adam L. Buchsbaum, Rajamani Sundar, Robert E. Tarjan - 1992
12 A symmetric set of efficient list operations – R R Hoogerwoord - 1992
16 Purely Functional Representations of Catenable Sorted Lists. – Haim Kaplan, Robert E. Tarjan - 1996
1312 Monads for functional programming – Philip Wadler - 1995
13 lazy evaluation, and persistence: Lists with catenation via lazy linking – Amortization - 1995
16 Efficient functional implementation of FIFO queues – F Warren Burton - 1982
469 The Science of Programming – D Gries - 1981