The Cost Distribution of Queue-Mergesort, Optimal Mergesorts, and Power-of-2 Rules
From MaRDI portal
Publication:4238537
DOI10.1006/jagm.1998.0986zbMath0923.68045OpenAlexW1990992047MaRDI QIDQ4238537
Hsien-Kuei Hwang, Gen-Huey Chen, Wei-Mei Chen
Publication date: 25 October 1999
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/41be31ddde4ae0882e8888f203639083f96d6bf9
Related Items (5)
On \(\alpha \)-greedy expansions of numbers ⋮ An asymptotic theory for recurrence relations based on minimization and maximization. ⋮ Distribution of the sum-of-digits function of random integers: a survey ⋮ A general limit theorem for recursive algorithms and combinatorial structures ⋮ Divide-and-conquer recurrences associated with generalized heaps, optimal merge, and related structures
This page was built for publication: The Cost Distribution of Queue-Mergesort, Optimal Mergesorts, and Power-of-2 Rules
