On sorting, heaps, and minimum spanning trees

by Gonzalo Navarro , Rodrigo Paredes
Venue:Algorithmica
Citations:1 - 1 self

Active Bibliography

7 Optimal incremental sorting – Rodrigo Paredes, Gonzalo Navarro - 2006
Quickheaps: Simple, Efficient, and Cache-Oblivious ⋆ – 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
13 I/O-Efficient Algorithms for Shortest Path Related Problems – Norbert Ralf Zeh - 2002
10 Cache-oblivious algorithms and data structures – Gerth Stølting Brodal - 2004
7 State-of-the-Art Algorithms for Minimum Spanning Trees -- A Tutorial Discussion – Jason Eisner - 1997
15 An Experimental Study of Priority Queues in External Memory – Klaus Brengel, et al.
37 Network Flow Algorithms – Andrew V. Goldberg, Eva Tardos, Robert E. Tarjan
27 External-Memory Algorithms with Applications in Geographic Information Systems – Lars Arge - 1997
2 Checking and Certifying Computational Results – Jonathan D. Bright - 1994
68 Cache-oblivious priority queue and graph algorithm applications – Lars Arge, Bryan Holland-minkley, Michael A. Bender, J. Ian Munro, Erik D. Demaine - 2002
2 Thin Heaps, Thick Heaps – Haim Kaplan, Robert E. Tarjan - 2006
1 Randomized Minimum Spanning Tree Algorithms Using Exponentially Fewer Random Bits – Seth Pettie
4 Buckets, Heaps, Lists, and Monotone Priority Queues – Boris Cherkassky, Krasikova St, Andrew V. Goldberg - 1997
9 Expected Performance of Dijkstra's Shortest Path Algorithm – Andrew V. Goldberg, Robert E. Tarjan - 1996
5 An Optimal Cache-Oblivious Priority Queue and its Application to Graph Algorithms – Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro - 2007
8 Graphs for Metric Space Searching – Rodrigo Paredes - 2008
1 Computational Biology – Rune B. Lyngsø, Rune B. Lyngs, Rune Bang Lyngs - 2000