The design of divide and conquer algorithms

DOI10.1016/0167-6423(85)90003-6zbMath0554.68021OpenAlexW2070375989MaRDI QIDQ760206

Douglas R. Smith

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0167-6423(85)90003-6

zbMATH Keywords

sortingconvex hullcartesian productfunctionalitydivide and conquer algorithmsprogram scheme

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Algorithms in computer science (68W99)

Related Items (5)

Smart stacking for import containers using customer information at automated container terminals ⋮ Synthesis of implementations for divide-and-conquer specifications ⋮ From Supervised Instance and Feature Selection Algorithms to Dual Selection: A Review ⋮ Synthesis of list algorithms by mechanical proving ⋮ Top-down synthesis of divide-and-conquer algorithms

This page was built for publication: The design of divide and conquer algorithms