Algorithms for the Problem of K Maximum Sums and a VLSI Algorithm for the K Maximum Subarrays Problem

Sung Eun Bae, Tadao Takaoka. Algorithms for the Problem of K Maximum Sums and a VLSI Algorithm for the K Maximum Subarrays Problem. In 7th International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN 2004), 10-12 May 2004, Hong Kong, SAR, China. pages 247-253, IEEE Computer Society, 2004. [doi]

@inproceedings{BaeT04,
  title = {Algorithms for the Problem of K Maximum Sums and a VLSI Algorithm for the K Maximum Subarrays Problem},
  author = {Sung Eun Bae and Tadao Takaoka},
  year = {2004},
  url = {http://csdl.computer.org/comp/proceedings/ispan/2004/2135/00/21350247abs.htm},
  researchr = {https://researchr.org/publication/BaeT04},
  cites = {0},
  citedby = {0},
  pages = {247-253},
  booktitle = {7th International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN 2004), 10-12 May 2004, Hong Kong, SAR, China},
  publisher = {IEEE Computer Society},
  isbn = {0-7695-2135-5},
}