From the theory to the tools: parallel dynamic programming
From MaRDI portal
DOI10.1002/(SICI)1096-9128(200001)12:1%3C21::AID-CPE452%3E3.0.CO;2-2zbMATH Open0949.68519OpenAlexW1970747836MaRDI QIDQ4487154FDOQ4487154
Authors: D. González, F. Almeida, J. L. Roda, C. Rodríguez 
Publication date: 21 June 2000
Full work available at URL: https://doi.org/10.1002/(sici)1096-9128(200001)12:1%3C21::aid-cpe452%3E3.0.co;2-2
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finite-State Processes and Dynamic Programming
- Branch-and-Bound Strategies for Dynamic Programming
- Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
- Title not available (Why is that?)
- Parallel algorithms for dynamic programming recurrences with more than \(O(1)\) dependency
- Experiments with parallel algorithms for combinatorial problems
- An improved parallel algorithm for 0/1 knapsack problem
- Dynamic programming on a shared-memory multiprocessor
- Mapping dynamic programming onto modular linear systolic arrays
- A PARALLEL ALGORITHM FOR THE INTEGER KNAPSACK PROBLEM FOR PIPELINE NETWORKS
- Title not available (Why is that?)
Cited In (6)
- Efficient massively parallel methods for dynamic programming
- Parallel dynamic programming and automata theory.
- Title not available (Why is that?)
- Nondeterministic dynamic programming on a parallel coprocessing system
- Lock-free parallel dynamic programming
- Parallel algorithms for dynamic programming recurrences with more than \(O(1)\) dependency
This page was built for publication: From the theory to the tools: parallel dynamic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4487154)
