Fast parallel algorithms for the maximum sum problem

Finding the maximum subsequence sum on interconnection networks

International Journal of Parallel, Emergent and Distributed Systems

Improved algorithms for the K-maximum subarray problem for small K

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics

A BSP/CGM algorithm for finding all maximal contiguous subsequences of a sequence of numbers

Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing

Calculational developments of new parallel algorithms for size-constrained maximum-sum segment problems

FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming