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

DOI10.1016/S0304-3975(01)00336-XMaRDI QIDQ1870561zbMATH OpenOpenAlexFDO

Authors 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-conquergeneralized heapHuffman codingoptimal merge

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Exact asymptotics of divide-and-conquer recurrences
• Exact balancing is not always good
• Exact and asymptotic solutions of a divide-and-conquer recurrence dividing at half: theory and applications
• Recurrence relations on heaps
• Multidimensional Divide-and-Conquer Maximin Recurrences

Cites work

• Concerning the Merging of Equal Length Tape Files
• How evenly should one divide to conquer quickly?
• scientific article; zbMATH DE number 3856423 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3700229 (Why is no real title available?)
• scientific article; zbMATH DE number 3456303 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 1984550 (Why is no real title available?)
• scientific article; zbMATH DE number 909705 (Why is no real title available?)
• Mellin transforms and asymptotics: Digital sums
• Near Optimal   Heap
• On the Optimality of Huffman Trees
• Priority queues with update and finding minimum spanning trees
• Queue-mergesort
• Recurrence relations on heaps
• Some Maximal Solutions of the Generalized Subadditive Inequality
• Some Recurrence Relations of Recursive Minimization
• The Cost Distribution of Queue-Mergesort, Optimal Mergesorts, and Power-of-2 Rules
• Worst-case analysis of a generalized heapsort algorithm

Cited in

(2)

• Divisor generating functions and insertion into a heap
• Recurrence relations on heaps

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1870561)