Pages that link to "Item:Q673936"
From MaRDI portal
The following pages link to Fast parallel algorithms for the maximum sum problem (Q673936):
Displaying 12 items.
- A parallel cost-optimal algorithm to compute the supremum of max-min powers (Q1195163) (← links)
- Fast algorithms for the maximum convolution problem (Q1332943) (← links)
- Efficient algorithms for the maximum sum problems (Q1662587) (← links)
- Applications of a strategy for designing divide-and-conquer algorithms (Q1821558) (← links)
- Two parallel algorithms for finding all minimal maximum subsequences (Q2424687) (← links)
- Algorithms for the maximum subarray problem based on matrix multiplication (Q2725500) (← links)
- (Q2944023) (← links)
- A Fast Parallel Horner Algorithm (Q3474278) (← links)
- (Q3774941) (← links)
- APPLICATION OF BROADCASTING WITH SELECTIVE REDUCTION TO THE MAXIMAL SUM SUBSEGMENT PROBLEM (Q3991015) (← links)
- Finding the maximum subsequence sum on interconnection networks (Q5421615) (← links)
- Algorithms and Computation (Q5712105) (← links)