Pages that link to "Item:Q1312184"
From MaRDI portal
The following pages link to On the power of randomization in on-line algorithms (Q1312184):
Displayed 28 items.
- A combined BIT and TIMESTAMP algorithm for the list update problem (Q672254) (← links)
- Linear bounds for on-line Steiner problems (Q672394) (← links)
- On multi-threaded metrical task systems (Q849631) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- Randomized priority algorithms (Q974749) (← links)
- Randomized algorithm for the \(k\)-server problem on decomposable spaces (Q1044025) (← links)
- Randomized algorithms for metrical task systems (Q1127546) (← links)
- A competitive analysis of the list update problem with lookahead (Q1128665) (← links)
- On convex body chasing (Q1207798) (← links)
- Randomized online interval scheduling (Q1273096) (← links)
- Competitive randomized algorithms for nonuniform problems (Q1329146) (← links)
- MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling (Q1330422) (← links)
- Competitive algorithms for the weighted server problem (Q1331957) (← links)
- Competitive distributed file allocation. (Q1427858) (← links)
- On the competitiveness of the move-to-front rule (Q1575556) (← links)
- On randomization in on-line computation. (Q1854274) (← links)
- A general decomposition theorem for the \(k\)-server problem (Q1854527) (← links)
- The weighted 2-server problem (Q1887090) (← links)
- On the on-line rent-or-buy problem in probabilistic environments (Q2460108) (← links)
- Ramsey-type theorems for metric spaces with applications to online problems (Q2496321) (← links)
- Randomized Algorithms for Buffer Management with 2-Bounded Delay (Q3602832) (← links)
- Resource Management in Large Networks (Q3637319) (← links)
- Competitive Algorithms for Layered Graph Traversal (Q4210157) (← links)
- Dynamic location problems with limited look-ahead (Q5941730) (← links)
- A new lower bound for the list update problem in the partial cost model (Q5958711) (← links)
- On page migration and other relaxed task systems (Q5958713) (← links)
- Online algorithms for page replication in rings (Q5958716) (← links)
- On the Bahncard problem (Q5958720) (← links)