|
3
|
On the Pending Event Set and Binary Tournaments
– Mauricio Marín
|
|
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
|
|
10
|
Weight Biased Leftist Trees and Modified Skip Lists
– S. Cho, S. Sahni, Seonghun Cho, Sartaj Sahni
- 1996
|
|
23
|
A Performance Comparison of Event Calendar Algorithms: an Empirical Approach
– Kehsiung Chung, Janche Sang, Vernon Rego
- 1993
|
|
6
|
Amortization, Lazy Evaluation, and Persistence: Lists with Catenation via Lazy Linking
– Chris Okasaki
- 1995
|
|
15
|
Purely Functional Random-Access Lists
– Chris Okasaki
- 1995
|
|
2
|
A Generalization of Binomial Queues
– Rolf Fagerberg
- 1996
|
|
1
|
On sorting, heaps, and minimum spanning trees
– Gonzalo Navarro, Rodrigo Paredes
|
|
11
|
Functional Binomial Queues
– David King
- 1994
|
|
6
|
A Probabilistic Approach to the Problem of Automatic Selection of Data Representations
– Tyng-Ruey Chuang, Wen L. Hwang
- 1996
|
|
12
|
Purely Functional, Real-Time Deques with Catenation
– Haim Kaplan, Robert E. Tarjan
- 1999
|
|
10
|
Simple Confluently Persistent Catenable Lists
– Haim Kaplan, Chris Okasaki, Robert, Robert E. Tarjan
- 1998
|
|
9
|
Portable Distributed Priority Queues with MPI
– Bernard Mans, North Queensland
- 1995
|
|
|
Parallel and Distributed Branch-and-Bound/A* Algorithms
– V.-D. Cung, S. Dowaji, B. Le Cun, T. Mautor, C. Roucairol
- 1994
|
|
10
|
Making Data Structures Confluently Persistent
– Amos Fiat, Haim Kaplan, Albert Einstein
- 2001
|
|
13
|
The Role of Lazy Evaluation in Amortized Data Structures
– Chris Okasaki
- 1996
|
|
2
|
Thin Heaps, Thick Heaps
– Haim Kaplan, Robert E. Tarjan
- 2006
|
|
8
|
A framework for speeding up priorityqueue operations
– Amr Elmasry, Claus Jensen, Jyrki Katajainen
- 2004
|
