Competitive clustering of stochastic communication patterns on a ring
From MaRDI portal
Recommendations
Cites work
- A polylogarithmic approximation of the minimum bisection
- A Polylogarithmic Approximation of the Minimum Bisection
- A strongly competitive randomized paging algorithm
- An \(O(\log k)\)-competitive algorithm for generalized caching
- An optimal on-line algorithm for metrical task system
- An Optimal Search Problem
- Balanced graph partitioning
- Competitive k-server algorithms
- Competitive paging algorithms
- Guessing probability distributions from small samples
- scientific article; zbMATH DE number 432825 (Why is no real title available?)
- On page migration and other relaxed task systems
- On the online bin packing problem
- On-line bin packing in linear time
- Online balanced repartitioning
- Online companion caching
- Online file caching with rejection penalties
- Probability and Computing
This page was built for publication: Competitive clustering of stochastic communication patterns on a ring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2218479)