Pages that link to "Item:Q1312184"
From MaRDI portal
The following pages link to On the power of randomization in on-line algorithms (Q1312184):
Displaying 50 items.
- Online knapsack revisited (Q260271) (← links)
- Revisiting the COUNTER algorithms for list update (Q287261) (← links)
- Optimal randomized algorithm for a generalized ski-rental with interest rate (Q436599) (← links)
- The \(k\)-server problem (Q458484) (← links)
- Competitive analysis for online leasing problem with compound interest rate (Q638104) (← links)
- Competitive strategy for on-line leasing of depreciable equipment (Q646109) (← links)
- A combined BIT and TIMESTAMP algorithm for the list update problem (Q672254) (← links)
- Linear bounds for on-line Steiner problems (Q672394) (← links)
- Randomized competitive algorithms for online buffer management in the adaptive adversary model (Q719250) (← links)
- Randomized distributed online algorithms against adaptive offline adversaries (Q783703) (← links)
- Some further results on the maximal hitting times of trees with some given parameters (Q833005) (← 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)
- Two-stage security screening strategies in the face of strategic applicants, congestions and screening errors (Q1686491) (← 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)
- A universal randomized packet scheduling algorithm (Q2017873) (← links)
- Memoryless algorithms for the generalized k-server problem on uniform metrics (Q2117695) (← links)
- Online unit clustering and unit covering in higher dimensions (Q2134741) (← links)
- On the (reverse) cover cost of trees with some given parameters (Q2214070) (← links)
- Tight bounds for online coloring of basic graph classes (Q2223701) (← links)
- Distributed transactional memory for general networks (Q2256963) (← links)
- An adaptive probabilistic algorithm for online \(k\)-center clustering (Q2313750) (← links)
- Optimal on-off control for a class of discrete event systems with real-time constraints (Q2330044) (← links)
- Competitive strategies for an online generalized assignment problem with a service consecution constraint (Q2355803) (← links)
- Improved lower bounds for the online bin stretching problem (Q2399609) (← links)
- Improved analysis of the online set cover problem with advice (Q2402263) (← 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)
- Non-greedy online Steiner trees on outerplanar graphs (Q2659774) (← links)
- Dynamic Approximate All-Pairs Shortest Paths: Breaking the $O(mn)$ Barrier and Derandomization (Q2816298) (← links)
- A Survey of Algorithms and Models for List Update (Q2848979) (← 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)
- Randomized online multi-threaded paging (Q5054862) (← links)
- New on-line algorithms for the page replication problem (Q5056163) (← links)
- Page migration with limited local memory capacity (Q5057429) (← links)
