MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Speeding up Dynamic Programming (1988) [15 citations — 0 self]

by David Eppstein ,  Zvi Galil ,  Raffaele Giancarlo
In Proc. 29th Symp. Foundations of Computer Science
Add To MetaCart

Abstract:

this paper we consider the problem of computing two similar recurrences: the one-dimensional case

Citations

2010 The Design and Analysis of Computer Algorithms – Aho, Hopcroft, et al. - 1974
503 The Art of Computer Programming, Volume 3: Sorting and Searching – Knuth - 1998
91 Geometric applications of a matrixsearching algorithm, Algorithmica 2 – Aggarwal, Klawe, et al. - 1987
83 Decomposable searching problems I: static-to-dynamic transformation – Bentley, Saxe - 1980
78 Optimum binary search trees – Knuth - 1971
51 EW: Sequence comparison with concave weighting functions – Miller, Myers - 1988
40 Speeding up dynamic programming with applications to molecular biology – Galil, Giancarlo - 1989
33 The concave least-weight subsequence problem revisited – Wilber - 1988
27 The least weight subsequence problem – Hirschberg, Larmore - 1987
24 Speed-up in dynamic programming – Yao - 1982
14 Spaces of RNA secondary structures – Penner, Waterman - 1993
10 A Linear space algorithm for Computing – Hirschberg - 1975
10 Rapid dynamic programming algorithms for RNA Secondary structure – Waterman, Smith - 1986
8 Fast Algorithms to Determine RNA Secondary Structures Containing Multiple Loops – Sankoff, Kruskal, et al. - 1983
6 General Methods of Sequence – Waterman - 1984
2 Speeding Up Dynamic Programming, manuscript – Klawe
2 Emde Boas, Preserving Order in a Forest – van - 1977
View or Download | Add to My Collection | Correct Errors