Applications of a strategy for designing divide-and-conquer algorithms

DOI10.1016/0167-6423(87)90034-7zbMath0616.68045OpenAlexW2051228988MaRDI QIDQ1821558

Douglas R. Smith

Publication date: 1987

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6423(87)90034-7

zbMATH Keywords

algorithm designdivide-and-conquer algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Related Items (7)

Categories, relations and dynamic programming ⋮ Randomized algorithm for the sum selection problem ⋮ Ranking \(k\) maximum sums ⋮ Synthesis of implementations for divide-and-conquer specifications ⋮ TOWARDS PARALLEL PROGRAMMING BY TRANSFORMATION: THE FAN SKELETON FRAMEWORK* ⋮ Efficient algorithms for the sum selection problem and \(k\) maximum sums problem ⋮ A parallel scheduling algorithm for reinforcement learning in large state space

This page was built for publication: Applications of a strategy for designing divide-and-conquer algorithms