Pages that link to "Item:Q685486"

The following pages link to A lower bound for randomized list update algorithms (Q685486):

Displaying 19 items.

• A combined BIT and TIMESTAMP algorithm for the list update problem (Q672254) (← 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 competitive algorithms for the list update problem (Q1312185) (← links)
• The list update problem and the retrieval of sets (Q1331955) (← 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 list update and work function algorithms. (Q1853486) (← links)
• List factoring and relative worst order analysis (Q1950393) (← links)
• Equilibria in online games (Q2796211) (← links)
• A Survey of Algorithms and Models for List Update (Q2848979) (← links)
• Improved Randomized On-Line Algorithms for the List Update Problem (Q4388893) (← links)
• (Q4886073) (← links)
• A new lower bound for the list update problem in the partial cost model (Q5958711) (← links)
• Self-adjusting grid networks (Q6044463) (← links)
• Relative Worst-Order Analysis: A Survey (Q6163627) (← links)
• Self-adjusting linear networks (Q6536343) (← links)