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]

@article{Takaoka02,
  title = {Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication},
  author = {Tadao Takaoka},
  year = {2002},
  url = {http://www.elsevier.com/gej-ng/31/29/23/95/27/show/Products/notes/index.htt#014},
  researchr = {https://researchr.org/publication/Takaoka02},
  cites = {0},
  citedby = {0},
  journal = {Electronic Notes in Theoretical Computer Science},
  volume = {61},
  pages = {191-200},
}