Yanhong A. Liu, Scott D. Stoller  Home/Search
Context Related
| sunysb.edu/pub/liu...DynProgHOSC.ps.gz Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: sunysb.edu/~liu/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Dynamic programming is an important algorithm design technique. It is used for problems whose solutions involve recursively solving subproblems that share subsubproblems. While a straightforward recursive program solves common subsubproblems repeatedly, a dynamic programming algorithm solves every subsubproblem just once, saves the result, and reuses it when the subsubproblem is encountered again. This can reduce the time complexity from exponential to polynomial. This paper describes a... (Update)
Similar documents based on text: More All
3.9: Dynamic Programming via Static Incrementalization - Liu, Stoller (2002) (Correct)
0.6: Optimizing Ackermann's Function by Incrementalization - Liu, Stoller (2001) (Correct)
0.4: Program Optimization Using Indexed and Recursive Data Structures - Liu, Stoller (2002) (Correct)
BibTeX entry: (Update)
Y. A. Liu and S. D. Stoller. Dynamic programming via static incrementalization. In Proceedings of the 8th European Symposium on Programming, Lecture Notes in Computer Science. Springer-Verlag, Berlin, Mar. 1999. http://citeseer.ist.psu.edu/article/liu00dynamic.html More
@inproceedings{ liu99dynamic,
author = "Yanhong A. Liu and Scott D. Stoller",
title = "Dynamic Programming via Static Incrementalization",
booktitle = "European Symposium on Programming",
pages = "288-305",
year = "1999",
url = "citeseer.ist.psu.edu/article/liu00dynamic.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
408 Princeton University Press (context) - Bellman - 1957
385 A transformation system for developing recursive programs - Burstall, Darlington - 1977
245 The Omega Test: A fast and practical integer programming alg.. - Pugh - 1992
204 KIDS: A semiautomatic program development system - Smith - 1990
171 The Synthesizer Generator: A System for Constructing Languag.. (context) - Reps, Teitelbaum - 1988
81 The promotion and accumulation strategies in transformationa.. (context) - Bird - 1984
68 Incremental computation via function caching (context) - Pugh, Teitelbaum - 1989
64 Tabulation techniques for recursive programs (context) - Bird - 1980
59 Lazy memo-functions (context) - Hughes - 1985
57 Systematic derivation of incremental programs - Liu, Teitelbaum - 1995
54 Rules and strategies for transforming functional and logic p.. - Pettorossi, Proietti - 1996
49 Automatic complexity analysis (context) - Rosendahl - 1989
48 Mechanical program analysis (context) - Wegbreit - 1975
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.sunysb.edu/~liu/): More
Optimizing Ackermann's function by incrementalization - Liu, Stoller (2000) (Correct)
Strengthening Invariants for Efficient Computation - Liu, Stoller, Teitelbaum (2001) (Correct)
Eliminating Dead Code on Recursive Data - Liu, Stoller (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC