Heaps and heapsort on secondary storage

DOI10.1016/S0304-3975(99)00006-7zbMath0954.68061OpenAlexW2012322590MaRDI QIDQ1575844

N. Delaunay

Publication date: 23 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00006-7

zbMATH Keywords

secondary storage

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (6)

Worst-case efficient external-memory priority queues ⋮ An I/O Efficient Algorithm for Minimum Spanning Trees ⋮ On sorting, heaps, and minimum spanning trees ⋮ Unnamed Item ⋮ A Survey on Priority Queues ⋮ RAM-Efficient External Memory Sorting

Cites Work

• Time bounds for selection
• Organization and maintenance of large ordered indexes
• Sorting a Random Access File in situ
• Amortized Computational Complexity
• Self-adjusting binary search trees
• Self-Adjusting Heaps
• The buffer tree: A new technique for optimal I/O-algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Heaps and heapsort on secondary storage