Pages that link to "Item:Q1178243"
From MaRDI portal
The following pages link to Two results on the list update problem (Q1178243):
Displaying 32 items.
- On list update with locality of reference (Q269460) (← links)
- Revisiting the COUNTER algorithms for list update (Q287261) (← links)
- List update with probabilistic locality of reference (Q436596) (← links)
- On the list update problem with advice (Q515679) (← links)
- On the separation and equivalence of paging strategies and other online algorithms (Q666671) (← links)
- A combined BIT and TIMESTAMP algorithm for the list update problem (Q672254) (← links)
- A lower bound for randomized list update algorithms (Q685486) (← links)
- Randomized distributed online algorithms against adaptive offline adversaries (Q783703) (← links)
- A competitive analysis of the list update problem with lookahead (Q1128665) (← links)
- The weighted list update problem and the lazy adversary (Q1208728) (← links)
- The list update problem: Improved bounds for the counter scheme (Q1277389) (← links)
- Randomized competitive algorithms for the list update problem (Q1312185) (← links)
- On lookahead in the list update problem (Q1322123) (← links)
- The list update problem and the retrieval of sets (Q1331955) (← links)
- A parallel list update problem (Q1339372) (← links)
- Off-line algorithms for the list update problem (Q1350929) (← links)
- On the competitiveness of the move-to-front rule (Q1575556) (← links)
- On list update and work function algorithms. (Q1853486) (← links)
- New results for online page replication (Q1887086) (← links)
- List factoring and relative worst order analysis (Q1950393) (← links)
- Paid exchanges are worth the price (Q2182321) (← links)
- Can Burrows-Wheeler transform be replaced in chain code compression? (Q2663576) (← links)
- A Survey of Algorithms and Models for List Update (Q2848979) (← links)
- Paid exchanges are worth the price (Q2955029) (← links)
- A Randomized Algorithm for Online Scheduling with Interval Conflicts (Q3460709) (← links)
- Competitive Algorithms for Relaxed List Update and Multilevel Caching (Q4943079) (← links)
- The list update problem and the retrieval of sets (Q5056139) (← links)
- List Update with Locality of Reference (Q5458546) (← links)
- On the competitive theory and practice of online list accessing algorithms (Q5957574) (← links)
- A new lower bound for the list update problem in the partial cost model (Q5958711) (← links)
- Relative Worst-Order Analysis: A Survey (Q6163627) (← links)
- Online computation with untrusted advice (Q6564618) (← links)
