Pages that link to "Item:Q1350929"

The following pages link to Off-line algorithms for the list update problem (Q1350929):

Displaying 21 items.

• Revisiting the COUNTER algorithms for list update (Q287261) (← links)
• List update with probabilistic locality of reference (Q436596) (← links)
• Optimal strategies for the list update problem under the MRM alternative cost model (Q437676) (← links)
• On the list update problem with advice (Q515679) (← links)
• A combined BIT and TIMESTAMP algorithm for the list update problem (Q672254) (← links)
• A lower bound for randomized list update algorithms (Q685486) (← links)
• The weighted list update problem and the lazy adversary (Q1208728) (← links)
• Randomized competitive algorithms for the list update problem (Q1312185) (← links)
• The list update problem and the retrieval of sets (Q1331955) (← links)
• Average case analyses of list update algorithms, with applications to data compression (Q1393071) (← links)
• On list update and work function algorithms. (Q1853486) (← 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)
• Online and Offline Access to Short Lists (Q3525612) (← 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)
• A new lower bound for the list update problem in the partial cost model (Q5958711) (← links)
• Self-adjusting grid networks (Q6044463) (← links)
• Self-adjusting linear networks (Q6536343) (← links)