Efficient algorithms for the maximum subarray problem by distance matrix multiplication

Electronic Notes in Theoretical Computer Science

Volumn 61, Issue , 2002, Pages 191-200

  Takaoka, Tadao ^a  

^a UNIVERSITY OF CANTERBURY   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARRAYS; CORRELATION METHODS; GRAPHIC METHODS; PROBABILITY; QUEUEING THEORY; RANDOM PROCESSES; TWO DIMENSIONAL;

DISTANCE MATRIX MULTIPLICATION; N-DIMENSIONAL MATRICES; REAL NUMBERS; TWO-DIMENSIONAL ARRAYS;

MATRIX ALGEBRA;

EID: 3543081802     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00313-5     Document Type: Conference Paper

References (10)

1. Agrawal, R. T. Imielinski, and A. Swami, Mining Association Rules between Sets of Items in Large Databases, Proc. SIGMOD Conf. on Management of Data (1993) 207-216
2. Alon, N, Z. Galil, and O. Margalit, On the exponent of the all pairs shortest path problem, Proc. 32nd FOCS (1991) 569-575
3. Bentley J. Programming Pearls - Algorithm Design Techniques. Comm. ACM. 1984;27-29. 865-871
4. Bentley J. Programming Pearls - Perspective on Performance. Comm. ACM. 27:1984;1087-1092
5. Feller W. An Introduction to Probability Theory and its Applications. Volume 1:1950;John Wiley and Sons
6. Fukuda T., Y. Morimoto, S. Morishita, and T. Tokuyama, Data Mining Using Two-Dimensional Optimized Association rules: Scheme, Algorithms and Visualization, Proc. SIGMOD Conf. on Management of Data (1996) 13-23
7. 2logn) expected time. SIAM Jour. Computing. 16:1987;1023-1031
8. Takaoka T., A New Upper Bound on the complexity of the all pairs shortest path problem, Info. Proc. Lett., 43 (1992) 195-199
9. Takaoka T. Subcubic cost algorithms for the all pairs shortest path problem. Algorithmica. 20:1998;309-318
10. Tamaki H. and T. Tokuyama, Algorithms for the Maximum Subarray Problem Based on Matrix Multiplication, Proceedings of the 9th SODA (Symposium on Discrete Algorithms) (1998) 446-452