Pages that link to "Item:Q4978024"
From MaRDI portal
The following pages link to Efficient massively parallel methods for dynamic programming (Q4978024):
Displaying 11 items.
- Feature-based methods for large scale dynamic programming (Q1911341) (← links)
- Equivalence classes and conditional hardness in massively parallel computations (Q2121067) (← links)
- \(D\&C\) method for solving large problems in fixed size processor array (Q2751940) (← links)
- Scalable Parallel DFPN Search (Q2947916) (← links)
- Parallel Solution of Sparse One-Dimensional Dynamic Programming Problems (Q4029057) (← links)
- Algorithmic Aspects of Parallel Data Processing (Q4639877) (← links)
- Brief Announcement: MapReduce Algorithms for Massive Trees (Q5002852) (← links)
- (Q5091162) (← links)
- A Scalable Approximation Algorithm for Weighted Longest Common Subsequence (Q6487194) (← links)
- A computational framework based on the dynamic pipeline approach (Q6561340) (← links)
- Streaming and query once space complexity of longest increasing subsequence (Q6591455) (← links)