Cache efficient simple dynamic programming

  • Cherng C
  • Ladner R
N/ACitations
Citations of this article
6Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Cherng, C., & Ladner, R. E. (2005). Cache efficient simple dynamic programming. Discrete Mathematics & Theoretical Computer Science, DMTCS Proceedings vol. AD,...(Proceedings). https://doi.org/10.46298/dmtcs.3368

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free