1. R. Agrawal, T. Imielinski, A. Swami, Mining association rules between sets of items in large databases, in: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, 1993, pp. 207–216
2. Application of broadcasting with selective reduction to the maximal sum subsegment problem;Akl;International Journal of High Speed Computing,1991
3. S.E. Bae, T. Takaoka, Algorithms for the problem of k maximum sums and a VLSI algorithm for the k maximum subarrays problem, in: Proceedings of the 7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004, pp. 247–253
4. Improved algorithms for the k-maximum subarray problem for small k;Bae,2005
5. F. Bengtsson, J. Chen, A note on ranking k maximum sums. Research report, Luleå University of Technology, June 2005. http://epubl.ltu.se/1402-1528/2005/08/