Algorithm design through the optimization of reuse-based generation
From MaRDI portal
Publication:1980486
Recommendations
- An incremental approach to automatic algorithm design
- Optimal deterministic algorithm generation
- A problem reduction based approach to discrete optimization algorithm design
- Combinatorial optimization problem reduction and algorithm derivation
- Evolution of templates for synthesis of scientific algorithms
Cites work
- scientific article; zbMATH DE number 3740740 (Why is no real title available?)
- scientific article; zbMATH DE number 49833 (Why is no real title available?)
- scientific article; zbMATH DE number 1033192 (Why is no real title available?)
- scientific article; zbMATH DE number 1956470 (Why is no real title available?)
- A Linear In-situ Algorithm for the Power of Cyclic Permutation
- A categorical manifesto
- A family of linear programming algorithms based on an algorithm by von Neumann
- A simple greedy algorithm for a class of shuttle transportation problems
- Algorithm classification through synthesis
- Algorithmics. The spirit of computing
- An axiomatic basis for computer programming
- COAL: a generic modelling and prototyping framework for convex optimization problems of variational image analysis
- Cocktail: A tool for deriving correct programs
- Formal derivation of graph algorithmic programs using partition-and-recur
- Fully abstract models of typed \(\lambda\)-calculi
Cited in
(6)- Evolution of templates for synthesis of scientific algorithms
- Algorithm design from procedures of a fixed set and minimization of the input data
- A problem reduction based approach to discrete optimization algorithm design
- Optimal deterministic algorithm generation
- Combinatorial optimization problem reduction and algorithm derivation
- An incremental approach to automatic algorithm design
This page was built for publication: Algorithm design through the optimization of reuse-based generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1980486)