The following pages link to Susanne Albers (Q187111):
Displaying 50 items.
- (Q232406) (redirect page) (← links)
- On list update with locality of reference (Q269460) (← links)
- Revisiting the COUNTER algorithms for list update (Q287261) (← links)
- Semi-online scheduling revisited (Q442235) (← links)
- Speed scaling on parallel processors (Q476431) (← links)
- A combined BIT and TIMESTAMP algorithm for the list update problem (Q672254) (← links)
- Scheduling with testing on multiple identical parallel machines (Q832831) (← links)
- Online makespan minimization with budgeted uncertainty (Q832833) (← links)
- A study of integrated document and connection caching in the WWW (Q878433) (← links)
- An experimental study of new and known online packet buffering algorithms (Q973006) (← links)
- A competitive analysis of the list update problem with lookahead (Q1128665) (← links)
- The complexity of one-machine batching problems (Q1315991) (← links)
- On the influence of lookahead in competitive paging algorithms (Q1361407) (← links)
- Improved parallel integer sorting without concurrent writing (Q1362905) (← links)
- Average case analyses of list update algorithms, with applications to data compression (Q1393071) (← links)
- Online algorithms: a survey (Q1403281) (← links)
- Randomized splay trees: Theoretical and experimental results. (Q1603506) (← links)
- Scheduling on power-heterogeneous processors (Q1680505) (← links)
- New online algorithms for story scheduling in web advertising (Q1755774) (← links)
- Integrated prefetching and caching in single and parallel disk systems (Q1775887) (← links)
- Quantifying competitiveness in paging with locality of reference (Q1799211) (← links)
- On generalized connection caching (Q1849753) (← links)
- Delayed information and action in on-line algorithms (Q1854463) (← links)
- Ronald Graham: laying the foundations of online optimization (Q1946024) (← links)
- Scheduling In the random-order model (Q1979454) (← links)
- Best fit bin packing with random order revisited (Q1979457) (← links)
- Motivating time-inconsistent agents: a computational approach (Q1999999) (← links)
- Improved online algorithms for Knapsack and GAP in the random order model (Q2032350) (← links)
- Explorable uncertainty in scheduling with non-uniform testing times (Q2117694) (← links)
- Tight bounds for online coloring of basic graph classes (Q2223701) (← links)
- On multi-processor speed scaling with migration (Q2353399) (← links)
- Online makespan minimization with parallel schedules (Q2362356) (← links)
- On the value of job migration in online makespan minimization (Q2408930) (← links)
- New results for the \(k\)-secretary problem (Q2658048) (← links)
- Scheduling on Power-Heterogeneous Processors (Q2802926) (← links)
- On Approximate Nash Equilibria in Network Design (Q2808835) (← links)
- Motivating Time-Inconsistent Agents: A Computational Approach (Q2959838) (← links)
- (Q3113668) (← links)
- Quantifying Competitiveness in Paging with Locality of Reference (Q3448771) (← links)
- On List Update with Locality of Reference (Q3521911) (← links)
- An Experimental Study of New and Known Online Packet Buffering Algorithms (Q3527264) (← links)
- Algorithms for Energy Management (Q3569726) (← links)
- On randomized online scheduling (Q3579202) (← links)
- (Q3579477) (← links)
- On the performance of greedy algorithms in packet buffering (Q3580957) (← links)
- On nash equilibria for a network creation game (Q3581526) (← links)
- Resource Management in Large Networks (Q3637319) (← links)
- On the Value of Coordination in Network Design (Q3654377) (← links)
- New On-Line Algorithms for the Page Replication Problem (Q4209275) (← links)
- (Q4250194) (← links)
