Cache efficient simple dynamic programming
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...
Main Authors: | Cary Cherng, Richard E. Ladner |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2005-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/3368/pdf |
Similar Items
-
Randomized Optimization: a Probabilistic Analysis
by: Jean Cardinal, et al.
Published: (2007-01-01) -
Convex hull for intersections of random lines
by: Daniel Berend, et al.
Published: (2005-01-01) -
HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm
by: Philippe Flajolet, et al.
Published: (2007-01-01) -
The Lyapunov tortoise and the dyadic hare
by: Benoît Daireaux, et al.
Published: (2005-01-01) -
Tail Bounds for the Wiener Index of Random Trees
by: Tämur Ali Khan, et al.
Published: (2007-01-01)