author: | Cary Cherng and Richard E. Ladner |
---|---|
title: | Cache efficient simple dynamic programming |
keywords: | Dynamic Programming, Cache-Oblivious Algorithms, Cache-Aware Algorithms |
abstract: | New cache-oblivious and cache-aware algorithms for simple dynamic programming based on Valiant's context-free language recognition algorithm are designed, implemented, analyzed, and empirically evaluated with timing studies and cache simulations. The studies show that for large inputs the cache-oblivious and cache-aware dynamic programming algorithms are significantly faster than the standard dynamic programming algorithm. |
If your browser does not display the abstract correctly (because of the different mathematical symbols) you may look it up in the PostScript or PDF files. | |
reference: | Cary Cherng and Richard E. Ladner (2005), Cache efficient simple dynamic programming, in 2005 International Conference on Analysis of Algorithms, Conrado Martínez (ed.), Discrete Mathematics and Theoretical Computer Science Proceedings AD, pp. 49-58 |
bibtex: | For a corresponding BibTeX entry, please consider our BibTeX-file. |
ps.gz-source: | dmAD0106.ps.gz (83 K) |
ps-source: | dmAD0106.ps (235 K) |
pdf-source: | dmAD0106.pdf (112 K) |
The first source gives you the `gzipped' PostScript, the second the plain PostScript and the third the format for the Adobe accrobat reader. Depending on the installation of your web browser, at least one of these should (after some amount of time) pop up a window for you that shows the full article. If this is not the case, you should contact your system administrator to install your browser correctly.
Due to limitations of your local software, the two formats may show up differently on your screen. If eg you use xpdf to visualize pdf, some of the graphics in the file may not come across. On the other hand, pdf has a capacity of giving links to sections, bibliography and external references that will not appear with PostScript.