Divide-and-conquer recurrences associated with generalized heaps, optimal merge, and related structures
type: Item
instance of: scholarly article
title: Divide-and-conquer recurrences associated with generalized heaps, optimal merge, and related structures
zbMATH Open document ID: 1026.68153
DOI: 10.1016/S0304-3975(01)00336-X
author: Wei-Mei Chen
author: Gen-Huey Chen
published in: Theoretical Computer Science
publication date: 2003-05-14T00:00:00Z
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 1909905
zbMATH Keywords: divide-and-conquer
zbMATH Keywords: generalized heap
zbMATH Keywords: optimal merge
zbMATH Keywords: Huffman coding
MaRDI profile type: Publication
cites work: Some Recurrence Relations of Recursive Minimization
cites work: Some Maximal Solutions of the Generalized Subadditive Inequality
cites work: The Cost Distribution of Queue-Mergesort, Optimal Mergesorts, and Power-of-2 Rules
cites work: Q3619797
cites work: Mellin transforms and asymptotics: Digital sums
cites work: On the Optimality of Huffman Trees
cites work: Concerning the Merging of Equal Length Tape Files
cites work: Q3325055
cites work: Queue-mergesort
cites work: Q4042466
cites work: Q4888166
cites work: Q4428915
cites work: Priority queues with update and finding minimum spanning trees
cites work: Q4057549
cites work: Near Optimal Heap
cites work: Q3893324
cites work: Worst-case analysis of a generalized heapsort algorithm
cites work: Recurrence relations on heaps
cites work: How evenly should one divide to conquer quickly?
full work available at URL: s0304-3975(01)00336-x
OpenAlex ID: W2036886102
description: scientific article; zbMATH DE number 1909905