1. Bae SE, Takaoka T (2004) 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, Hong Kong, pp 247–253
2. Bentley J (1986) Programming pearls. Addison-Wesley, Reading
3. Burton BA (2011) Searching a bitstream in linear time for the longest substring of any given density. Algorithmica 61:555–579
4. Burton BA, Hiron M (2013) Locating regions in a sequence under density constraints. SIAM J Comput 42:1201–1215
5. Chen K-Y, Chao K-M (2004) On the range maximum-sum segment query problem. In: Proceedings of the 15th international symposium on algorithms and computation, Hong Kong. LNCS, vol 3341, pp 294–305