The following pages link to Susanne Albers (Q187111):
Displaying 50 items.
- Page replacement for general caching problems (Q4252268) (← links)
- (Q4252368) (← links)
- Better Bounds for Online Scheduling (Q4268892) (← links)
- Improved Randomized On-Line Algorithms for the List Update Problem (Q4388893) (← links)
- (Q4449210) (← links)
- (Q4471273) (← links)
- Average-case analyses of first fit and random fit bin packing (Q4487093) (← links)
- (Q4527009) (← links)
- (Q4527046) (← links)
- (Q4542564) (← links)
- (Q4553434) (← links)
- The Price of Uncertainty in Present-Biased Planning (Q4614080) (← links)
- (Q4763434) (← links)
- (Q4785464) (← links)
- (Q4796164) (← links)
- (Q4818862) (← links)
- (Q4886073) (← links)
- Online Algorithms (Q4928703) (← links)
- (Q4937214) (← links)
- (Q4941838) (← links)
- Exploring Unknown Environments (Q4943862) (← links)
- Energy-efficient algorithms for flow time minimization (Q4962689) (← links)
- New on-line algorithms for the page replication problem (Q5056163) (← links)
- Page migration with limited local memory capacity (Q5057429) (← links)
- Best Fit Bin Packing with Random Order Revisited (Q5089165) (← links)
- A Competitive analysis of the list update problem with lookahead (Q5096877) (← links)
- On the Value of Penalties in Time-Inconsistent Planning (Q5111339) (← links)
- Tight Bounds for Online Coloring of Basic Graph Classes (Q5111690) (← links)
- Recent Advances for a Classical Scheduling Problem (Q5327418) (← links)
- New Online Algorithms for Story Scheduling in Web Advertising (Q5327454) (← links)
- Energy-Efficient Algorithms for Flow Time Minimization (Q5449836) (← links)
- An experimental study of online scheduling algorithms (Q5463426) (← links)
- On the Performance of Greedy Algorithms in Packet Buffering (Q5470691) (← links)
- Dynamic TCP Acknowledgment: Penalizing Long Delays (Q5470802) (← links)
- Minimizing stall time in single and parallel disk systems (Q5487880) (← links)
- Race to idle (Q5501963) (← links)
- (Q5743475) (← links)
- New Bounds for Randomized List Update in the Paid Exchange Model. (Q5874283) (← links)
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model (Q5875474) (← links)
- (Q5875579) (← links)
- Algorithms and Data Structures (Q5900751) (← links)
- On paging with locality of reference (Q5901047) (← links)
- On paging with locality of reference (Q5916194) (← links)
- Algorithms for energy conservation in heterogeneous data centers (Q5925533) (← links)
- Algorithms for energy conservation in heterogeneous data centers (Q5925673) (← links)
- Scheduling with unexpected machine breakdowns (Q5936454) (← links)
- Exploring unknown environments with obstacles (Q5956837) (← links)
- New results on web caching with request reordering (Q5961978) (← links)
- Optimal Algorithms for Online b-Matching with Variable Vertex Capacities (Q6070372) (← links)
- Machine covering in the random-order model (Q6103518) (← links)
