Optimal Purely Functional Priority Queues (1996)

by Gerth Stølting Brodal , Gerth St��lting Brodal , Chris Okasaki
Venue:Journal of Functional Programming
Citations:18 - 1 self

Documents Related by Co-Citation

226 Functional Data Structures – Chris Okasaki - 1996
25 Persistent lists with catenation via recursive slow-down – H Kaplan, R E Tarjan - 1995
17 A programming and problem-solving seminar – C Van Wyk, D Knuth - 1979
86 A data structure for manipulating priority queues – J Vuillemin - 1978
22 Fully persistent lists with catenation – James R Driscoll, Daniel D K Sleator, Robert E Tarjan - 1994
11 Functional Binomial Queues – David King - 1994
73 Relaxed heaps: An alternative to Fibonacci heaps with applications to parallel computation – James R Driscoll, Harold N Gabow, Ruth Shrairman, Robert E Tarjan - 1988
31 Worst-Case Efficient Priority Queues – Gerth Stølting Brodal, Gerth St��lting Brodal - 1996
579 Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms – M Fredman, R Tarjan - 1987
33 Fully persistent arrays – P F Dietz - 1989
250 Making Data Structures Persistent – James R. Driscoll, Neil Sarnak, Daniel D. Sleator, Robert E. Tarjan - 1989
174 Tarjan, Planar point location using persistent search trees – N Sarnak, R E - 1986
17 Purely Functional Random-Access Lists – Chris Okasaki - 1995
39 Implementation and analysis of binomial queue algorithms – M R Brown - 1978
12 New heap data structures – H Kaplan, R Tarjan - 1999
14 On the efficiency of pairing heaps and related data structures – M L Fredman - 1999
18 Meldable heaps and Boolean union-find – H Kaplan, N Shafrir, R E Tarjan - 2002
48 The pairing heap: A new form of self-adjusting heap – M L Fredman, R Sedgewick, D D Sleator, R E Tarjan - 1986
16 Purely Functional Representations of Catenable Sorted Lists. – Haim Kaplan, Robert E. Tarjan - 1996