English | Deutsch

Lehrstuhl für Algorithmen und KomplexitätPersonenSusanne AlbersPublikationen

Home Aktuelles Personen Prof. Dr. Susanne Albers Lebenslauf Wissenschaftliche Ämter Forschung Publikationen Lehre Forschung Publikationen Projekte Kontakt

Ausgewählte Publikationen

• S. Albers, E. Bampis, D. Letsios, G. Lucarelli and R. Stotz. Scheduling on power-heterogeneous processors. In Proc. 12th Latin American Symposium on Theoretical Informatics (LATIN16), Springer LNCS 9644, 41-54, 2016.
  
  
• S. Albers and D. Frascario. Quantifying competitiveness in paging with locality of reference. In Proc. 42th International Colloquium on Automata, Languages, and Programming (ICALP15), Springer LNCS, 2015.
  
  
• S. Albers and M. Hellwig. Online makespan minimization with parallel schedules. In Proc. 14th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT14) , Springer LNCS 8513, 13-25, 2014.
  
  
• S. Albers and A. Passen. New online algorithms for story scheduling in web advertising. In Proc. 40th International Colloquium on Automata, Languages, and Programming (ICALP13), Springer LNCS 7966, 46--458, 2013.
  
  
• S. Albers. Recent advances for a classical scheduling problem. In Proc. 40th International Colloquium on Automata, Languages, and Programming (ICALP13), Springer LNCS 7966, 4-14, 2013.
  
  
• S. Albers and M. Hellwig. On the value of job migration in online makespan minimization. In Proc. 20th Annual European Symposium on Algorithms (ESA12) , Springer LNCS 7501, 84-95, 2012.
  
  
• S. Albers and A. Antoniadis. Race to idle: new algorithms for speed scaling with a sleep state. In Proc. 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'12), 1266-1285, 2012.
  
  
• S. Albers and M. Hellwig. Semi-online scheduling revisited. Theoretical Computer Science, 2012.
  
  
• S. Albers, A. Antoniadis and G. Greiner. On multi-processor speed scaling with migration. In Proc. 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'11), 279-288, 2011.
  
  
• S. Albers. Algorithms for Dynamic Speed Scaling. In Proc. 28th International Symposium on Theoretical Aspects of Computer Science (STACS'11), 1-11, 2011.
  
  
• S. Albers. Energy-efficient algorithms. Communications of the ACM, 86-96, 2010.
  
  
• S. Albers and P. Lenzner. On approximate Nash equilibria in network design. In Proc. 6th International Workshop on Internet and Network Economics (WINE'10), 14-25, 2010.
  
  
• S. Albers. Online scheduling. In Introduction to Scheduling, edited by Yves Robert and Frederic Vivien. Chapman and Hall/CRC Press, 57-84, 2009.
  
  
• S. Albers. Resource management on large networks. Book chapter in Algorithmics of Large and Complex Networks, Springer LNCS 5515, 227-246, 2009.
  
  
• S. Albers and S. Lauer. On List Update with Locality of Reference. In Proc. 35th International Colloquium on Automata, Languages and Programming (ICALP'08), Springer LNCS 5125, 96-107, 2008.
  
  
• 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 SPAA00.
  
  
• 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. 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:682-693, 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 for high-school teachers, 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.

Juli 2022: Jens Quedenfeld hat seine Promotion abgeschlossen.

Juni 2022: Maximilian Janke hat seine Promotion abgeschlossen.

March 2022: Alexander Eckl hat seine Promotion abgeschlossen.

Juni 2021: Leon Ladewig hat seine Promotion abgeschlossen.

Februar 2020: Susanne Albers ist Vorsitzende des Programmkomitees der SWAT 2020.

Februar 2020: Susanne Albers ist eingeladene Sprecherin auf dem ACM India Annual Event.

ESA/ALGO 2019 wird von Susanne Albers und ihrer Gruppe organisiert.

Juli 2019: Susanne Albers ist Festrednerin der Tagung SIROCCO 2019, Italien.

Mai 2019: Susanne Albers ist Festrednerin des Symposiums 50 Years Informatics

Dezember 2017: Susanne Albers hält Festvortrag am Tag der Informatik, Absolventenfest der RWTH Aachen.

April 2017: Neues DFG Graduiertenkolleg AdONE.

Susanne Albers erhaelt ERC Advanced Grant. Pressemitteilung Bayerisches Staatsministerium f. Bildung u. Kultus, Wissenschaft u. Kunst.

August 2016: Susanne Albers hält einen Plenarvortrag auf Euro-Par 2016, Grenoble.

Susanne Albers, Nicole Megow und Andreas S. Schulz organisieren MAPSP 2017.

Juni 2016: Susanne Albers hält einen eingeladenen Vortrag in der Akademie der Wissenschaften und der Literatur, Mainz.

September 2015: Susanne Albers ist eingeladene Sprecherin auf dem MPI-INF – 25th Anniversary. Vortragende im Programm sind mehrere Turing-Preisträger, Leibniz-Preisträger, Humboldt-Preisträger und Gewinner von ERC Grants.

Juni 2015: Susanne Albers hält einen Plenarvortrag auf dem 31st International Symposium on Computational Geometry (SOCG15), Eindhoven.

Juni 2015: Susanne Albers ist eingeladene Sprecherin des Tutorials Network Creation Games: How Does the Internet Form?, organisiert von Erik D. Demaine (MIT) und MohammadTaghi Hajiaghayi (University of Maryland). 16th Conference on Electronic Commerce (EC15), Portland, Oregon.

Lehrstuhl für Algorithmen und Komplexität

Prof. Dr. Susanne Albers

Boltzmannstr. 3
85748 Garching bei München

Tel +89.289.17706
Fax +89.289.17707

E-Mail

Aktuelles

Impressum