Nonlinear paging

DOI10.4230/LIPICS.ICALP.2024.57MaRDI QIDQ6875143zbMATH OpenFDO

Authors Ilan Doron-Arad, Joseph (Seffi) Naor

Publication date 14 January 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2024.57

zbMATH Keywords

competitive analysisnonlinear pagingpagingsubmodular and supermodular functions

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• A primal-dual randomized algorithm for weighted paging
• An \(O(\log k)\)-competitive algorithm for generalized caching
• An analysis of the greedy algorithm for the submodular set covering problem
• Competitive paging algorithms
• Dynamic partitioning of shared cache memory
• Efficient algorithms for dualizing large-scale hypergraphs
• scientific article; zbMATH DE number 3316542 (Why is no real title available?)
• Hypergraph with sampling for image retrieval
• On the Desirability of Acyclic Database Schemes
• On the hardness of approximating minimization problems
• On-line file caching
• Randomized competitive algorithms for generalized caching
• The online set cover problem
• The Online Submodular Cover Problem
• Visual-Textual Joint Relevance Learning for Tag-Based Social Image Search

This page was built for publication: Nonlinear paging

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