scientific article; zbMATH DE number 5257110

MaRDI QIDQ5453693zbMATH OpenFDO

Authors Akira Matsubayashi

Publication date 3 April 2008

zbMATH Keywords

online algorithmdata management

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Mathematical Foundations of Computer Science 2005
• Optimal algorithms for page migration in dynamic networks
• Distributed Paging for General Networks
• scientific article; zbMATH DE number 873153
• Uniform page migration problem in Euclidean space
• scientific article; zbMATH DE number 65703
• Page Migration Algorithms Using Work Functions
• Asymptotically optimal online page migration on three points
• Asymptotically optimal online page migration on three points

Cited in

(7)

• Optimal algorithms for page migration in dynamic networks
• On page migration and other relaxed task systems
• Page Migration Algorithms Using Work Functions
• Mathematical Foundations of Computer Science 2005
• A \(3 + \Omega (1)\) lower bound for page migration
• Asymptotically optimal online page migration on three points
• Uniform page migration problem in Euclidean space

This page was built for publication:

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