Susanne Albers

Q: What Schools Are Affiliated With Susanne Albers

Susanne Albers is affiliated with the following schools: Saarland University, Humboldt University of Berlin, University of Freiburg, Technical University of Dortmund, Technical University of Munich

Susanne Albers's AcademicInfluence.com Rankings

Susanne Albers

Computer Science

#1023

World Rank

#1060

Historical Rank

Theoretical Computer Science

#31

World Rank

#31

Historical Rank

Database

#8018

World Rank

#8355

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Susanne Albers Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Susanne Albers is a German theoretical computer scientist and professor of computer science at the Department of Informatics of the Technical University of Munich. She is a recipient of the Otto Hahn Medal and the Leibniz Prize.

(See a Problem?)

Susanne Albers's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Exploring unknown environments (1997) (284)
Online algorithms: a survey (2003) (272)
Better bounds for online scheduling (1997) (236)
Energy-efficient algorithms (2010) (231)
Energy-efficient algorithms for flow time minimization (2006) (227)
The Complexity of One-Machine Batching Problems (1993) (152)
Speed Scaling on Parallel Processors (2007) (151)
On nash equilibria for a network creation game (2014) (142)
Improved parallel integer sorting without concurrent writing (1992) (111)
Exploring Unknown Environments with Obstacles (1999) (104)
Page replacement for general caching problems (1999) (100)
Improved randomized on-line algorithms for the list update problem (1995) (95)
Race to idle: New algorithms for speed scaling with a sleep state (2012) (95)
Algorithms – ESA 2004 (2004) (90)
On paging with locality of reference (2002) (85)
A Combined BIT and TIMESTAMP Algorithm for the List Update Problem (1995) (77)
On-line algorithms (1999) (74)
On the performance of greedy algorithms in packet buffering (2004) (74)
On the value of coordination in network design (2008) (74)
Self-Organizing Data Structures (1996) (71)
On the Influence of Lookahead in Competitive Paging Algorithms (1997) (69)
Average-case analyses of first fit and random fit bin packing (2000) (61)
On randomized online scheduling (2002) (61)
Minimizing stall time in single and parallel disk systems (1998) (60)
Semi-online scheduling revisited (2012) (58)
Scheduling with unexpected machine breakdowns (1999) (58)
Algorithms for Dynamic Speed Scaling (2011) (57)
Average Case Analyses of List Update Algorithms, with Applications to Data Compression (1996) (56)
Competitive Online Algorithms (1996) (48)
A Competitive Analysis of the List Update Problem with Lookahead (1994) (43)
On multi-processor speed scaling with migration: extended abstract (2011) (41)
Online Makespan Minimization with Parallel Schedules (2013) (39)
On multi-processor speed scaling with migration (2015) (39)
Randomized splay trees: Theoretical and experimental results (2002) (36)
Algorithms for Energy Saving (2009) (34)
Integrated prefetching and caching in single and parallel disk systems (2003) (33)
On Nash Equilibria for a Network Creation Game (2006) (32)
New On-Line Algorithms for the Page Replication Problem (1994) (30)
On list update with locality of reference (2008) (29)
Delayed information and action in on-line algorithms (1998) (28)
An experimental study of online scheduling algorithms (2000) (25)
Improved Online Algorithms for Knapsack and GAP in the Random Order Model (2020) (23)
Dynamic TCP acknowledgement: penalizing long delays (2003) (23)
An Experimental Study of New and Known Online Packet Buffering Algorithms (2007) (22)
New Results on Web Caching with Request Reordering (2004) (21)
On the Value of Job Migration in Online Makespan Minimization (2011) (20)
Generating Shorter Bases for Hard Random Lattices (2018) (19)
Motivating Time-Inconsistent Agents: A Computational Approach (2016) (17)
Page Migration with Limited Local Memory Capacity (1995) (17)
Efficient Algorithms, Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday (2009) (17)
Optimal Algorithms for Right-Sizing Data Centers (2018) (17)
On the Value of Penalties in Time-Inconsistent Planning (2017) (15)
Explorable Uncertainty in Scheduling with Non-Uniform Testing Times (2020) (15)
On Energy Conservation in Data Centers (2017) (14)
The Influence of Lookahead in Competitive Paging Algorithms (Extended Abstract) (1993) (14)
Generalized connection caching (2000) (13)
On Approximate Nash Equilibria in Network Design (2010) (13)
Scheduling on power-heterogeneous processors (2016) (11)
New Results for the k-Secretary Problem (2020) (11)
Recent Advances for a Classical Scheduling Problem (2013) (11)
The Price of Uncertainty in Present-Biased Planning (2017) (10)
Best Fit Bin Packing with Random Order Revisited (2020) (8)
Revisiting the Counter Algorithms for List Update (1997) (8)
A survey of self-organizing data structures (1996) (8)
Invited Lecture: Online Algorithms: A Study of Graph-Theoretic Concepts (1999) (7)
Tight Bounds for Online Coloring of Basic Graph Classes (2017) (7)
Implicit enumeration algorithms for the Set-Partitioning Problem (1980) (7)
New Online Algorithms for Story Scheduling in Web Advertising (2013) (7)
Scheduling in the Random-Order Model (2020) (6)
New Bounds for Randomized List Update in the Paid Exchange Model (2020) (5)
05031 Summary-- Algorithms for Optimization with Incomplete Information (2005) (5)
The influence of lookahead in competitive on-line algorithms (1992) (5)
On Generalized Connection Caching (2002) (5)
Optimal Algorithms for Online b-Matching with Variable Vertex Capacities (2021) (4)
Scheduling (Dagstuhl Seminar 13111) (2013) (4)
Preface: Special Issue on Theoretical Aspects of Computer Science (STACS) (2011) (4)
Scheduling with Testing on Multiple Identical Parallel Machines (2021) (3)
Algorithms for Energy Management (2010) (3)
Optimal Algorithms for Right-Sizing Data Centers - Extended Version (2018) (3)
Algorithmic Economics und Operations Research (2017) (2)
Energy-Efficient Scheduling (2022) (2)
Algorithms for Energy Conservation in Heterogeneous Data Centers (2021) (2)
Resource Management in Large Networks (2009) (2)
26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings (2009) (2)
Integrated Prefetching and Caching with Read and Write Requests (2003) (2)
Online Algorithms - What Is It Worth to Know the Future? (2011) (2)
Algorithms for Right-Sizing Heterogeneous Data Centers (2021) (2)
Scheduling in the Secretary Model (2021) (2)
On Energy Conservation in Data Centers (2019) (2)
List Update Posets (1996) (2)
Tight Bounds for Online Matching in Bounded-Degree Graphs with Vertex Capacities (2022) (2)
Quantifying Competitiveness in Paging with Locality of Reference (2015) (2)
04091 Abstracts Collection -- Data Structures (2004) (1)
Minimization of Weighted Completion Times in Path-based Coflow Scheduling (2019) (1)
Algorithms--ESA 2004 : 12th annual European symposium, Bergen, Norway, September 14-17, 2004 : proceedings (2004) (1)
Online Computation in Large Networks (2007) (1)
Algorithms for Optimization with Incomplete Information, 16.-21. January 2005 (2005) (1)
Machine Covering in the Random-Order Model (2021) (1)
A Study of Integrated Document and Connection Caching (2003) (1)
Motivating Time-Inconsistent Agents: A Computational Approach (2018) (1)
Speed Scaling on Parallel Processors (2012) (0)
The Fifth Dagstuhl Seminar on Data Structures (2008) (0)
Optimal Algorithms for Right-sizing Data Centers (2022) (0)
08081 Abstracts Collection Data Structures Dagstuhl Seminar (2005) (0)
Online Makespan Minimization with Parallel Schedules (2016) (0)
Recent Results for Online Makespan Minimization (2013) (0)
List of participants (1988) (0)
05031 Abstracts Collection - Algorithms for Optimization with Incomplete Information (2005) (0)
Abstracts Collection 25 th International Symposium on Theoretical Aspects of Computer Science ( STACS 2008 ) (2004) (0)
Chapter 1 Online Scheduling (2012) (0)
Laying the Foundations of Online Optimization (2012) (0)
10071 Executive Summary - Scheduling (2010) (0)
An experimental study of on-line scheduling algorithms (2002) (0)
Data Structures (Dagstuhl Seminar 00091) (2021) (0)
Tight Bounds for Online Coloring of Basic Graph Classes (2020) (0)
Recent Results for Online Makespan Minimization ( Extended Abstract ) (0)
STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings (2008) (0)
Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II (2009) (0)
A Study of Integrated Document and Connection Caching in the WWW (2007) (0)
10071 Abstracts Collection Scheduling Dagstuhl Seminar (2010) (0)
Ju l 2 01 8 Optimal Algorithms for RightSizing Data Centers — Extended Version ∗ (0)
Modeling Real-World Data Sets (Invited Talk) (2015) (0)
On-line Algorithms 3 List of Participants (2008) (0)
Sorting and Selection with Imprecise Comparisons (2012) (0)
Direct-mapped Constrained Migration Problem (1994) (0)
Session details: Parallel and distributed scheduling (2008) (0)
Automata, languages and programming : 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009 : proceedings (2009) (0)
Session details: Cache hierarchies and memory sharing (2011) (0)
On the List Update Problem (2002) (0)
Online Ad Allocation in Bounded-Degree Graphs (2022) (0)
STACS 2008 Foreword (2010) (0)
Some Algorithmic Problems in Large Networks (2001) (0)
Tight Bound on the Competitive Ratio for the Page Replication Problem (1994) (0)
Online List Update (2008) (0)
Ronald Graham : Laying the Foundations of Online Optimization (2012) (0)
Abstracts Collection - 25th International Symposium on Theoretical Aspects of Computer Science (2008) (0)
Preface - 25th International Symposium on Theoretical Aspects of Computer Science (2008) (0)
Online Scheduling (2008) (0)
Session details: SESSION 4 (2017) (0)
Integrated Prefet hing and Ca hingwith (2009) (0)
Online Makespan Minimization with Budgeted Uncertainty (2021) (0)
Executive Summary (2006) (0)
On the Value of Job Migration in Online Makespan Minimization (2016) (0)
Data Structures, 22.-27. February 2004 (2005) (0)
Preface (2011) (0)
Modeling Real-World Data Sets (2015) (0)
Profinite Methods in Automata Theory (2017) (0)
Qualitative Concurrent Stochastic Games with Imperfect Information ⋆ (2019) (0)
New Online Algorithms for Story Scheduling in Web Advertising (2018) (0)
Online Algorithms : A Study of Graph-Theoretic ConceptsSusanne (2009) (0)
SYNONYMS: None is reported. (2007) (0)
Editorial (2014) (0)
10071 Abstracts Collection - Scheduling (2010) (0)
Energy-Efficient Algorithms (Invited Talk) (2011) (0)
Equations defining the polynomial closure of a lattice of regular languages (2018) (0)
Online Algorithms (Dagstuhl Seminar 02271) (2021) (0)
Preface - 26th International Symposium on Theoretical Aspects of Computer Science (2009) (0)
A Study of Integrated Do umentand Conne tion Ca hing ? (2009) (0)
Scheduling (Report from Dagstuhl Seminar 13111, March 10-15, 2013) (2013) (0)
Quantifying Competitiveness in Paging with Locality of Reference (2018) (0)
A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints (2017) (0)

This paper list is powered by the following services:

Other Resources About Susanne Albers

en.wikipedia.org

What Schools Are Affiliated With Susanne Albers?

Susanne Albers is affiliated with the following schools:

Susanne Albers's Academic­Influence.com Rankings

Why Is Susanne Albers Influential?

Susanne Albers's Published Works

Published Works

Other Resources About Susanne Albers

What Schools Are Affiliated With Susanne Albers?

Image Attributions

Susanne Albers's AcademicInfluence.com Rankings