Susanne Albers

According to our database1, Susanne Albers authored at least 95 papers between 1992 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
On Energy Conservation in Data Centers.
TOPC, 2019

Motivating Time-Inconsistent Agents: A Computational Approach.
Theory Comput. Syst., 2019

Minimization of Weighted Completion Times in Path-based Coflow Scheduling.
CoRR, 2019

New Online Algorithms for Story Scheduling in Web Advertising.
Algorithmica, 2019

New Results for the k-Secretary Problem.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Improved Online Algorithms for Knapsack and GAP in the Random Order Model.
Proceedings of the Approximation, 2019

2018
Optimal Algorithms for Right-Sizing Data Centers - Extended Version.
CoRR, 2018

Quantifying Competitiveness in Paging with Locality of Reference.
Algorithmica, 2018

Optimal Algorithms for Right-Sizing Data Centers.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

2017
Algorithmic Economics und Operations Research.
Informatik Spektrum, 2017

Scheduling on power-heterogeneous processors.
Inf. Comput., 2017

On the Value of Job Migration in Online Makespan Minimization.
Algorithmica, 2017

Online Makespan Minimization with Parallel Schedules.
Algorithmica, 2017

The Price of Uncertainty in Present-Biased Planning.
Proceedings of the Web and Internet Economics - 13th International Conference, 2017

On the Value of Penalties in Time-Inconsistent Planning.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Tight Bounds for Online Coloring of Basic Graph Classes.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016
On list update with locality of reference.
J. Comput. Syst. Sci., 2016

2015
On multi-processor speed scaling with migration.
J. Comput. Syst. Sci., 2015

Modeling Real-World Data Sets (Invited Talk).
Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014
On Nash Equilibria for a Network Creation Game.
ACM Trans. Economics and Comput., 2014

Race to idle: New algorithms for speed scaling with a sleep state.
ACM Trans. Algorithms, 2014

Speed Scaling on Parallel Processors.
Algorithmica, 2014

2013
On Approximate Nash Equilibria in Network Design.
Internet Mathematics, 2013

Scheduling (Dagstuhl Seminar 13111).
Dagstuhl Reports, 2013

Recent Advances for a Classical Scheduling Problem.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Recent Results for Online Makespan Minimization.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012
Semi-online scheduling revisited.
Theor. Comput. Sci., 2012

2011
Preface.
Theor. Comput. Sci., 2011

Preface: Special Issue on Theoretical Aspects of Computer Science (STACS).
Theory Comput. Syst., 2011

Algorithms for Dynamic Speed Scaling.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

On multi-processor speed scaling with migration: extended abstract.
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

Energy-Efficient Algorithms (Invited Talk).
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

Online Algorithms - What Is It Worth to Know the Future?
Proceedings of the Algorithms Unplugged, 2011

2010
Editorial note.
ACM Trans. Algorithms, 2010

STACS 2008 Foreword.
Theory Comput. Syst., 2010

Onlinealgorithmen - Was ist es wert, die Zukunft zu kennen?
Informatik Spektrum, 2010

Energy-efficient algorithms.
Commun. ACM, 2010

An Experimental Study of New and Known Online Packet Buffering Algorithms.
Algorithmica, 2010

New Results on Web Caching with Request Reordering.
Algorithmica, 2010

10071 Executive Summary - Scheduling.
Proceedings of the Scheduling, 14.02. - 19.02.2010, 2010

10071 Abstracts Collection - Scheduling.
Proceedings of the Scheduling, 14.02. - 19.02.2010, 2010

Algorithms for Energy Management.
Proceedings of the Computer Science, 2010

2009
On the Value of Coordination in Network Design.
SIAM J. Comput., 2009

Preface - 26th International Symposium on Theoretical Aspects of Computer Science.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Resource Management in Large Networks.
Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

Algorithms for Energy Saving.
Proceedings of the Efficient Algorithms, 2009

Online Scheduling.
Proceedings of the Introduction to Scheduling., 2009

2008
Online-Algorithmen: Was ist es wert, die Zukunft zu kennen?.
Proceedings of the Taschenbuch der Algorithmen, 2008

