Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Susanne Albers
2010 – today
- 2013
[c53]- [c52]
- [c51]Susanne Albers, Achim Passen: New Online Algorithms for Story Scheduling in Web Advertising. ICALP (2) 2013: 446-458
- [i3]Susanne Albers, Matthias Hellwig: Online Makespan Minimization with Parallel Schedules. CoRR abs/1304.5625 (2013)
- [i2]Susanne Albers, Onno J. Boxma, Kirk Pruhs: Scheduling (Dagstuhl Seminar 13111). Dagstuhl Reports 3(3): 24-50 (2013)
- 2012
- [j39]Susanne Albers, Matthias Hellwig: Semi-online scheduling revisited. Theor. Comput. Sci. 443: 1-9 (2012)
- [c50]Susanne Albers, Matthias Hellwig: On the Value of Job Migration in Online Makespan Minimization. ESA 2012: 84-95
- [c49]Susanne Albers, Antonios Antoniadis: Race to idle: new algorithms for speed scaling with a sleep state. SODA 2012: 1266-1285
- 2011
- [j38]Susanne Albers, Jean-Yves Marion: Preface: Special Issue on Theoretical Aspects of Computer Science (STACS). Theory Comput. Syst. 48(3): 443 (2011)
- [j37]
- [c48]
- [c47]Susanne Albers, Antonios Antoniadis, Gero Greiner: On multi-processor speed scaling with migration: extended abstract. SPAA 2011: 279-288
- [c46]
- [p2]Susanne Albers, Swen Schmelzer: Online Algorithms - What Is It Worth to Know the Future? Algorithms Unplugged 2011: 361-366
- [i1]Susanne Albers, Matthias Hellwig: On the Value of Job Migration in Online Makespan Minimization. CoRR abs/1111.0773 (2011)
- 2010
- [j36]Susanne Albers, Tobias Jacobs: An Experimental Study of New and Known Online Packet Buffering Algorithms. Algorithmica 57(4): 725-746 (2010)
- [j35]Susanne Albers: New Results on Web Caching with Request Reordering. Algorithmica 58(2): 461-477 (2010)
- [j34]
- [j33]Susanne Albers: Onlinealgorithmen - Was ist es wert, die Zukunft zu kennen? Informatik Spektrum 33(5): 438-443 (2010)
- [j32]
- [j31]
- [j30]
- [c45]
- [c44]
2000 – 2009
- 2009
- [j29]Susanne Albers: On the Value of Coordination in Network Design. SIAM J. Comput. 38(6): 2273-2302 (2009)
- [c43]
- [c42]Susanne Albers: Resource Management in Large Networks. Algorithmics of Large and Complex Networks 2009: 227-246
- [c41]Susanne Albers, Jean-Yves Marion: Preface - 26th International Symposium on Theoretical Aspects of Computer Science. STACS 2009: 0-
- [e8]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
- [e7]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
- [e6]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
- [e5]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
- 2008
- [c40]
- [c39]
- [c38]Susanne Albers, Pascal Weil: Abstracts Collection - 25th International Symposium on Theoretical Aspects of Computer Science. STACS 2008: 0-
- [c37]Susanne Albers, Pascal Weil: Preface - 25th International Symposium on Theoretical Aspects of Computer Science. STACS 2008: 1-6
- [p1]Susanne Albers, Swen Schmelzer: Online-Algorithmen: Was ist es wert, die Zukunft zu kennen?. Taschenbuch der Algorithmen 2008: 389-394
- [e4]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
- [r1]
- 2007
- [j28]Susanne Albers, Rob van Stee: A Study of Integrated Document and Connection Caching in the WWW. Algorithmica 47(3): 239-252 (2007)
- [j27]Susanne Albers, Hiroshi Fujiwara: Energy-efficient algorithms for flow time minimization. ACM Transactions on Algorithms 3(4) (2007)
- [c36]Susanne Albers, Tobias Jacobs: An Experimental Study of New and Known Online Packet Buffering Algorithms. ESA 2007: 754-765
- [c35]Susanne Albers, Fabian Müller, Swen Schmelzer: Speed scaling on parallel processors. SPAA 2007: 289-298
- 2006
- [j26]
- [c34]Susanne Albers, Stefan Eilts, Eyal Even-Dar, Yishay Mansour, Liam Roditty: On nash equilibria for a network creation game. SODA 2006: 89-98
- [c33]Susanne Albers, Hiroshi Fujiwara: Energy-Efficient Algorithms for Flow Time Minimization. STACS 2006: 621-633
- 2005
- [j25]Susanne Albers, Markus Büttner: Integrated prefetching and caching in single and parallel disk systems. Inf. Comput. 198(1): 24-39 (2005)
- [j24]Susanne Albers, Lene M. Favrholdt, Oliver Giel: On paging with locality of reference. J. Comput. Syst. Sci. 70(2): 145-175 (2005)
- [j23]Susanne Albers, Markus Schmidt: On the Performance of Greedy Algorithms in Packet Buffering. SIAM J. Comput. 35(2): 278-304 (2005)
- [j22]Susanne Albers, Helge Bals: Dynamic TCP Acknowledgment: Penalizing Long Delays. SIAM J. Discrete Math. 19(4): 938-951 (2005)
- [c32]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
- [c31]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
- [e3]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
- [e2]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
- 2004
- [c30]Susanne Albers, Robert Sedgewick, Dorothea Wagner: 04091 Abstracts Collection - Data Structures. Data Structures 2004
- [c29]
- [c28]Susanne Albers, Markus Schmidt: On the performance of greedy algorithms in packet buffering. STOC 2004: 35-44
- [e1]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
- 2003
- [j21]
- [c27]Susanne Albers, Rob van Stee: A Study of Integrated Document and Connection Caching. ICALP 2003: 653-667
- [c26]
- [c25]Susanne Albers, Markus Büttner: Integrated prefetching and caching in single and parallel disk systems. SPAA 2003: 109-117
- [c24]Susanne Albers, Markus Büttner: Integrated Prefetching and Caching with Read and Write Requests. WADS 2003: 162-173
- 2002
- [j20]Susanne Albers, Klaus Kursawe, Sven Schuierer: Exploring Unknown Environments with Obstacles. Algorithmica 32(1): 123-143 (2002)
- [j19]Susanne Albers, Marek Karpinski: Randomized splay trees: Theoretical and experimental results. Inf. Process. Lett. 81(4): 213-221 (2002)
- [j18]Susanne Albers, Bianca Schröder: An Experimental Study of Online Scheduling Algorithms. ACM Journal of Experimental Algorithmics 7: 3 (2002)
- [j17]
- [c23]
- [c22]Susanne Albers, Lene M. Favrholdt, Oliver Giel: On paging with locality of reference. STOC 2002: 258-267
- 2001
- [j16]Susanne Albers, Günter Schmidt: Scheduling with unexpected machine breakdowns. Discrete Applied Mathematics 110(2-3): 85-99 (2001)
- [j15]Susanne Albers, Moses Charikar, Michael Mitzenmacher: Delayed Information and Action in On-Line Algorithms. Inf. Comput. 170(2): 135-152 (2001)
- [c21]
- [c20]Susanne Albers, Carsten Witt: Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows. RANDOM-APPROX 2001: 12-23
- 2000
- [j14]Susanne Albers, Naveen Garg, Stefano Leonardi: Minimizing stall time in single and parallel disk systems. J. ACM 47(6): 969-986 (2000)
- [j13]Susanne Albers, Michael Mitzenmacher: Average-case analyses of first fit and random fit bin packing. Random Struct. Algorithms 16(3): 240-259 (2000)
- [j12]Susanne Albers, Monika Rauch Henzinger: Exploring Unknown Environments. SIAM J. Comput. 29(4): 1164-1188 (2000)
- [c19]
- [c18]Susanne Albers, Bianca Schröder: An Experimental Study of Online Scheduling Algorithms. Algorithm Engineering 2000: 11-22
1990 – 1999
- 1999
- [j11]
- [j10]
- [c17]Susanne Albers, Günter Schmidt: Scheduling with Unexpected Machine Breakdowns. RANDOM-APPROX 1999: 269-280
- [c16]Susanne Albers, Sanjeev Arora, Sanjeev Khanna: Page Replacement for General Caching Problems. SODA 1999: 31-40
- [c15]Susanne Albers, Klaus Kursawe, Sven Schuierer: Exploring Unknown Environments with Obstacles. SODA 1999: 842-843
- [c14]Susanne Albers: Invited Lecture: Online Algorithms: A Study of Graph-Theoretic Concepts. WG 1999: 10-26
- 1998
- [j9]Susanne Albers, Michael Mitzenmacher: Average Case Analyses of List Update Algorithms, with Applications to Data Compression. Algorithmica 21(3): 312-329 (1998)
- [j8]Susanne Albers, Hisashi Koga: New On-Line Algorithms for the Page Replication Problem. J. Algorithms 27(1): 75-96 (1998)
- [j7]Susanne Albers: Improved Randomized On-Line Algorithms for the List Update Problem. SIAM J. Comput. 27(3): 682-693 (1998)
- [j6]Susanne Albers: A Competitive Analysis of the List Update Problem with Lookahead. Theor. Comput. Sci. 197(1-2): 95-109 (1998)
- [c13]Susanne Albers, Moses Charikar, Michael Mitzenmacher: Delayed Information and Action in On-line Algorithms. FOCS 1998: 71-81
- [c12]Susanne Albers, Michael Mitzenmacher: Average-Case Analyses of First Fit and Random Fit Bin Packing. SODA 1998: 290-299
- [c11]Susanne Albers, Naveen Garg, Stefano Leonardi: Minimizing Stall Time in Single and Parallel Disk Systems. STOC 1998: 454-462
- 1997
- [j5]Susanne Albers: On the Influence of Lookahead in Competitive Paging Algorithms. Algorithmica 18(3): 283-305 (1997)
- [j4]Susanne Albers, Torben Hagerup: Improved Parallel Integer Sorting without Concurrent Writing. Inf. Comput. 136(1): 25-51 (1997)
- [j3]Susanne Albers, Michael Mitzenmacher: Revisiting the Counter Algorithms for List Update. Inf. Process. Lett. 64(3): 155-160 (1997)
- [c10]
- [c9]
- 1996
- [c8]
- [c7]Susanne Albers, Michael Mitzenmacher: Average Case Analyses of List Update Algorithms, with Applications to Data Compression. ICALP 1996: 514-525
- 1995
- [j2]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)
- [c6]Susanne Albers: Improved Randomized On-Line Algorithms for the List Update Problem. SODA 1995: 412-419
- [c5]
- 1994
- [c4]Susanne Albers: A Competitive Analysis of the List Update Problem with Lookahead. MFCS 1994: 201-210
- [c3]Susanne Albers, Hisashi Koga: New On-Line Algorithms for the Page Replication Problem. SWAT 1994: 25-36
- 1993
- [j1]Susanne Albers, Peter Brucker: The Complexity of One-Machine Batching Problems. Discrete Applied Mathematics 47(2): 87-107 (1993)
- [c2]Susanne Albers: The Influence of Lookahead in Competitive Paging Algorithms (Extended Abstract). ESA 1993: 1-12
- 1992
- [c1]Susanne Albers, Torben Hagerup: Improved Parallel Integer Sorting Without Concurrent Writing. SODA 1992: 463-472
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:12 CEST by the dblp team