Optimal incremental sorting (2006)

by Rodrigo Paredes , Gonzalo Navarro
Venue:In Proc. 8th Workshop on Algorithm Engineering and Experiments (ALENEX
Citations:9 - 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
792 Introduction to Algorithms, Second Edition – T H Leiserson, C E Cormen, R L Rivest, C Stein - 2001
621 Voronoi diagrams -- a survey of a fundamental geometric data structure – Franz Aurenhammer - 1991
818 An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions – Sunil Arya, David M. Mount, Nathan S. Netanyahu, Ruth Silverman, Angela Y. Wu - 1994
1923 Randomized Algorithms – Rajeev Motwani - 1995
685 Approximating discrete probability distributions with dependence trees – C. K. Chow, C. N. Liu - 1968
557 How bad is selfish routing? – Tim Roughgarden, Éva Tardos - 2002
564 Program Analysis and Specialization for the C Programming Language – Lars Ole Andersen - 1994