APPLICATION OF BROADCASTING WITH SELECTIVE REDUCTION TO THE MAXIMAL SUM SUBSEGMENT PROBLEM

DOI10.1142/S0129053391000140zbMath0741.68043MaRDI QIDQ3991015

Selim G. Akl, G. R. Guenther

Publication date: 28 June 1992

Published in: International Journal of High Speed Computing (Search for Journal in Brave)

zbMATH Keywords

parallel models of computationBroadcasting with Selective Reductionmaximal sum subsegments

Mathematics Subject Classification ID

Related Items

ANSV problem on BSRs ⋮ Constant time BSR solutions to \(L_ 1\) metric and digital geometry problems ⋮ Randomized algorithm for the sum selection problem ⋮ Ranking \(k\) maximum sums ⋮ Two parallel algorithms for finding all minimal maximum subsequences ⋮ Solving the shortest-paths problem on bipartite permutation graphs efficiently ⋮ Finding the maximum subsequence sum on interconnection networks ⋮ Efficient algorithms for the sum selection problem and \(k\) maximum sums problem