|
|
Open Data Structures (in Java)
– Pat Morin
|
|
|
Open Data Structures (in C++)
– Pat Morin
|
|
23
|
A Performance Comparison of Event Calendar Algorithms: an Empirical Approach
– Kehsiung Chung, Janche Sang, Vernon Rego
- 1993
|
|
|
Optimal Algorithms for Inserting a Random Element Into a Random Heap
– Hsien-Kuei Hwang
- 1996
|
|
|
Modified Heap Data Structure for Manipulating Priority Queues
– Settipalli Sreekanth, To The
- 1999
|
|
4
|
An Empirical Comparison of Priority Queue Algorithms
– Mauricio Marín
|
|
5
|
On the Number of Heaps and the Cost of Heap Construction
– Hsien-Kuei Hwang, Jean-marc Steyaert, École Polytechnique
- 2001
|
|
2
|
Three New Sorting Algorithms Based on a Distribute-Collect Paradigm
– P. Y. Padhye
- 1993
|
|
1
|
Circular Sort: A New Improved Version of Insertion Sort Algorithm
– P. Y. Padhye
|
|
|
Check Sort: A New Improved `Intelligent' Version of Circular Sort Algorithm
– P. Y. Padhye
|
|
2
|
A Practical Shortest Path Algorithm with Linear Expected Time
– Andrew V. Goldberg
- 2001
|
|
2
|
Optimal space-time dictionaries over an unbounded universe with flat implicit trees
– Gianni Franceschini, Roberto Grossi
- 2003
|
|
|
Parallel and Distributed Branch-and-Bound/A* Algorithms
– V.-D. Cung, S. Dowaji, B. Le Cun, T. Mautor, C. Roucairol
- 1994
|
|
24
|
On the Inverse Shortest Path Problem
– Didier Burton
- 1993
|
|
35
|
Worst-Case Efficient External-Memory Priority Queues
– Gerth Stølting Brodal, Jyrki Katajainen
- 1998
|
|
|
Communicating Sequential Processes
– Hoare's Communicating Sequential
|
|
3
|
Science and Engineering of Large Scale Socio-Technical Simulations
– Chris Barrett, Stephen Eubank, Madhav Marathe, Henning Mortveit, Christian Reidys
- 2002
|
|
14
|
A General Approach to Performance Analysis and Optimization of Asynchronous Circuits
– Tak Kwan Lee
- 1995
|
|
10
|
Aldébaran: A Tool for Verification of Communicating Processes
– Jean-Claude Fernandez
- 1989
|
