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

Connection caching: Model and algorithms.

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

DOI10.1016/S0022-0000(03)00041-2zbMath1055.68018MaRDI QIDQ1401982

Edith Cohen, Uri Zwick, Haim Kaplan

Publication date: 19 August 2003

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)


zbMATH Keywords

Competitive analysisOnline algorithmsConnection cachingCache replacementMarking algorithms


Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12)


Related Items

Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • A strongly competitive randomized paging algorithm
  • Competitive snoopy caching
  • Connection caching
  • New Ressults on Server Problems
  • Competitive paging algorithms
  • Competitive analysis of randomized paging algorithms
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1401982&oldid=13561757"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 17:01.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki