![]() | ![]() |
2007 | ||
---|---|---|
6 | EE | Sung Eun Bae, Tadao Takaoka: A Sub-cubic Time Algorithm for the k -Maximum Subarray Problem. ISAAC 2007: 751-762 |
5 | EE | Sung Eun Bae, Tadao Takaoka: Algorithms for k-Disjoint Maximum Subarrays. Int. J. Found. Comput. Sci. 18(2): 319-339 (2007) |
2006 | ||
4 | EE | Sung Eun Bae, Tadao Takaoka: Algorithm for K Disjoint Maximum Subarrays. International Conference on Computational Science (1) 2006: 595-602 |
3 | EE | Sung Eun Bae, Tadao Takaoka: Improved Algorithms for the K-Maximum Subarray Problem. Comput. J. 49(3): 358-374 (2006) |
2005 | ||
2 | EE | Sung Eun Bae, Tadao Takaoka: Improved Algorithms for the K-Maximum Subarray Problem for Small K. COCOON 2005: 621-631 |
2004 | ||
1 | EE | Sung Eun Bae, Tadao Takaoka: Algorithms for the Problem of K Maximum Sums and a VLSI Algorithm for the K Maximum Subarrays Problem. ISPAN 2004: 247-253 |
1 | Tadao Takaoka | [1] [2] [3] [4] [5] [6] |