Multiway in-place merging
type: Item
instance of: scholarly article
title: Multiway in-place merging
zbMATH Open document ID: 1191.68223
author: Viliam Geffert
author: Jozef Gajdoš
published in: Theoretical Computer Science
publication date: 2010-04-15T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 5693346
zbMATH Keywords: in-place algorithms
zbMATH Keywords: merging
zbMATH Keywords: sorting
describes a project that uses: heapsort
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.01.034
OpenAlex ID: W1995461012
cites work: A Note on HEAPSORT
cites work: Optimizing stable in-place merging.
cites work: On a stable minimum storage merging algorithm
cites work: Sorting by Merging or Merging by Sorting?
cites work: An in-place sorting with O ( n log n ) comparisons and O ( n ) moves
cites work: Multiway In-Place Merging
cites work: Asymptotically efficient in-place merging
cites work: In-place sorting with fewer moves
cites work: Q4344097
cites work: The Analysis of Heapsort
cites work: BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small)
DOI: 10.1016/J.TCS.2010.01.034
description: scientific article; zbMATH DE number 5693346