Competitive algorithms for distributed data management.
From MaRDI portal
(Redirected from Publication:960500)
Recommendations
Cited in
(29)- On the competitive ratio for online facility location
- On-line generalized Steiner problem
- Competitive distributed file allocation.
- scientific article; zbMATH DE number 2006643 (Why is no real title available?)
- Uniform page migration problem in Euclidean space
- scientific article; zbMATH DE number 2007899 (Why is no real title available?)
- Performing dynamically injected tasks on processes prone to crashes and restarts
- A \(3 + \Omega (1)\) lower bound for page migration
- Low-diameter graph decomposition is in NC
- Non-greedy online Steiner trees on outerplanar graphs
- Asymptotically optimal online page migration on three points
- A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem
- Budget constrained minimum cost connected medians
- Terminal embeddings
- Non-greedy online Steiner trees on outerplanar graphs
- Distributed transactional memory for metric-space networks
- Optimal aggregation algorithms for middleware.
- Online algorithms for page replication in rings
- Optimal algorithms for page migration in dynamic networks
- New on-line algorithms for the page replication problem
- Page migration with limited local memory capacity
- The Performance of greedy algorithms for the on-line steiner tree and related problems
- Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks
- Equilibria in online games
- New results for online page replication
- Dynamic balanced graph partitioning
- On page migration and other relaxed task systems
- Approximation algorithms for data management in networks
- An algorithm for dynamic data allocation in distributed systems
This page was built for publication: Competitive algorithms for distributed data management.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q960500)