Optimal incremental sorting (2006)

by Rodrigo Paredes , Gonzalo Navarro
Venue:In Proc. 8th Workshop on Algorithm Engineering and Experiments (ALENEX
Citations:7 - 5 self

Active Bibliography

1 On sorting, heaps, and minimum spanning trees – Gonzalo Navarro, Rodrigo Paredes
STRONGER QUICKHEAPS – Gonzalo Navarro, Rodrigo Paredes, Patricio V. Poblete, Peter Sanders
Finding Minimum Spanning Trees in O(m α(m,n)) Time – Seth Pettie - 1999
2 Randomized Minimum Spanning Tree Algorithms Using Exponentially Fewer Random Bits – Seth Pettie
7 State-of-the-Art Algorithms for Minimum Spanning Trees -- A Tutorial Discussion – Jason Eisner - 1997
1 Priority Queues and Dijkstra’s Algorithm ∗ – Mo Chen, Rezaul Alam, Chowdhury Vijaya Ramach, David Lan, Roche Lingling Tong - 2007
12 A shortest path algorithm for real-weighted undirected graphs – Seth Pettie, Vijaya Ramachandran - 1985
2 Checking and Certifying Computational Results – Jonathan D. Bright - 1994
12 Experimental Evaluation of a New Shortest Path Algorithm (Extended Abstract) – Seth Pettie, Vijaya Ramachandran, Srinath Sridhar - 2002
2 A Generalization of Binomial Queues – Rolf Fagerberg - 1996
10 A Practical Minimum Spanning Tree Algorithm Using the Cycle Property – Irit Katriel, Peter Sanders, Jesper Larsson Träff - 2003
27 Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators – Adam L. Buchsbaum , Haim Kaplan, Anne Rogers, Jeffery R. Westbrook - 1998
2 Testing Euclidean minimum spanning trees in the plane – Artur Czumaj, Christian Sohler, Martin Ziegler - 2007
3 A Practical Shortest Path Algorithm with Linear Expected Time – Andrew V. Goldberg - 2001
1 Improved Algorithms for Replacement Paths Problems in Restricted Graphs – Amit M Bhosle - 2005
Quickheaps: Simple, Efficient, and Cache-Oblivious ⋆ – Gonzalo Navarro, Rodrigo Paredes
16 Concurrent Threads and Optimal Parallel Minimum Spanning Trees Algorithm – Ka Wong Chong, Yijie Han, Tak-Wah Lam - 2001
On Cartesian Trees and Range Minimum Queries – Oren Weimann
18 Optimal Purely Functional Priority Queues – Gerth Stølting Brodal, Chris Okasaki - 1996