Pages that link to "Item:Q1128665"
From MaRDI portal
The following pages link to A competitive analysis of the list update problem with lookahead (Q1128665):
Displaying 16 items.
- On the list update problem with advice (Q515679) (← links)
- Online computation with advice (Q541670) (← links)
- On the power of lookahead in online lot-sizing (Q614030) (← links)
- Scheduling resource allocation with timeslot penalty for changeover (Q861274) (← links)
- On the power of lookahead in on-line server routing problems (Q959800) (← links)
- On competitive on-line paging with lookahead (Q1276313) (← links)
- On lookahead in the list update problem (Q1322123) (← links)
- Exact distributional analysis of online algorithms with lookahead (Q2044551) (← links)
- How much is it worth to know the future in online conversion problems? (Q2446338) (← links)
- Topology matters: smoothed competitiveness of metrical task systems (Q2566010) (← links)
- A Survey of Algorithms and Models for List Update (Q2848979) (← links)
- Ignorant vs. Anonymous Recommendations (Q3452859) (← links)
- An optimal algorithm for 2-bounded delay buffer management with lookahead (Q5925532) (← links)
- On competitive recommendations (Q5964063) (← links)
- Self-adjusting grid networks (Q6044463) (← links)
- Self-adjusting linear networks (Q6536343) (← links)