Can entropy characterize performance of online algorithms?

MaRDI QIDQ2768373zbMATH OpenFDO

Authors Gopal Pandurangan, Eli Upfal

Publication date 24 March 2002

zbMATH Keywords

compressionentropygambling

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Entropy-based bounds for online algorithms
• On Entropic Convergence of Algorithms
• Information complexity of online problems
• A new measure for the study of on-line algorithms
• On Complexity Issues of Online Learning Algorithms
• Comparing deterministic, robust and online scheduling using entropy
• On the power of randomness versus advice in online computation
• The Generalization Ability of Online Algorithms for Dependent Data

Cited in

(3)

• Entropy-based bounds for online algorithms
• Entropy representation of memory access characteristics and cache performance
• A universal online caching algorithm based on pattern matching

This page was built for publication: Can entropy characterize performance of online algorithms?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768373)