The design of divide and conquer algorithms

DOI10.1016/0167-6423(85)90003-6zbMATH Open0554.68021OpenAlexW2070375989MaRDI QIDQ760206FDOQ760206

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

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

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)

Cited In (11)

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

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)