On sorting, heaps, and minimum spanning trees
From MaRDI portal
Publication:973020
Recommendations
- On the heap sort algorithm
- Min-max heaps and generalized priority queues
- On Some Parameters in Heap Ordered Trees
- A note on constructing min-max heaps
- On the ``heap problem
- A Note on HEAPSORT
- On the Best Case of Heapsort
- scientific article; zbMATH DE number 4047086
- An optimal algorithm for selection in a min-heap
- A variant of heapsort with almost optimal number of comparisons
Cites work
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- scientific article; zbMATH DE number 177565 (Why is no real title available?)
- A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest
- A data structure for manipulating priority queues
- A minimum spanning tree algorithm with inverse-Ackermann type complexity
- A practical minimum spanning tree algorithm using the cycle property
- Amortized Computational Complexity
- An experimental study of priority queues in external memory
- BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small)
- Cache-oblivious algorithms
- Design and implementation of an efficient priority queue
- Fast priority queues for cached memory
- Faster algorithms for the shortest path problem
- Finding Minimum Spanning Trees
- Heaps and heapsort on secondary storage
- Introduction to algorithms
- On the limits of cache-obliviousness
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Organization and maintenance of large ordered indexes
- Self-Adjusting Heaps
- The birth of the giant component
- The pairing heap: A new form of self-adjusting heap
- Time bounds for selection
Cited in
(6)
This page was built for publication: On sorting, heaps, and minimum spanning trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q973020)
