A. Aggarwal, M. M. Klawe, S. Moran, P. Shor, and R. Wilber, Geometric applications of a matrix-searching algorithm, Algorithmica, vol.9, issue.1-4, pp.195-208, 1987.
DOI : 10.1007/BF01840359

R. E. Bellman, Dynamic Programming, 1957.

M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran, Cache-oblivious algorithms, 40th Annual Symposium on Foundations of Computer Science (FOCS '99), pp.285-298, 1999.

S. S. Godbole, On Efficient Computation of Matrix Chain Products, IEEE Transactions on Computers, vol.22, issue.9, pp.22864-866, 1973.
DOI : 10.1109/TC.1973.5009182

T. Kasami, An efficient recognition and syntax algorithm for context-free languages

D. E. Knuth, Optimum binary search trees, Acta Informatica, vol.6, issue.1, pp.14-25, 1971.
DOI : 10.1007/BF00264289

P. Kumar, Cache Oblivious Algorithms, Algorithms for Memory Hierarchies: Advanced Lectures, pp.193-212, 2003.
DOI : 10.1007/3-540-36574-5_9

Y. Muraoka and D. J. Kuck, On the time required for a sequence of matrix products, Communications of the ACM, vol.16, issue.1, pp.22-26, 1973.
DOI : 10.1145/361932.361938

J. Seward and N. Nethercote, Valgrind (debugging and profiling tool for x86-linux programs)

V. Strassen, Gaussian elimination is not optimal, Numerische Mathematik, vol.13, issue.4, pp.357-361, 1969.
DOI : 10.1007/BF02165411

URL : http://www.digizeitschriften.de/download/PPN362160546_0013/PPN362160546_0013___log38.pdf

L. G. Valiant, General context-free recognition in less than cubic time, Journal of Computer and System Sciences, vol.10, issue.2, pp.308-315, 1975.
DOI : 10.1016/S0022-0000(75)80046-8

F. F. Yao, Efficient dynamic programming using quadrangle inequalities, Proceedings of the twelfth annual ACM symposium on Theory of computing , STOC '80, pp.429-435, 1982.
DOI : 10.1145/800141.804691

D. H. Younger, Recognition and parsing of context-free languages in time n3, Information and Control, vol.10, issue.2, pp.189-208, 1967.
DOI : 10.1016/S0019-9958(67)80007-X

Z. Galil, Z. , and K. Park, Dynamic programming with convexity, concavity and sparsity, Theoretical Computer Science, vol.92, issue.1, pp.49-76, 1992.
DOI : 10.1016/0304-3975(92)90135-3