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 22 items.
- Parallel algorithms for a class of graphs generated recursively (Q582922) (← links)
- Lock-free parallel dynamic programming (Q666192) (← links)
- Parallel tree-contraction and Fibonacci numbers (Q671622) (← links)
- A class of problems efficiently solvable on mesh-connected computers including dynamic expression evaluation (Q1123611) (← links)
- A sublinear parallel algorithm for some dynamic programming problems (Q1202931) (← links)
- Dynamic programming on a shared-memory multiprocessor (Q1208498) (← links)
- Parallel algorithms for dynamic programming recurrences with more than \(O(1)\) dependency (Q1328093) (← links)
- Dependency structure analysis as combinatorial optimization (Q1328543) (← links)
- An optimal sublinear time parallel algorithm for some dynamic programming problems (Q1336746) (← links)
- Parallel algorithms for the circuit value update problem (Q1384691) (← links)
- On efficient parallel computations of costs of paths on a grid graph (Q1824395) (← links)
- Nondeterministic dynamic programming on a parallel coprocessing system (Q1854977) (← links)
- Finding least-weight subsequences with fewer processors (Q2366242) (← links)
- \(D\&C\) method for solving large problems in fixed size processor array (Q2751940) (← links)
- Intelligent computing systems with actors -- parallel dynamic programming algorithm of the polygon triangulation problem (Q2784637) (← links)
- Systolic algorithms for the dynamic programming problem (Q3989775) (← links)
- Parallel Solution of Sparse One-Dimensional Dynamic Programming Problems (Q4029057) (← links)
- On Efficient Parallel Algorithms for Solving Set Recurrence Equations (Q4033767) (← 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)
