Journal of the ACM Bibliography
David Eppstein, Zvi Galil, Faffaele Giancarlo, and Giuseppe F. Italiano.
Sparse dynamic programming II: Convex and concave cost functions.
Journal of the ACM, 39(3):546-567, July 1992.
[BibTeX entry]
Selected papers that cite this one
- A. Aggarwal, D. Kravets, J. K. Park, and S. Sen. Parallel
searching in generalized Monge arrays. Algorithmica,
19(3):291-317, November 1997.
- David Eppstein, Zvi Galil, Faffaele Giancarlo, and Giuseppe F. Italiano.
Sparse dynamic
programming I: Linear cost functions. Journal of the
ACM, 39(3):519-545, July 1992.
- Jeanette P. Schmidt. All highest scoring
paths in weighted grid graphs and their application to finding all
approximate repeats in strings. SIAM Journal on
Computing, 27(4):972-992, August 1998.
Selected references
- Alok Aggarwal and James Park. Notes on searching in
multidimensional monotone arrays (preliminary version). In
29th Annual Symposium on Foundations of Computer Science,
pages 497-512, White Plains, New York, 24-26 October 1988. IEEE.
- David Eppstein, Zvi Galil, and Raffaele Giancarlo. Speeding up dynamic
programming. In 29th Annual Symposium on Foundations of
Computer Science, pages 488-496, White Plains, New York, 24-26
October 1988. IEEE.
- David Eppstein, Zvi Galil, Faffaele Giancarlo, and Giuseppe F. Italiano.
Sparse dynamic
programming I: Linear cost functions. Journal of the
ACM, 39(3):519-545, July 1992.
- F. Frances Yao. Efficient dynamic programming
using quadrangle inequalities. In Conference Proceedings of
the Twelfth Annual ACM Symposium on Theory of Computing, pages
429-435, Los Angeles, California, 28-30 April 1980.
Shortcuts: