Computation of matrix chain products. Part II

A new lower bound technique and its application: tight lower bound for a polygon triangulation problem

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms

Dynamic Programming via Static Incrementalization

Higher-Order and Symbolic Computation

Processor Allocation and Task Scheduling of Matrix Chain Products on Parallel Systems

IEEE Transactions on Parallel and Distributed Systems

Fast sparse matrix multiplication

ACM Transactions on Algorithms (TALG)

Analysis of Parallel Algorithms for Matrix Chain Product and Matrix Powers on Distributed Memory Systems

IEEE Transactions on Parallel and Distributed Systems

Overlaying multiple maps efficiently

CIT'04 Proceedings of the 7th international conference on Intelligent Information Technology

An Optimal Balanced Partitioning of a Set of 1D Intervals

International Journal of Artificial Life Research