The following pages link to (Q2934601):
Displaying 24 items.
- On list update with locality of reference (Q269460) (← links)
- On the absolute approximation ratio for first fit and related results (Q442205) (← links)
- A comparison of performance measures for online algorithms (Q494791) (← links)
- On the relative dominance of paging algorithms (Q837160) (← links)
- Online-bounded analysis (Q1617274) (← links)
- Evaluating the quality of online optimization algorithms by discrete event simulation (Q1642796) (← links)
- Adding isolated vertices makes some greedy online algorithms optimal (Q1647831) (← links)
- Quantifying competitiveness in paging with locality of reference (Q1799211) (← links)
- List factoring and relative worst order analysis (Q1950393) (← links)
- Parameterized analysis of paging and list update algorithms (Q2346961) (← links)
- A new variable-sized bin packing problem (Q2434283) (← links)
- A comparison of performance measures via online search (Q2445866) (← links)
- Relative interval analysis of paging algorithms on access graphs (Q2513607) (← links)
- A Survey of Algorithms and Models for List Update (Q2848979) (← links)
- Quantifying Competitiveness in Paging with Locality of Reference (Q3448771) (← links)
- (Q5090453) (← links)
- (Q5090507) (← links)
- On the Relative Dominance of Paging Algorithms (Q5387781) (← links)
- Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis (Q5452148) (← links)
- On Certain New Models for Paging with Locality of Reference (Q5452166) (← links)
- List Update with Locality of Reference (Q5458546) (← links)
- Online Bounded Analysis (Q5740182) (← links)
- (Q5743508) (← links)
- Best-of-both-worlds analysis of online search (Q6066770) (← links)
