RAM-Efficient External Memory Sorting

DOI10.1007/978-3-642-45030-3_46zbMath1329.68089arXiv1312.2018OpenAlexW2341184735MaRDI QIDQ2872113

Lars Arge, Mikkel Thorup

Publication date: 14 January 2014

Published in: Algorithmica, Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.2018

zbMATH Keywords

sortingpriority queueexternal memory algorithmsI/O algorithmsRAM algorithms

Mathematics Subject Classification ID

Related Items (2)

How to pack directed acyclic graphs into small blocks ⋮ LCP Array Construction in External Memory

Cites Work

• Unnamed Item
• Unnamed Item
• The buffer tree: A technique for designing batched external data structures
• Heaps and heapsort on secondary storage
• Cache-Oblivious Algorithms
• Equivalence between priority queues and sorting
• Deterministic sorting in O ( n log log n ) time and linear space
• Worst-case efficient external-memory priority queues

This page was built for publication: RAM-Efficient External Memory Sorting