Amortization, Lazy Evaluation, and Persistence: Lists with Catenation via Lazy Linking (1995)

Cached

Download Links

by Chris Okasaki
Venue:Pages 646--654 of: IEEE Symposium on Foundations of Computer Science
Citations:6 - 1 self

Documents Related by Co-Citation

13 The Role of Lazy Evaluation in Amortized Data Structures – Chris Okasaki - 1996
25 Persistent lists with catenation via recursive slow-down – H Kaplan, R E Tarjan - 1995
25 Simple and efficient purely functional queues and deques – Chris Okasaki - 1995
4 The Derivation of a Tighter Bound for Top-Down Skew Heaps – Anne Kaldewaij, Berry Schoenmakers - 1991
11 Data Structures and Amortized Complexity in a Functional Setting – Berry Schoenmakers - 1992
46 Self adjusting heaps – D D Sleator, R E Tarjan - 1986
86 A data structure for manipulating priority queues – J Vuillemin - 1978
250 Making Data Structures Persistent – James R. Driscoll, Neil Sarnak, Daniel D. Sleator, Robert E. Tarjan - 1989
377 Self-adjusting binary search trees – D D Sleator, R E Tarjan - 1985
17 Purely Functional Random-Access Lists – Chris Okasaki - 1995
86 An empirical comparison of priority-queue and event-set implementations – D W Jones - 1986
11 Functional Binomial Queues – David King - 1994
7 Balanced trees with removals: an exercise in rewriting and proof – C M P Reade - 1992
226 Functional Data Structures – Chris Okasaki - 1996
18 Optimal Purely Functional Priority Queues – Gerth Stølting Brodal, Chris Okasaki - 1996
4 Efficiency of equivalence algorithms – M J Fischer - 1972
40 Concurrent Operations on Priority Queues – D W Jones - 1989
255 Efficiency of a good but not linear set-union algorithm – R E Tarjan - 1975
696 Art of Computer Programming Volume 3: Sorting and Searching – D E Knuth - 1998