Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication

Tadao Takaoka. Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication. Electronic Notes in Theoretical Computer Science, 61:191-200, 2002. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: