Susanne Albers

Susanne Albers, Matthias Hellwig: Online Makespan Minimization with Parallel Schedules. CoRR abs/1304.5625 (2013)

Susanne Albers, Matthias Hellwig: Semi-online scheduling revisited. Theor. Comput. Sci. 443: 1-9 (2012)

Susanne Albers, Matthias Hellwig: On the Value of Job Migration in Online Makespan Minimization. ESA 2012: 84-95

Susanne Albers, Antonios Antoniadis: Race to idle: new algorithms for speed scaling with a sleep state. SODA 2012: 1266-1285

Susanne Albers, Jean-Yves Marion: Preface: Special Issue on Theoretical Aspects of Computer Science (STACS). Theory Comput. Syst. 48(3): 443 (2011)

Susanne Albers, Alberto Marchetti-Spaccamela: Preface. Theor. Comput. Sci. 412(24): 2563 (2011)

Susanne Albers, Swen Schmelzer: Online Algorithms - What Is It Worth to Know the Future? Algorithms Unplugged 2011: 361-366

Susanne Albers: Energy-Efficient Algorithms (Invited Talk). FSTTCS 2011: 1-2

Susanne Albers, Antonios Antoniadis, Gero Greiner: On multi-processor speed scaling with migration: extended abstract. SPAA 2011: 279-288

Susanne Albers: Algorithms for Dynamic Speed Scaling. STACS 2011: 1-11

Susanne Albers, Matthias Hellwig: On the Value of Job Migration in Online Makespan Minimization. CoRR abs/1111.0773 (2011)

Susanne Albers, Tobias Jacobs: An Experimental Study of New and Known Online Packet Buffering Algorithms. Algorithmica 57(4): 725-746 (2010)

Susanne Albers: New Results on Web Caching with Request Reordering. Algorithmica 58(2): 461-477 (2010)

Susanne Albers: Energy-efficient algorithms. Commun. ACM 53(5): 86-96 (2010)

Susanne Albers: Onlinealgorithmen - Was ist es wert, die Zukunft zu kennen? Informatik Spektrum 33(5): 438-443 (2010)

Susanne Albers, Pascal Weil: STACS 2008 Foreword. Theory Comput. Syst. 47(3): 611-612 (2010)

Susanne Albers: Editorial Note. ACM Transactions on Algorithms 6(2) (2010)

Susanne Albers: Editorial note. ACM Transactions on Algorithms 6(4) (2010)

Susanne Albers: Algorithms for Energy Management. CSR 2010: 1-11

Susanne Albers, Pascal Lenzner: On Approximate Nash Equilibria in Network Design. WINE 2010: 14-25

Susanne Albers: On the Value of Coordination in Network Design. SIAM J. Comput. 38(6): 2273-2302 (2009)

Susanne Albers: Algorithms for Energy Saving. Efficient Algorithms 2009: 173-186

Susanne Albers: Resource Management in Large Networks. Algorithmics of Large and Complex Networks 2009: 227-246

Susanne Albers, Jean-Yves Marion: Preface - 26th International Symposium on Theoretical Aspects of Computer Science. STACS 2009: 0-

Susanne Albers, Helmut Alt, Stefan Näher (Eds.): Efficient Algorithms, Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 5760, Springer 2009, isbn 978-3-642-03455-8

Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris E. Nikoletseas, Wolfgang Thomas (Eds.): Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I. Lecture Notes in Computer Science 5555, Springer 2009, isbn 978-3-642-02926-4

Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris E. Nikoletseas, Wolfgang Thomas (Eds.): Automata, Languages and Programming, 36th Internatilonal Collogquium, ICALP 2009, Rhodes, greece, July 5-12, 2009, Proceedings, Part II. Lecture Notes in Computer Science 5556, Springer 2009, isbn 978-3-642-02929-5

Susanne Albers, Jean-Yves Marion (Eds.): 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings. LIPIcs 3, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany 2009, isbn 978-3-939897-09-5

Susanne Albers, Sonja Lauer: On List Update with Locality of Reference. ICALP (1) 2008: 96-107

Susanne Albers: On the value of coordination in network design. SODA 2008: 294-303

Susanne Albers, Pascal Weil: Abstracts Collection - 25th International Symposium on Theoretical Aspects of Computer Science. STACS 2008: 0-

Susanne Albers, Pascal Weil: Preface - 25th International Symposium on Theoretical Aspects of Computer Science. STACS 2008: 1-6

Susanne Albers, Swen Schmelzer: Online-Algorithmen: Was ist es wert, die Zukunft zu kennen?. Taschenbuch der Algorithmen 2008: 389-394

Susanne Albers: Online List Update. Encyclopedia of Algorithms 2008

Susanne Albers, Pascal Weil (Eds.): STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings. LIPIcs 1, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany 2008

Susanne Albers, Rob van Stee: A Study of Integrated Document and Connection Caching in the WWW. Algorithmica 47(3): 239-252 (2007)

Susanne Albers, Hiroshi Fujiwara: Energy-efficient algorithms for flow time minimization. ACM Transactions on Algorithms 3(4) (2007)

Susanne Albers, Tobias Jacobs: An Experimental Study of New and Known Online Packet Buffering Algorithms. ESA 2007: 754-765

Susanne Albers, Fabian Müller, Swen Schmelzer: Speed scaling on parallel processors. SPAA 2007: 289-298

Susanne Albers, Tomasz Radzik: Foreword. Algorithmica 45(1): 1-2 (2006)

Susanne Albers, Stefan Eilts, Eyal Even-Dar, Yishay Mansour, Liam Roditty: On nash equilibria for a network creation game. SODA 2006: 89-98

Susanne Albers, Hiroshi Fujiwara: Energy-Efficient Algorithms for Flow Time Minimization. STACS 2006: 621-633

Susanne Albers, Markus Büttner: Integrated prefetching and caching in single and parallel disk systems. Inf. Comput. 198(1): 24-39 (2005)

Susanne Albers, Lene M. Favrholdt, Oliver Giel: On paging with locality of reference. J. Comput. Syst. Sci. 70(2): 145-175 (2005)

Susanne Albers, Markus Schmidt: On the Performance of Greedy Algorithms in Packet Buffering. SIAM J. Comput. 35(2): 278-304 (2005)

Susanne Albers, Helge Bals: Dynamic TCP Acknowledgment: Penalizing Long Delays. SIAM J. Discrete Math. 19(4): 938-951 (2005)

Susanne Albers, Rolf H. Möhring, Georg Ch. Pflug, Rüdiger Schultz: 05031 Abstracts Collection - Algorithms for Optimization with Incomplete Information. Algorithms for Optimization with Incomplete Information 2005

Susanne Albers, Rolf H. Möhring, Georg Ch. Pflug, Rüdiger Schultz: 05031 Summary-- Algorithms for Optimization with Incomplete Information. Algorithms for Optimization with Incomplete Information 2005

Susanne Albers, Robert Sedgewick, Dorothea Wagner (Eds.): Data Structures, 22.-27. February 2004. Dagstuhl Seminar Proceedings 04091, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2005

Susanne Albers, Rolf H. Möhring, Georg Ch. Pflug, Rüdiger Schultz (Eds.): Algorithms for Optimization with Incomplete Information, 16.-21. January 2005. Dagstuhl Seminar Proceedings 05031, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2005

Susanne Albers, Robert Sedgewick, Dorothea Wagner: 04091 Abstracts Collection - Data Structures. Data Structures 2004

Susanne Albers: New results on web caching with request reordering. SPAA 2004: 84-92

Susanne Albers, Markus Schmidt: On the performance of greedy algorithms in packet buffering. STOC 2004: 35-44

Susanne Albers, Tomasz Radzik (Eds.): Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings. Lecture Notes in Computer Science 3221, Springer 2004, isbn 3-540-23025-4

Susanne Albers: Online algorithms: a survey. Math. Program. 97(1-2): 3-26 (2003)

Susanne Albers, Rob van Stee: A Study of Integrated Document and Connection Caching. ICALP 2003: 653-667

Susanne Albers, Helge Bals: Dynamic TCP acknowledgement: penalizing long delays. SODA 2003: 47-55

Susanne Albers, Markus Büttner: Integrated prefetching and caching in single and parallel disk systems. SPAA 2003: 109-117

Susanne Albers, Markus Büttner: Integrated Prefetching and Caching with Read and Write Requests. WADS 2003: 162-173

Susanne Albers, Klaus Kursawe, Sven Schuierer: Exploring Unknown Environments with Obstacles. Algorithmica 32(1): 123-143 (2002)

Susanne Albers, Marek Karpinski: Randomized splay trees: Theoretical and experimental results. Inf. Process. Lett. 81(4): 213-221 (2002)

Susanne Albers, Bianca Schröder: An Experimental Study of Online Scheduling Algorithms. ACM Journal of Experimental Algorithmics 7: 3 (2002)

Susanne Albers: On Generalized Connection Caching. Theory Comput. Syst. 35(3): 251-267 (2002)

Susanne Albers: On randomized online scheduling. STOC 2002: 134-143

Susanne Albers, Lene M. Favrholdt, Oliver Giel: On paging with locality of reference. STOC 2002: 258-267

Susanne Albers, Günter Schmidt: Scheduling with unexpected machine breakdowns. Discrete Applied Mathematics 110(2-3): 85-99 (2001)

Susanne Albers, Moses Charikar, Michael Mitzenmacher: Delayed Information and Action in On-Line Algorithms. Inf. Comput. 170(2): 135-152 (2001)

Susanne Albers: Some Algorithmic Problems in Large Networks. ESA 2001: 30-32

Susanne Albers, Carsten Witt: Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows. RANDOM-APPROX 2001: 12-23

Susanne Albers, Naveen Garg, Stefano Leonardi: Minimizing stall time in single and parallel disk systems. J. ACM 47(6): 969-986 (2000)

Susanne Albers, Michael Mitzenmacher: Average-case analyses of first fit and random fit bin packing. Random Struct. Algorithms 16(3): 240-259 (2000)

Susanne Albers, Monika Rauch Henzinger: Exploring Unknown Environments. SIAM J. Comput. 29(4): 1164-1188 (2000)

Susanne Albers: Generalized connection caching. SPAA 2000: 70-78

Susanne Albers, Bianca Schröder: An Experimental Study of Online Scheduling Algorithms. Algorithm Engineering 2000: 11-22

Susanne Albers, Stefano Leonardi: On-line Algorithms. ACM Comput. Surv. 31(3es): 4 (1999)

Susanne Albers: Better Bounds for Online Scheduling. SIAM J. Comput. 29(2): 459-473 (1999)

Susanne Albers, Günter Schmidt: Scheduling with Unexpected Machine Breakdowns. RANDOM-APPROX 1999: 269-280

Susanne Albers, Sanjeev Arora, Sanjeev Khanna: Page Replacement for General Caching Problems. SODA 1999: 31-40

Susanne Albers, Klaus Kursawe, Sven Schuierer: Exploring Unknown Environments with Obstacles. SODA 1999: 842-843

Susanne Albers: Invited Lecture: Online Algorithms: A Study of Graph-Theoretic Concepts. WG 1999: 10-26

Susanne Albers, Michael Mitzenmacher: Average Case Analyses of List Update Algorithms, with Applications to Data Compression. Algorithmica 21(3): 312-329 (1998)

Susanne Albers, Hisashi Koga: New On-Line Algorithms for the Page Replication Problem. J. Algorithms 27(1): 75-96 (1998)

Susanne Albers: Improved Randomized On-Line Algorithms for the List Update Problem. SIAM J. Comput. 27(3): 682-693 (1998)

Susanne Albers: A Competitive Analysis of the List Update Problem with Lookahead. Theor. Comput. Sci. 197(1-2): 95-109 (1998)

Susanne Albers, Moses Charikar, Michael Mitzenmacher: Delayed Information and Action in On-line Algorithms. FOCS 1998: 71-81

Susanne Albers, Michael Mitzenmacher: Average-Case Analyses of First Fit and Random Fit Bin Packing. SODA 1998: 290-299

Susanne Albers, Naveen Garg, Stefano Leonardi: Minimizing Stall Time in Single and Parallel Disk Systems. STOC 1998: 454-462

Susanne Albers: On the Influence of Lookahead in Competitive Paging Algorithms. Algorithmica 18(3): 283-305 (1997)

Susanne Albers, Torben Hagerup: Improved Parallel Integer Sorting without Concurrent Writing. Inf. Comput. 136(1): 25-51 (1997)

Susanne Albers, Michael Mitzenmacher: Revisiting the Counter Algorithms for List Update. Inf. Process. Lett. 64(3): 155-160 (1997)

Susanne Albers: Better Bounds for Online Scheduling. STOC 1997: 130-139

Susanne Albers, Monika Rauch Henzinger: Exploring Unknown Environments. STOC 1997: 416-425

Susanne Albers, Jeffery Westbrook: Self-Organizing Data Structures. Online Algorithms 1996: 13-51

Susanne Albers, Michael Mitzenmacher: Average Case Analyses of List Update Algorithms, with Applications to Data Compression. ICALP 1996: 514-525

Susanne Albers, Bernhard von Stengel, Ralph Werchner: A Combined BIT and TIMESTAMP Algorithm for the List Update Problem. Inf. Process. Lett. 56(3): 135-139 (1995)

Susanne Albers: Improved Randomized On-Line Algorithms for the List Update Problem. SODA 1995: 412-419

Susanne Albers, Hisashi Koga: Page Migration with Limited Local Memory Capacity. WADS 1995: 147-158

Susanne Albers: A Competitive Analysis of the List Update Problem with Lookahead. MFCS 1994: 201-210

Susanne Albers, Hisashi Koga: New On-Line Algorithms for the Page Replication Problem. SWAT 1994: 25-36

Susanne Albers, Peter Brucker: The Complexity of One-Machine Batching Problems. Discrete Applied Mathematics 47(2): 87-107 (1993)

Susanne Albers: The Influence of Lookahead in Competitive Paging Algorithms (Extended Abstract). ESA 1993: 1-12

Susanne Albers, Torben Hagerup: Improved Parallel Integer Sorting Without Concurrent Writing. SODA 1992: 463-472