Pages that link to "Item:Q1312185"

The following pages link to Randomized competitive algorithms for the list update problem (Q1312185):

Displaying 39 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 new family of randomized algorithms for list accessing (Q826088) (← links)
• A competitive analysis of the list update problem with lookahead (Q1128665) (← links)
• Two results on the list update problem (Q1178243) (← links)
• The weighted list update problem and the lazy adversary (Q1208728) (← links)
• Randomized online interval scheduling (Q1273096) (← links)
• A parallel list update problem (Q1339372) (← links)
• Off-line algorithms for the list update problem (Q1350929) (← links)
• Average case analyses of list update algorithms, with applications to data compression (Q1393071) (← links)
• On the competitiveness of the move-to-front rule (Q1575556) (← links)
• A manifesto for the computational method (Q1603721) (← links)
• Randomized competitive analysis for two server problems (Q1662430) (← links)
• Comparison-based buffer management in QoS switches (Q1742380) (← links)
• Delayed information and action in on-line algorithms (Q1854463) (← links)
• List factoring and relative worst order analysis (Q1950393) (← links)
• Paid exchanges are worth the price (Q2182321) (← links)
• Parameterized analysis of paging and list update algorithms (Q2346961) (← links)
• A Survey of Algorithms and Models for List Update (Q2848979) (← links)
• Advice Complexity and Barely Random Algorithms (Q3075527) (← links)
• A Randomized Algorithm for Online Scheduling with Interval Conflicts (Q3460709) (← links)
• Randomized Competitive Analysis for Two-Server Problems (Q3541083) (← links)
• Improved Randomized On-Line Algorithms for the List Update Problem (Q4388893) (← links)
• (Q4886073) (← links)
• The list update problem and the retrieval of sets (Q5056139) (← links)
• Advice Complexity and Barely Random Algorithms (Q5198936) (← links)
• Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis (Q5452148) (← links)
• List Update with Locality of Reference (Q5458546) (← links)
• Semi-online scheduling with decreasing job sizes (Q5929138) (← links)
• A new lower bound for the list update problem in the partial cost model (Q5958711) (← links)
• An optimal online algorithm for scheduling two machines with release times (Q5958718) (← links)
• Self-adjusting grid networks (Q6044463) (← links)
• Self-adjusting linear networks (Q6536343) (← links)