Pages that link to "Item:Q3991015"
From MaRDI portal
The following pages link to APPLICATION OF BROADCASTING WITH SELECTIVE REDUCTION TO THE MAXIMAL SUM SUBSEGMENT PROBLEM (Q3991015):
Displayed 8 items.
- ANSV problem on BSRs (Q293212) (← links)
- Solving the shortest-paths problem on bipartite permutation graphs efficiently (Q672656) (← links)
- Randomized algorithm for the sum selection problem (Q884471) (← links)
- Ranking \(k\) maximum sums (Q884477) (← links)
- Constant time BSR solutions to \(L_ 1\) metric and digital geometry problems (Q1898084) (← links)
- Efficient algorithms for the sum selection problem and \(k\) maximum sums problem (Q2268857) (← links)
- Two parallel algorithms for finding all minimal maximum subsequences (Q2424687) (← links)
- Finding the maximum subsequence sum on interconnection networks (Q5421615) (← links)