Categories, relations and dynamic programming
From MaRDI portal
Publication:4286530
DOI10.1017/S0960129500000360zbMath0793.90091OpenAlexW4206120425MaRDI QIDQ4286530
Publication date: 16 August 1994
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0960129500000360
Related Items (5)
List partitions ⋮ Partiality. II: Constructed relation algebras ⋮ Predicate transformers and higher-order programs ⋮ A short cut to optimal sequences ⋮ Program Calculation in Coq
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Data structures and program transformation
- Program inversion: More than fun!
- An exercise in transformational programming: Backtracking and Branch-and- Bound
- Algorithm theories and design tactics
- A new look at Bellman's principle of optimality
- Top-down synthesis of divide-and-conquer algorithms
- Transformational programming and the paragraph problem
- The principle of optimality in the design of efficient algorithms
- On efficient parallel computations for some dynamic programming problems
- Dynamic programming on two-dimensional systolic arrays
- Speeding up dynamic programming with applications to molecular biology
- Dynamic programming on linear pipelines
- On the synthesis of function inverses
- Applications of a strategy for designing divide-and-conquer algorithms
- Formal derivation of a pattern matching algorithm
- Efficient Parallel Algorithms for String Editing and Related Problems
- A Comprehensive Model of Dynamic Programming
- The Least Weight Subsequence Problem
- A common schema for dynamic programming and branch and bound algorithms
- Algebraic specification of data types: A synthetic approach
- Breaking paragraphs into lines
- The String-to-String Correction Problem
- Finite-State Processes and Dynamic Programming
- Automata in general algebras
This page was built for publication: Categories, relations and dynamic programming
