Divide-and-conquer recurrences associated with generalized heaps, optimal merge, and related structures

DOI10.1016/S0304-3975(01)00336-XzbMath1026.68153OpenAlexW2036886102MaRDI QIDQ1870561

Wei-Mei Chen, Gen-Huey Chen

Publication date: 14 May 2003

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00336-x

zbMATH Keywords

divide-and-conquerHuffman codinggeneralized heapoptimal merge

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How evenly should one divide to conquer quickly?
• Worst-case analysis of a generalized heapsort algorithm
• Priority queues with update and finding minimum spanning trees
• Queue-mergesort
• Mellin transforms and asymptotics: Digital sums
• Recurrence relations on heaps
• Some Maximal Solutions of the Generalized Subadditive Inequality
• Some Recurrence Relations of Recursive Minimization
• On the Optimality of Huffman Trees
• The Cost Distribution of Queue-Mergesort, Optimal Mergesorts, and Power-of-2 Rules
• Near Optimal   Heap
• Concerning the Merging of Equal Length Tape Files

This page was built for publication: Divide-and-conquer recurrences associated with generalized heaps, optimal merge, and related structures