Pages that link to "Item:Q1109691"
From MaRDI portal
The following pages link to On efficient parallel computations for some dynamic programming problems (Q1109691):
Displaying 10 items.
- Parallel algorithms for a class of graphs generated recursively (Q582922) (← links)
- Parallel tree-contraction and Fibonacci numbers (Q671622) (← links)
- A sublinear parallel algorithm for some dynamic programming problems (Q1202931) (← links)
- An optimal sublinear time parallel algorithm for some dynamic programming problems (Q1336746) (← links)
- Finding least-weight subsequences with fewer processors (Q2366242) (← links)
- Systolic algorithms for the dynamic programming problem (Q3989775) (← links)
- Categories, relations and dynamic programming (Q4286530) (← links)
- An optimal parallel algorithm for computing a near-optimal order of matrix multiplications (Q5056129) (← links)
- Parallel recognition and ranking of context-free languages (Q5096817) (← links)
- On a sublinear time parallel construction of optimal binary search trees (Q5096904) (← links)
