Pages that link to "Item:Q1328093"
From MaRDI portal
The following pages link to Parallel algorithms for dynamic programming recurrences with more than \(O(1)\) dependency (Q1328093):
Displaying 6 items.
- An efficient parallel algorithm for scheduling interval ordered tasks (Q652455) (← links)
- An optimal sublinear time parallel algorithm for some dynamic programming problems (Q1336746) (← links)
- An algorithm for the sequence alignment with gap penalty problem using multiway divide-and-conquer and matrix transposition (Q2234794) (← links)
- From the theory to the tools: parallel dynamic programming (Q4487154) (← links)
- An optimal parallel algorithm for computing a near-optimal order of matrix multiplications (Q5056129) (← links)
- On a sublinear time parallel construction of optimal binary search trees (Q5096904) (← links)
