The following pages link to (Q4886073):
Displaying 12 items.
- Optimal strategies for the list update problem under the MRM alternative cost model (Q437676) (← links)
- A combined BIT and TIMESTAMP algorithm for the list update problem (Q672254) (← links)
- A lower bound for randomized list update algorithms (Q685486) (← links)
- A new family of randomized algorithms for list accessing (Q826088) (← links)
- A competitive analysis of the list update problem with lookahead (Q1128665) (← links)
- Off-line algorithms for the list update problem (Q1350929) (← links)
- Paid exchanges are worth the price (Q2182321) (← links)
- Second step algorithms in the Burrows-Wheeler compression algorithm (Q2783312) (← links)
- A Survey of Algorithms and Models for List Update (Q2848979) (← links)
- Improved Randomized On-Line Algorithms for the List Update Problem (Q4388893) (← links)
- Improvements to Burrows-Wheeler compression algorithm (Q4791703) (← links)
- A new lower bound for the list update problem in the partial cost model (Q5958711) (← links)
