A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
presentation at the workshop, and revised versions of 7 papers appear in this special issue. All the contributions presented here were invited to this special issue, but went through the standard refereeing process of Theory of Computing Systems. In their contribution Online Dynamic Programming Speedups, Bar-Noy, Golin and Zhang consider dynamic programming in an online context where the problem size is not known in advance and the coefficients of the dynamic programming matrix are revealed rowdoi:10.1007/s00224-009-9189-3 fatcat:7h6j73dn6nfkdmqwslmo62bn74