{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T05:16:03Z","timestamp":1740287763243,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241317"},{"type":"electronic","value":"9783540305514"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_14","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:15:37Z","timestamp":1279044937000},"page":"137-148","source":"Crossref","is-referenced-by-count":12,"title":["Efficient Algorithms for k Maximum Sums"],"prefix":"10.1007","author":[{"given":"Fredrik","family":"Bengtsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingsen","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","volume-title":"Data Structures and Algorithm Analysis","author":"M. Weiss","year":"1995","unstructured":"Weiss, M.: Data Structures and Algorithm Analysis, 2nd edn. Addison-Wesley, Reading (1995)","edition":"2"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1145\/358234.381162","volume":"27","author":"J. Bentley","year":"1985","unstructured":"Bentley, J.: Programming pearls: Algorithm design techniques. Communications of the ACM\u00a027, 865\u2013871 (1985)","journal-title":"Communications of the ACM"},{"key":"14_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-9354-2","volume-title":"Pattern Analysis","author":"U. Grenander","year":"1978","unstructured":"Grenander, U.: Pattern Analysis. Springer-Verlag, New York (1978)"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, pp. 207\u2013216 (1993)","DOI":"10.1145\/170035.170072"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Fukuda, T., Morimoto, Y., Morishita, S., Tokuyama, T.: Data mining using two-dimensional optimized association rules: Scheme, algorithms, and visualization. In: Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, pp. 13\u201323 (1996)","DOI":"10.1145\/233269.233313"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1145\/1968.381154","volume":"27","author":"J. Bentley","year":"1985","unstructured":"Bentley, J.: Programming pearls: Perspective on performance. Communications of the ACM\u00a027, 1087\u20131092 (1985)","journal-title":"Communications of the ACM"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0167-6423(83)90015-1","volume":"2","author":"D. Gries","year":"1982","unstructured":"Gries, D.: A note on the standard strategy for developing loop invariants and loops. Science of Computer Programming\u00a02, 207\u2013214 (1982)","journal-title":"Science of Computer Programming"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/0167-6423(87)90034-7","volume":"8","author":"D. Smith","year":"1987","unstructured":"Smith, D.: Applications of a strategy for designing divide-and-conquer algorithms. Science of Computer Programming\u00a08, 213\u2013229 (1987)","journal-title":"Science of Computer Programming"},{"key":"14_CR9","unstructured":"Tamaki, H., Tokuyama, T.: Algorithms for the maximum subarray problem based on matrix multiplication. In: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 446\u2013452 (1998)"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Takaoka, T.: Efficient algorithms for the maximum subarray problem by distance matrix multiplication. In: Proceedings of the 2002 Australian Theory Symposium, pp. 189\u2013198 (2002)","DOI":"10.1016\/S1571-0661(04)00313-5"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1142\/S0129053391000140","volume":"3","author":"S. Akl","year":"1991","unstructured":"Akl, S., Guenther, G.: Application of broadcasting with selective reduction to the maximal sum subsegment problem. International Journal of High Speed Computing\u00a03, 107\u2013119 (1991)","journal-title":"International Journal of High Speed Computing"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1142\/S0129626495000345","volume":"5","author":"K. Perumalla","year":"1995","unstructured":"Perumalla, K., Deo, N.: Parallel algorithms for maximum subsequence and maximum subarray. Parallel Processing Letters\u00a05, 367\u2013373 (1995)","journal-title":"Parallel Processing Letters"},{"key":"14_CR13","unstructured":"Qiu, K., Akl, S.: Parallel maximum sum algorithms on interconnection networks. Technical Report No. 99-431, Jodrey School of Computer Science, Acadia University, Canada (1999)"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Bae, S.E., Takaoka, T.: 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, pp. 247\u2013253 (2004)","DOI":"10.1109\/ISPAN.2004.1300488"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0022-0000(82)90048-4","volume":"24","author":"G. Frederickson","year":"1982","unstructured":"Frederickson, G., Johnson, D.: The complexity of selection and ranking in X\u2009+\u2009Y and matrices with sorted columns. Journal of Computer and System Sciences\u00a024, 197\u2013208 (1982)","journal-title":"Journal of Computer and System Sciences"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1137\/0213002","volume":"13","author":"G. Frederickson","year":"1984","unstructured":"Frederickson, G., Johnson, D.: Generalized selection and ranking: Sorted matrices. SIAM Journal on Computing\u00a013, 14\u201330 (1984)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR17","series-title":"LNCS","first-page":"159","volume-title":"International Conference on Database Theory","author":"M. Riedewald","year":"2001","unstructured":"Riedewald, M., Agrawal, D., Abbadi, A.E.: Flexible data cubes for online aggregation. In: International Conference on Database Theory. LNCS, pp. 159\u2013173. Springer, Heidelberg (2001)"},{"key":"14_CR18","unstructured":"Bengtsson, F., Chen, J.: Computing the k maximum subarrays fast. Technical Report No. 2004:07, Lule\u00e5 University of Technology, Lule\u00e5, Sweden (2004)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30551-4_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T21:52:12Z","timestamp":1740261132000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}