{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T16:10:09Z","timestamp":1736007009235,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280613"},{"type":"electronic","value":"9783540318064"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533719_63","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:34:13Z","timestamp":1127828053000},"page":"621-631","source":"Crossref","is-referenced-by-count":8,"title":["Improved Algorithms for the K-Maximum Subarray Problem for Small K"],"prefix":"10.1007","author":[{"given":"Sung E.","family":"Bae","sequence":"first","affiliation":[]},{"given":"Tadao","family":"Takaoka","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"63_CR1","unstructured":"Bae, S.E., Takaoka, T.: Parallel approaches to the maximum subarray problem. In: Japan-Korea Workshop on Al. and Comp., pp. 94\u2013104 (2003)"},{"key":"63_CR2","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: ISPAN 2004, pp. 247\u2013253 (2004)","DOI":"10.1109\/ISPAN.2004.1300488"},{"key":"63_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-540-30551-4_14","volume-title":"Algorithms and Computation","author":"F. Bengtsson","year":"2004","unstructured":"Bengtsson, F., Chen, J.: Efficient algorithms for the k maximum sums. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 137\u2013148. Springer, Heidelberg (2004)"},{"issue":"9","key":"63_CR4","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1145\/358234.381162","volume":"27","author":"J. Bentley","year":"1984","unstructured":"Bentley, J.: Programming pearls: algorithm design techniques. Commun. ACM\u00a027(9), 865\u2013873 (1984)","journal-title":"Commun. ACM"},{"issue":"11","key":"63_CR5","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1145\/1968.381154","volume":"27","author":"J. Bentley","year":"1984","unstructured":"Bentley, J.: Programming pearls: perspective on performance. Commun. ACM\u00a027(11), 1087\u20131092 (1984)","journal-title":"Commun. ACM"},{"key":"63_CR6","unstructured":"Brodal, G.S.: Finger search trees with constant insertion time. In: SODA, pp. 540\u2013549 (1998)"},{"issue":"3","key":"63_CR7","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1137\/0209045","volume":"9","author":"M.R. Brown","year":"1980","unstructured":"Brown, M.R., Tarjan, R.E.: The design and analysis of a data structure for representing sorted lists. SIAM Jour. on Comp.\u00a09(3), 594\u2013614 (1980)","journal-title":"SIAM Jour. on Comp."},{"key":"63_CR8","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-540-30219-3_6","volume-title":"Algorithms in Bioinformatics","author":"M. Cs\u00fcr\u00f6s","year":"2004","unstructured":"Cs\u00fcr\u00f6s, M.: Algorithms for finding maxima-scoring segment sets. In: Jonassen, I., Kim, J. (eds.) WABI 2004. LNCS (LNBI), vol.\u00a03240, pp. 62\u201373. Springer, Heidelberg (2004)"},{"issue":"3","key":"63_CR9","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0020-0190(94)00115-4","volume":"52","author":"P.F. Dietz","year":"1994","unstructured":"Dietz, P.F., Raman, R.: A constant update time finger search tree. Inf. Process. Lett.\u00a052(3), 147\u2013154 (1994)","journal-title":"Inf. Process. Lett."},{"key":"63_CR10","volume-title":"Algorithms Sequential & Parallel- A Unified Approach","author":"R. Miller","year":"2000","unstructured":"Miller, R., Boxer, L.: Algorithms Sequential & Parallel- A Unified Approach. Prentice-Hall, Englewood Cliffs (2000)"},{"issue":"3","key":"63_CR11","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 Process. Lett.\u00a05(3), 367\u2013373 (1995)","journal-title":"Parallel Process. Lett."},{"key":"63_CR12","unstructured":"Qui, K., Akl, S.G.: Parallel maximum sum algorithms on intercommenction networks. Queen\u2019s Uni. Dept. of Com. and Info. Sci. Technical Report 99-431 (1999)"},{"key":"63_CR13","unstructured":"Ruzzo, W.L., Tompa, M.: A linear time algorithm for finding all maximal scoring subsequences. In: Intelligent Sys. in Molecular Biology, pp. 234\u2013241 (1999)"},{"issue":"4","key":"63_CR14","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0020-0190(92)90200-F","volume":"43","author":"T. Takaoka","year":"1992","unstructured":"Takaoka, T.: A new upper bound on the complexity of the all pairs shortest paths problem. Inf. Process. Lett.\u00a043(4), 195\u2013199 (1992)","journal-title":"Inf. Process. Lett."},{"key":"63_CR15","series-title":"Elec. Notes in Theoretical Computer Sci.","volume-title":"Efficient algorithms for the maximum subarray problem by distance matrix multiplication","author":"T. Takaoka","year":"2002","unstructured":"Takaoka, T.: Efficient algorithms for the maximum subarray problem by distance matrix multiplication. Elec. Notes in Theoretical Computer Sci., vol.\u00a061. Elsevier, Amsterdam (2002)"},{"key":"63_CR16","series-title":"Lecture Notes in Artificial Intelligence","first-page":"278","volume-title":"Advances in Case-Based Reasoning","author":"T. Takaoka","year":"2006","unstructured":"Takaoka, T.: A faster algorithm for the all-pairs shortest path problem and its application. In: Roth-Berghofer, T.R., G\u00f6ker, M.H., G\u00fcvenir, H.A. (eds.) ECCBR 2006. LNCS (LNAI), vol.\u00a04106, pp. 278\u2013289. Springer, Heidelberg (2006)"},{"key":"63_CR17","unstructured":"Tamaki, H., Tokuyama, T.: Algorithms for the maximum subarray problem based on matrix multiplication. In: SODA, pp. 446\u2013452 (1998)"},{"issue":"3","key":"63_CR18","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1016\/0167-8191(94)00063-G","volume":"21","author":"Z. Wen","year":"1995","unstructured":"Wen, Z.: Fast parallel algorithms for the maximum sum problem. Parallel Computing\u00a021(3), 461\u2013466 (1995)","journal-title":"Parallel Computing"},{"key":"63_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1007\/978-3-540-30551-4_78","volume-title":"Algorithms and Computation","author":"U. Zwick","year":"2004","unstructured":"Zwick, U.: A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 921\u2013932. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533719_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T15:38:14Z","timestamp":1736005094000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533719_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11533719_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}