|
15
|
Optimal Purely Functional Priority Queues
– Gerth Stølting Brodal, Gerth Stlting Brodal, Chris Okasaki, Chris Okasaki
- 1996
|
|
23
|
A Performance Comparison of Event Calendar Algorithms: an Empirical Approach
– Kehsiung Chung, Janche Sang, Vernon Rego
- 1993
|
|
2
|
Discrete-Event Simulation on the Bulk-Synchronous Parallel Model
– Mauricio Marin, St Cross College, Supervisor Prof, W. F. Mccoll
- 1998
|
|
4
|
An Empirical Comparison of Priority Queue Algorithms
– Mauricio Marín
|
|
3
|
On the Pending Event Set and Binary Tournaments
– Mauricio Marín
|
|
2
|
A Generalization of Binomial Queues
– Rolf Fagerberg
- 1996
|
|
20
|
An Empirical Analysis of Algorithms for Constructing a Minimum Spanning Tree
– Bernard M. E. Moret, Henry D. Shapiro
- 1991
|
|
8
|
A framework for speeding up priorityqueue operations
– Amr Elmasry, Claus Jensen, Jyrki Katajainen
- 2004
|
|
|
Rank-Pairing Heaps
– Bernhard Haeupler, Siddhartha Sen, Robert E. Tarjan
|
|
2
|
Thin Heaps, Thick Heaps
– Haim Kaplan, Robert E. Tarjan
- 2006
|
|
10
|
Weight Biased Leftist Trees and Modified Skip Lists
– S. Cho, S. Sahni, Seonghun Cho, Sartaj Sahni
- 1996
|
|
7
|
Are Fibonacci Heaps Optimal?
– Diab Abuaiadh, Jeffrey H. Kingston
- 1994
|
|
2
|
Checking and Certifying Computational Results
– Jonathan D. Bright
- 1994
|
|
1
|
Design and Analysis of Algorithms: Course Notes
– Samir Khuller
|
|
1
|
On sorting, heaps, and minimum spanning trees
– Gonzalo Navarro, Rodrigo Paredes
|
|
|
Potentials and Limitations of Visual Methods for the Exploration of Complex Data Structures
– Tobias Lauer
- 2007
|
|
|
Examiner
– Tobias Bethlehem, Prof Tadao, Takaoka Supervisor, Prof Tomio Hirata
|
|
17
|
Dijkstra’s algorithm with Fibonacci heaps: An executable description
– Jon Sneyers, Tom Schrijvers, Bart Demoen
- 2006
|
|
4
|
Buckets, Heaps, Lists, and Monotone Priority Queues
– Boris Cherkassky, Krasikova St, Andrew V. Goldberg
- 1997
|
