Fishspear: A Priority Queue Algorithm (Extended Abstract)

Cached

Download Links

by Michael J. Fischer , Michael S. Paterson
Citations:11 - 1 self

Active Bibliography

Open Data Structures (in Java) – Pat Morin
Open Data Structures (in C++) – Pat Morin
24 A Performance Comparison of Event Calendar Algorithms: an Empirical Approach – Kehsiung Chung, Janche Sang, Vernon Rego - 1993
Modified Heap Data Structure for Manipulating Priority Queues – Settipalli Sreekanth, To The - 1999
4 An Empirical Comparison of Priority Queue Algorithms – Mauricio Marín
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 Optimal space-time dictionaries over an unbounded universe with flat implicit trees – Gianni Franceschini, Roberto Grossi - 2003
A Data Structure for Manipulating Priority Queues – S. L. Graham, R. L. Rivest, Jean Vuillemin, Universit De Paris-sud
3 A Practical Shortest Path Algorithm with Linear Expected Time – Andrew V. Goldberg - 2001
37 Worst-Case Efficient External-Memory Priority Queues – Gerth Stølting Brodal, Jyrki Katajainen - 1998
36 On the Inverse Shortest Path Problem – Didier Burton - 1993
6 On the Number of Heaps and the Cost of Heap Construction – Hsien-Kuei Hwang, Jean-marc Steyaert, École Polytechnique - 2001
1 Optimal Algorithms for Inserting a Random Element Into a Random Heap – Hsien-Kuei Hwang - 1996
1 Parallel and Distributed Branch-and-Bound/A* Algorithms – V.-D. Cung, S. Dowaji, B. Le Cun, T. Mautor, C. Roucairol - 1994
Heapsort using Multiple Heaps – D. Levendeas, C. Zaroliagis
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