The design of divide and conquer algorithms

DOI10.1016/0167-6423(85)90003-6MaRDI QIDQ760206zbMATH OpenOpenAlexFDO

Authors 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

convex hullsortingcartesian productfunctionalitydivide and conquer algorithmsprogram scheme

Mathematics Subject Classification ID

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

Recommendations

• Applications of a strategy for designing divide-and-conquer algorithms
• Top-down synthesis of divide-and-conquer algorithms
• scientific article; zbMATH DE number 4009819
• Exact asymptotics of divide-and-conquer recurrences
• Pipelines for Divide-and-Conquer Functions

Cited in

(11)

• scientific article; zbMATH DE number 5568181 (Why is no real title available?)
• Top-down synthesis of divide-and-conquer algorithms
• Smart stacking for import containers using customer information at automated container terminals
• Pipelines for Divide-and-Conquer Functions
• scientific article; zbMATH DE number 203098 (Why is no real title available?)
• From supervised instance and feature selection algorithms to dual selection: a review
• Algorithm theories and design tactics
• Applications of a strategy for designing divide-and-conquer algorithms
• Synthesis of implementations for divide-and-conquer specifications
• Synthesis of list algorithms by mechanical proving
• A computational framework based on the dynamic pipeline approach

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

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