Exact balancing is not always good

DOI10.1016/0020-0190(86)90148-1zbMath0587.68033OpenAlexW2079755555MaRDI QIDQ1072369

Marc Snir

Publication date: 1986

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(86)90148-1

zbMATH Keywords

mergingbalanced treesanalysis of divide- and-conquer algorithmsoptimization problem on binary trees

Mathematics Subject Classification ID

Related Items (1)

An asymptotic theory for recurrence relations based on minimization and maximization.

Cites Work

• Unnamed Item
• Recurrence relations based on minimization
• Divide and conquer for linear expected time

This page was built for publication: Exact balancing is not always good