Efficient massively parallel methods for dynamic programming
From MaRDI portal
Publication:4978024
Recommendations
Cited in
(11)- Streaming and query once space complexity of longest increasing subsequence
- Scalable Parallel DFPN Search
- Equivalence classes and conditional hardness in massively parallel computations
- Feature-based methods for large scale dynamic programming
- Algorithmic aspects of parallel data processing
- Brief announcement: MapReduce algorithms for massive trees
- Parallel Solution of Sparse One-Dimensional Dynamic Programming Problems
- \(D\&C\) method for solving large problems in fixed size processor array
- scientific article; zbMATH DE number 7561507 (Why is no real title available?)
- A computational framework based on the dynamic pipeline approach
- A Scalable Approximation Algorithm for Weighted Longest Common Subsequence
This page was built for publication: Efficient massively parallel methods for dynamic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4978024)