How evenly should one divide to conquer quickly?

DOI10.1016/0020-0190(84)90086-3MaRDI QIDQ800084zbMATH OpenOpenAlexFDO

Authors Timothy R. S. Walsh

Publication date 1984

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

Full work available at URL https://doi.org/10.1016/0020-0190(84)90086-3

zbMATH Keywords

balanced divisionbalancingdivide-and-conquermerge-sorting algorithmrecursion vs. iterationtime complexity

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Exact balancing is not always good
• On the balanced divide and conquer equation
• Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy
• Exact asymptotics of divide-and-conquer recurrences
• The relationship between balance and the speed of algorithms

Cited in

(5)

• An asymptotic theory for recurrence relations based on minimization and maximization.
• Divide-and-conquer recurrences associated with generalized heaps, optimal merge, and related structures
• scientific article; zbMATH DE number 203098 (Why is no real title available?)
• The relationship between balance and the speed of algorithms
• Recursively divisible problems

This page was built for publication: How evenly should one divide to conquer quickly?

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