Online List Update.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Abstracts Collection - 25th International Symposium on Theoretical Aspects of Computer Science.
Proceedings of the STACS 2008, 2008

Preface - 25th International Symposium on Theoretical Aspects of Computer Science.
Proceedings of the STACS 2008, 2008

2007
Online Computation in Large Networks.
Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

Energy-efficient algorithms for flow time minimization.
ACM Trans. Algorithms, 2007

A Study of Integrated Document and Connection Caching in the WWW.
Algorithmica, 2007

2006
Foreword.
Algorithmica, 2006

2005
Dynamic TCP Acknowledgment: Penalizing Long Delays.
SIAM J. Discrete Math., 2005

On the Performance of Greedy Algorithms in Packet Buffering.
SIAM J. Comput., 2005

On paging with locality of reference.
J. Comput. Syst. Sci., 2005

Integrated prefetching and caching in single and parallel disk systems.
Inf. Comput., 2005

05031 Summary-- Algorithms for Optimization with Incomplete Information.
Proceedings of the Algorithms for Optimization with Incomplete Information, 2005

05031 Abstracts Collection - Algorithms for Optimization with Incomplete Information.
Proceedings of the Algorithms for Optimization with Incomplete Information, 2005

2004
04091 Abstracts Collection - Data Structures.
Proceedings of the Data Structures, 22.-27. February 2004, 2004

2003
Online algorithms: a survey.
Math. Program., 2003

Integrated Prefetching and Caching with Read and Write Requests.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Dynamic TCP acknowledgement: penalizing long delays.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

A Study of Integrated Document and Connection Caching.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002
On Generalized Connection Caching.
Theory Comput. Syst., 2002

An Experimental Study of Online Scheduling Algorithms.
ACM Journal of Experimental Algorithmics, 2002

Randomized splay trees: Theoretical and experimental results.
Inf. Process. Lett., 2002

Exploring Unknown Environments with Obstacles.
Algorithmica, 2002

On randomized online scheduling.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

2001
Delayed Information and Action in On-Line Algorithms.
Inf. Comput., 2001

Scheduling with unexpected machine breakdowns.
Discret. Appl. Math., 2001

Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows.
Proceedings of the Approximation, 2001

Some Algorithmic Problems in Large Networks.
Proceedings of the Algorithms, 2001

2000
Exploring Unknown Environments.
SIAM J. Comput., 2000

Average-case analyses of first fit and random fit bin packing.
Random Struct. Algorithms, 2000

Minimizing stall time in single and parallel disk systems.
J. ACM, 2000

1999
Better Bounds for Online Scheduling.
SIAM J. Comput., 1999

On-line Algorithms.
ACM Comput. Surv., 1999

Invited Lecture: Online Algorithms: A Study of Graph-Theoretic Concepts.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

Page Replacement for General Caching Problems.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998
A Competitive Analysis of the List Update Problem with Lookahead.
Theor. Comput. Sci., 1998

Improved Randomized On-Line Algorithms for the List Update Problem.
SIAM J. Comput., 1998

New On-Line Algorithms for the Page Replication Problem.
J. Algorithms, 1998

Average Case Analyses of List Update Algorithms, with Applications to Data Compression.
Algorithmica, 1998

1997
Revisiting the Counter Algorithms for List Update.
Inf. Process. Lett., 1997

Improved Parallel Integer Sorting without Concurrent Writing.
Inf. Comput., 1997

On the Influence of Lookahead in Competitive Paging Algorithms.
Algorithmica, 1997

1996
Self-Organizing Data Structures.
Proceedings of the Online Algorithms, 1996

1995
A Combined BIT and TIMESTAMP Algorithm for the List Update Problem.
Inf. Process. Lett., 1995

Page Migration with Limited Local Memory Capacity.
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

1993
The Complexity of One-Machine Batching Problems.
Discret. Appl. Math., 1993

The Influence of Lookahead in Competitive Paging Algorithms (Extended Abstract).
Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1992
The influence of lookahead in competitive on-line algorithms.
PhD thesis, 1992


  Loading...