Pages that link to "Item:Q960500"
From MaRDI portal
The following pages link to Competitive algorithms for distributed data management. (Q960500):
Displaying 23 items.
- An algorithm for dynamic data allocation in distributed systems (Q673824) (← links)
- A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem (Q727979) (← links)
- Budget constrained minimum cost connected medians (Q876728) (← links)
- Optimal algorithms for page migration in dynamic networks (Q1044046) (← links)
- Competitive distributed file allocation. (Q1427858) (← links)
- Uniform page migration problem in Euclidean space (Q1736826) (← links)
- New results for online page replication (Q1887086) (← links)
- On-line generalized Steiner problem (Q1887091) (← links)
- Distributed transactional memory for metric-space networks (Q1954240) (← links)
- A \(3 + \Omega (1)\) lower bound for page migration (Q2196608) (← links)
- Asymptotically optimal online page migration on three points (Q2350908) (← links)
- Terminal embeddings (Q2405893) (← links)
- On the competitive ratio for online facility location (Q2471804) (← links)
- Non-greedy online Steiner trees on outerplanar graphs (Q2659774) (← links)
- Equilibria in Online Games (Q2796211) (← links)
- Non-greedy Online Steiner Trees on Outerplanar Graphs (Q2971163) (← links)
- Performing Dynamically Injected Tasks on Processes Prone to Crashes and Restarts (Q3095325) (← links)
- Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks (Q4578010) (← links)
- The Performance of greedy algorithms for the on-line steiner tree and related problems (Q4850333) (← links)
- Low-diameter graph decomposition is in NC (Q5056131) (← links)
- New on-line algorithms for the page replication problem (Q5056163) (← links)
- Page migration with limited local memory capacity (Q5057429) (← links)
- Dynamic Balanced Graph Partitioning (Q5130579) (← links)
