Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Entropy-based bounds for online algorithms

From MaRDI portal
Publication:2944543
Jump to:navigation, search

DOI10.1145/1186810.1186817zbMath1321.68517OpenAlexW2073523085MaRDI QIDQ2944543

Eli Upfal, Gopal Pandurangan

Publication date: 2 September 2015

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1186810.1186817


zbMATH Keywords

entropystochastic processonline algorithmsprefetchingcachingperformance boundslist accessing


Mathematics Subject Classification ID

Analysis of algorithms (68W40) Measures of information, entropy (94A17) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Online algorithms; streaming algorithms (68W27)







This page was built for publication: Entropy-based bounds for online algorithms

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2944543&oldid=15929068"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 20:15.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki