Susanne Albers

• Address
• Curriculum Vitae
• Scientific Activities
• Research Interests
• Teaching
• Publications
• CS Institute's Home Page

---

Address

Prof. Dr. Susanne Albers
Institut für Informatik
Universität Freiburg
Georges-Köhler-Allee 79
79110 Freiburg
Germany

Phone: +49 (0) 761 203-8041
Fax: +49 (0) 761 203-8042
E-mail: salbers at informatik.uni-freiburg.de

Office hours (Sprechstunde): Monday, 13 - 14

---

Curriculum Vitae

• Born 1965
• June 1993: Ph.D. (Dr.rer.nat.) in Computer Science, University of Saarbrücken
• June 1993 - September 1999: Research Scientist at the Max Planck Institute for Computer Science, Saarbrücken
• September 1994 - August 1995: Postdoc at the International Computer Science Institute, Berkeley, California, USA
• October 1999 - July 2001: Associate Professor (C3) of Computer Science at the University of Dortmund
• August 2001- present: Full Professor (C4) of Computer Science at the University of Freiburg


• Short term appointments/visits: The University of Tokyo (1993); BRICS (1996); FU Berlin (1998); Univ. of Paderborn (1998/99); Carnegie Mellon University (2006).


• Gottfried Wilhelm Leibniz Prize (2008), the highest honour awarded in German research. It includes financial support of 2.5 Mio. Euros to be invested into research.
  Otto Hahn Medal (1994) of the Max Planck Society.


• Full academic cv

---

Scientific Activities

• Membership in editorial boards: Algorithmica, Computer Science: Research and Development, Journal of Discrete Algorithms, Journal of Graph Algorithms and Applications, Journal of Interconnection Networks.
  

• Program committees:
  Co-Chair of the PCs of ICALP09 (PC Chair, Track A), STACS09, STACS08, ESA 2004 (PC Chair, Design and Analysis Track).
  
  Membership in in PCs of STOC09, ALENEX09, SPAA08, ICALP07, WADS07, WEA07, ESCAPE07, MAPSP07, FSTTCS06, SPAA05, SODA04, ISAAC03, WADS03, ESA02, SPAA02, FOCS01, FOCS99, STACS99, ICALP98, SWAT96.

• Membership in steering committees: APPROX, STACS, ESA (chair 2004-2007).
  

• Invited speaker / Keynote addresses
  Conferences: ISMP 2003, ESA 2001, WG99 ;
  Workshops: 24th British Colloquium on Theoretical Computer Science 2008, Colloquium on Combinatorics 2007, MAPSP 2005, New Horizons in Computing, 2005;
  Schools: 20th International School for Computer Science Researchers, Lipari, 2008, DYNAMO 2008, 2nd Training School on Dynamic Aspects of Dynamic Networks, Iceland, 2008, Spring School on Theoretical Computer Science (EPIT) 2007, Fall School on Algorithms for Hard Problems 2002, ADFOCS 2000, Summerschool on Probabilistic Methods and Algorithms, 1999.
  

• Organizer or co-organizer of the following workshops:
  Annual Meeting (2007) of the Priority Programme Algorithmics of Large and Complex Networks , funded by the Germany Research Foundation; Oberwolfach Seminar on Efficient Algorithms 2000, 2003; Dagstuhl Seminar on Data Structures 2000, 2002, 2004;
  Dagstuhl Seminar on Online Algorithms 2002; Dagstuhl Seminar on Algorithms for Optimization with Incomplete Information 2005.
  

• Chair GI Study Group 0.1.1 on "Algorithms and Data Structures" (German Association of Computer Science)
  
  
• Member of the Review Board for Computer Science, German Research Foundation (2008 - 2011)
  Member of the Senate and Grants Committee for Research Training Centers, German Research Foundation (2000 - 2006).

---

Research Interests

• Design and analysis of algorithms, in particular online and approximation algorithms. Algorithmic game theory. Algorithms engineering

---

Teaching

• Winter term 2007/08: Graduate Course "Algorithms Theory"; Graduate Course "Selected topics in Efficient Algorithms"; Graduate Seminar "Algorithms for Adaptive Web Structures ".

---

Selected Publications

• S. Albers. On the value of coordination in network design. In Proc. 19th ACM-SIAM Symposium on Discrete Algorithms (SODA'08), 294-303, 2008.
  
  
• S. Albers and Tobias Jacobs. An experimental study of new and known online packet buffering algorithms. In Proc. 15th Annual European Symposium on Algorithms (ESA'07), Springer LNCS 4698, 754-765,2007.
  
  
• S. Albers, F. Müller and S. Schmelzer. Speed scaling on parallel processors. In Proc. 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'07), 289-298, 2007.
  
  
• S. Albers, S. Eilts, E. Even-Dar, Y. Mansour and L. Roditty. On Nash equilibria for a network creation game. In Proc. 17th ACM-SIAM Symposium on Discrete Algorithms (SODA'06), 89-98, 2006.
  
  
• S. Albers and Hiroshi Fujiwara. Energy-efficient algorithms for flow time minimization. In Proc. 23rd International Symposium on Theoretical Aspects of Computer Science (STACS'06), Springer LNCS 3884, 621-633, 2006.
  
  
• S. Albers. Online algorithms. In Interactive Computation: The New Paradigm edited by D.Q. Goldin, S.A. Smolka and P. Wegner, 143-164, 2006.
  
  
• S. Albers and M. Schmidt. On the performance of greedy algorithms in packet buffering. In 36th ACM Symposium on Theory of Computing (STOC'04), 35-44, 2004.
  
  
• S. Albers. New results on web caching with request reordering. In 16th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA04), 84-92, 2004.
  
  
• S. Albers and M. Büttner. Integrated prefetching and caching in single and parallel disk systems. Information and Computation, 198:24-39, 2005. Preliminary version in Proc. 15th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '03), pages 109-117, 2003.
  
  
• S. Albers and R. van Stee. A study of integrated document and connection caching. In Proc. 30th International Colloquium on Automata, Languages and Programming (ICALP03), Springer LNCS 2719, pages 653-667, 2003.
  
  
• S. Albers and M. Büttner. Integrated prefetching and caching with read and write requests. In Proc. 8th International Workshop on Algorithms and Data Structures (WADS'03), Springer LNCS 2748, pages 162-173, 2003.
  
  
• S. Albers and H. Bals. Dynamic TCP acknowledgement: Penalizing long delays. In Proc. 14th ACM-SIAM Symposium on Discrete Algorithms, pages 47-55, 2003.
  
  
• S. Albers. Online algorithms: A survey. Mathematical Programming, 97:3-26, 2003. Invited paper at ISMP 2003.
  
  
• S. Albers, L.M. Favrholdt and O. Giel. On paging with locality of reference. Journal of Computer and System Sciences, 70:145-175, 2005. Preliminary version in Proc. 34th ACM Symposium on Theory of Computing, pages 258-268, 2002.
  
  
• S. Albers. On randomized online scheduling. In Proc. 34th ACM Symposium on Theory of Computing,, pages 134-143, 2002.
  
  
• S. Albers and M. Karpinski. Randomized splay trees: Theoretical and experimental results. Information Processing Letters, 81:213-221, 2002.
  
  
• S. Albers and C. Witt. Minimizing stall time in single and parallel disk systems using multicommodity network flows. In Proc. 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX01), Springer LNCS Volume 2129, pages 12-23, 2001.
  
  
• S. Albers and B. Schröder. An experimental study of online scheduling algorithms. ACM Journal of Experimental Algorithmics, 7, 2002. Preliminary version in WAE00.
  
  
• S. Albers. Generalized connection caching. Theory of Computing Systems, 35:251-267, 2002. Invited to the journal's special issue dedicated to SPAA02.
  
  
• S. Albers. Online algorithms: A study of graph-theoretic concepts. Invited lecture in Proc. 25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG99), Springer LNCS 1665, pages 10-26, 1999.
  
  
• S.Albers and G. Schmidt. Scheduling with unexpected machine breakdowns. Discrete Applied Mathematics, 110:85-99, 2001. Invited contribution in APPROX 99.
  
  
• S. Albers, S. Arora and S. Khanna. Page replacement for general caching problems. In Proc. 10th Annual ACM-SIAM Symposium Discrete Algorithms (SODA99), pages 31-40, 1999.
  
  
• S. Albers, K. Kursawe and S. Schuierer. Exploring unknown environments with obstacles. Algorithmica 32:123-143, 2002. Preliminary version in SODA 99.
  
  
• S. Albers, M. Charikar and M. Mitzenmacher. On delayed information and action in online algorithms. Information and Computation 170:135-152, 2001. Preliminary version in FOCS 98.
  
  
• S. Albers and S. Leonardi. Online algorithms. To appear in ACM Computing Surveys , 1999.
  
  
• S. Albers, N. Garg and S. Leonardi. Minimizing stall time in single and parallel disk systems. Journal of the ACM , 47:969-986, 2000. Premininary version in STOC98.
  
  
• S. Albers and M. Mitzenmacher. Average case analyses of First-Fit and Random-Fit bin packing. Random Structures and Algorithms, 16:240-259, 2000. Preliminary version in SODA 99.
  
  
• S. Albers and M.Mitzenmacher. Revisiting the COUNTER algorithms for list update. Information Processing Letters, 64:155-160, 1997.
  
  
• S. Albers and M.R. Henzinger. Exploring unknown environments. SIAM Journal on Computing , 29:1164-1188, 2000. Preliminary version in STOC 97.
  
  
• S. Albers. Better bounds for online scheduling. SIAM Journal on Computing , 29:459-473, 1999. Preliminary version in STOC 97.
  
  
• S. Albers and J. Westbrook. Self-organizing data structures. In Online Algorithms: The State of the Art, edited by Amos Fiat and Gerhard Woeginger. Springer LNCS 1442, pages 31-51, 1998.
  
  
• S. Albers and M. Mitzenmacher. Average case analyses of list update algorithms, with applications to data compression. In Algorithmica, 21:312-329, 1998. Preliminary version in ICALP96.
  
  
• S. Albers, B. von Stengel and R. Werchner. A combined BIT and TIMESTAMP algorithm for the list update problem. Information Processing Letters, 56:135-139, 1995.
  
  
• S. Albers and H. Koga. Page migration with limited local memory capacity. In Proc. 4th International Workshop on Algorithms and Data Structures (WADS95), Springer LNCS, Volume 955, pages 147-158, 1995.
  
  
• S. Albers. Improved randomized on-line algorithms for the list update problem. SIAM Journal on Computing , 27:670-681, 1998. Preliminary version in SODA95.
  
  
• S. Albers and H. Koga. New on-line algorithms for the page replication problem. In Journal of Algorithms, 27:75-96, 1998. Preliminary version in SWAT94.
  
  
• S. Albers. A competitive analysis of the list update problem with lookahead. Theoretical Computer Science , 197:95-109, 1998.
  
  
• S. Albers. On the influence of lookahead in competitive paging algorithms. Algorithmica, 18:283-305, 1997.
  
  
• S. Albers and T. Hagerup. Improved parallel integer sorting without concurrent writing. Information and Computation, 136:25-51, 1997. Preliminary version in SODA92.
  
  
• S. Albers and P. Brucker. The complexity of one-machine batching problems. Discrete Applied Mathematics, 47:87-107, 1993.

Technical Reports and Newsletter Articles

• S. Albers. Online-Algorithmen: Was ist es wert, die Zukunft zu kennen? (in German) Invited contribution in Log-In (Journal of the German Association for Computer Science), 1999.
  
  
• S. Albers. Competitive online algorithms. Optima, 54:1-8, 1997. Feature article in the newsletter of the Mathematical Programming Society.
  
  
• S. Albers. Lecture notes on competitive online algorithms. BRICS Lecture Series LS-96-2, AArhus University, Denmark, 1996.