Queue-mergesort
type: Item
instance of: scholarly article
title: Queue-mergesort
zbMATH Open document ID: 0787.68030
DOI: 10.1016/0020-0190(93)90088-Q
author: Robert Sedgewick
author: Mordecai J. Golin
published in: Information Processing Letters
publication date: 1994-02-24T00:00:00Z
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 500529
zbMATH Keywords: Huffman encoding
zbMATH Keywords: binary trees
zbMATH Keywords: sorting algorithms
zbMATH Keywords: queue-mergesort
MaRDI profile type: Publication
cites work: Q3883524
cites work: Q5619800
cites work: Q5585020
cites work: Q4057549
full work available at URL: 0020-0190(93)90088-q
OpenAlex ID: W2913944365
Recommended article: The heap-mergesort
Recommended article: Algorithm Theory - SWAT 2004
Recommended article: Melding priority queues
Recommended article: MERGEABLE DOUBLE-ENDED PRIORITY QUEUES
Recommended article: Range-restricted mergeable priority queues
Recommended article: Parallel Merge Sort
Recommended article: Sorting by shuffling methods and a queue
Recommended article: Fast meldable priority queues
Recommended article: Priority Queues and Permutations
Recommended article: Worst-Case Efficient Sorting with QuickMergesort
description: scientific article; zbMATH DE number 500529