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

Uniform multipaging reduces to paging

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

DOI10.1016/S0020-0190(98)00080-5zbMath1339.68043OpenAlexW2051902145MaRDI QIDQ293296

Vincenzo Liberatore

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098000805?np=y


zbMATH Keywords

competitive analysisonline algorithmspaging


Mathematics Subject Classification ID

Randomized algorithms (68W20) Theory of operating systems (68N25) Online algorithms; streaming algorithms (68W27)


Related Items (1)

Flexible resource allocation to interval jobs



Cites Work

  • Unnamed Item
  • A strongly competitive randomized paging algorithm
  • Competitive snoopy caching
  • Paging more than one page
  • Competitive algorithms for server problems
  • Competitive paging algorithms




This page was built for publication: Uniform multipaging reduces to paging

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