Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Akutsu, T.: DP Algorithms for RNA Secondary Structure Prediction with Pseudoknots. In: Genome Informatics 1997. Universal Academy Press, Tokyo(1997) 173–179
2. Alon, N., Galil, Z., Margalit, O.: On the Exponent of the All Pairs Shortest Path Problem. In: Proc. 32nd IEEE Symp. Found. Comput. Sci. (1991) 569–575
3. Coppersmith, D., Winograd, S.: Matrix Multiplication via Arithmetic Progression. J. Symbolic Computation 9 (1990) 251–280
4. Eppstein, D., Galil, Z., Giancarlo, R., Italiano, G.F.: Sparse Dynamic Programming II: Convex and Concave Cost Functions. J. ACM 39 (1992) 546–567
5. Fredman, M.L.: New Bounds on the Complexity of the Shortest Path Problem. SIAM Journal on Computing 5 (1976) 83–89