|
4
|
The Derivation of a Tighter Bound for Top-Down Skew Heaps
– Anne Kaldewaij, Berry Schoenmakers
- 1991
|
|
15
|
Optimal Purely Functional Priority Queues
– Gerth Stølting Brodal, Gerth Stlting Brodal, Chris Okasaki, Chris Okasaki
- 1996
|
|
2
|
Checking and Certifying Computational Results
– Jonathan D. Bright
- 1994
|
|
4
|
An Empirical Comparison of Priority Queue Algorithms
– Mauricio Marín
|
|
7
|
A Relational Basis for Program Construction by Parts
– Marc Frappier
- 1995
|
|
13
|
The Early Search for Tractable Ways of Reasoning About Programs
– C. B. Jones
- 2003
|
|
15
|
Between Functions and Relations in Calculating Programs
– Graham Muir Hutton
- 1992
|
|
8
|
A framework for speeding up priorityqueue operations
– Amr Elmasry, Claus Jensen, Jyrki Katajainen
- 2004
|
|
2
|
Discrete-Event Simulation on the Bulk-Synchronous Parallel Model
– Mauricio Marin, St Cross College, Supervisor Prof, W. F. Mccoll
- 1998
|
|
3
|
On the Pending Event Set and Binary Tournaments
– Mauricio Marín
|
|
17
|
Checking Mergeable Priority Queues
– Jonathan Bright, Gregory Sullivan
- 1994
|
|
5
|
Incremental Software Construction with Refinement Diagrams
– Ralph-johan Back
- 2005
|
|
11
|
A Tool for Data Refinement
– Rimvydas Ruksenas, et al.
- 1997
|
|
4
|
Inorder Traversal of a Binary Heap and its Inversion in Optimal Time and Space
– Berry Schoenmakers
- 1992
|
|
3
|
A Range Minima Parallel Algorithm for Coarse Grained Multicomputers
– H. Mongelli, S. W. Song
- 1999
|
|
4
|
Fast fractional cascading and its applications
– Qingmin Shi, Joseph Jaja
- 2003
|
|
11
|
On the range maximum-sum segment query problem
– Kuan-yu Chen, Kun-mao Chao
- 2004
|
|
54
|
Refinement Calculus, Part I: Sequential Nondeterministic Programs
– R. J. R. Back, J. von Wright
- 1989
|
|
|
Parallel and Distributed Branch-and-Bound/A* Algorithms
– V.-D. Cung, S. Dowaji, B. Le Cun, T. Mautor, C. Roucairol
- 1994
|
