Purely Functional Random-Access Lists (1995)

Cached

Download Links

by Chris Okasaki
Venue:In Functional Programming Languages and Computer Architecture
Citations:17 - 2 self

Documents Related by Co-Citation

25 Persistent lists with catenation via recursive slow-down – H Kaplan, R E Tarjan - 1995
226 Functional Data Structures – Chris Okasaki - 1996
13 An applicative random-access stack – Eugene W. Myers - 1983
250 Making Data Structures Persistent – James R. Driscoll, Neil Sarnak, Daniel D. Sleator, Robert E. Tarjan - 1989
4 Auburn: A Kit for Benchmarking Functional Data Structures – Graeme E. Moss, Colin Runciman - 1997
13 A New Method for Functional Arrays – Melissa O'Neill, F. Warren Burton - 1997
25 Simple and efficient purely functional queues and deques – Chris Okasaki - 1995
5 Automated Benchmarking of Functional Data Structures – Graeme E. Moss, Colin Runciman - 1999
18 Optimal Purely Functional Priority Queues – Gerth Stølting Brodal, Chris Okasaki - 1996
15 Confluently Persistent Deques via Data-Structural Bootstrapping – Adam L. Buchsbaum, Robert E. Tarjan - 1993
35 Efficient Applicative Data Types – E W Myers - 1984
4 Three algorithms on Braun trees – Chris Okasaki - 1997
10 Catenable Double-Ended Queues – Chris Okasaki - 1997
8 A logarithmic implementation of flexible arrays – Rob R Hoogerwoord
579 Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms – M Fredman, R Tarjan - 1987
46 Self adjusting heaps – D D Sleator, R E Tarjan - 1986
12 Real-Time Deques, Multihead Turing Machines, and Purely Functional Programming – Tyng-Ruey Chuang, Benjamin Goldberg - 1993
12 A symmetric set of efficient list operations – R R Hoogerwoord - 1992
13 The Role of Lazy Evaluation in Amortized Data Structures – Chris Okasaki - 1996