Остановите войну!
for scientists:
default search action
Susanne Albers
- > Home > Persons > Susanne Albers
Publications
- 2023
- [j65]Susanne Albers, Jens Quedenfeld:
Algorithms for Right-sizing Heterogeneous Data Centers. ACM Trans. Parallel Comput. 10(4): 20:1-20:28 (2023) - 2022
- [j63]Susanne Albers, Jens Quedenfeld:
Optimal Algorithms for Right-sizing Data Centers. ACM Trans. Parallel Comput. 9(4): 15:1-15:40 (2022) - [c75]Susanne Albers, Sebastian Schubert:
Tight Bounds for Online Matching in Bounded-Degree Graphs with Vertex Capacities. ESA 2022: 4:1-4:16 - [c74]Susanne Albers, Sebastian Schubert:
Online Ad Allocation in Bounded-Degree Graphs. WINE 2022: 60-77 - [i25]Susanne Albers, Sebastian Schubert:
Tight Bounds for Online Matching in Bounded-Degree Graphs with Vertex Capacities. CoRR abs/2206.15336 (2022) - 2021
- [j62]Susanne Albers, Sebastian Schraink:
Tight Bounds for Online Coloring of Basic Graph Classes. Algorithmica 83(1): 337-360 (2021) - [j57]Susanne Albers, Jens Quedenfeld:
Algorithms for energy conservation in heterogeneous data centers. Theor. Comput. Sci. 896: 111-131 (2021) - [c73]Susanne Albers, Sebastian Schubert:
Optimal Algorithms for Online b-Matching with Variable Vertex Capacities. APPROX-RANDOM 2021: 2:1-2:18 - [c72]Susanne Albers, Jens Quedenfeld:
Algorithms for Energy Conservation in Heterogeneous Data Centers. CIAC 2021: 75-89 - [c69]Susanne Albers, Jens Quedenfeld:
Algorithms for Right-Sizing Heterogeneous Data Centers. SPAA 2021: 48-58 - [i22]Susanne Albers, Jens Quedenfeld:
Algorithms for Energy Conservation in Heterogeneous Data Centers. CoRR abs/2107.14672 (2021) - [i21]Susanne Albers, Jens Quedenfeld:
Algorithms for Right-Sizing Heterogeneous Data Centers. CoRR abs/2107.14692 (2021) - 2019
- [j54]Susanne Albers, Achim Passen:
New Online Algorithms for Story Scheduling in Web Advertising. Algorithmica 81(1): 1-25 (2019) - 2018
- [j50]Susanne Albers, Dario Frascaria:
Quantifying Competitiveness in Paging with Locality of Reference. Algorithmica 80(12): 3563-3596 (2018) - [c60]Susanne Albers, Jens Quedenfeld:
Optimal Algorithms for Right-Sizing Data Centers. SPAA 2018: 363-372 - [i13]Susanne Albers, Jens Quedenfeld:
Optimal Algorithms for Right-Sizing Data Centers - Extended Version. CoRR abs/1807.05112 (2018) - 2017
- [j49]Susanne Albers, Matthias Hellwig:
Online Makespan Minimization with Parallel Schedules. Algorithmica 78(2): 492-520 (2017) - [j48]Susanne Albers, Matthias Hellwig:
On the Value of Job Migration in Online Makespan Minimization. Algorithmica 79(2): 598-623 (2017) - [c59]Susanne Albers, Sebastian Schraink:
Tight Bounds for Online Coloring of Basic Graph Classes. ESA 2017: 7:1-7:14 - [i11]Susanne Albers, Sebastian Schraink:
Tight Bounds for Online Coloring of Basic Graph Classes. CoRR abs/1702.07172 (2017) - 2016
- [j45]Susanne Albers, Sonja Lauer:
On list update with locality of reference. J. Comput. Syst. Sci. 82(5): 627-653 (2016) - 2015
- [c52]Susanne Albers, Dario Frascaria:
Quantifying Competitiveness in Paging with Locality of Reference. ICALP (1) 2015: 26-38 - 2014
- [c51]Susanne Albers, Matthias Hellwig:
Online Makespan Minimization with Parallel Schedules. SWAT 2014: 13-25 - 2013
- [c48]Susanne Albers, Achim Passen:
New Online Algorithms for Story Scheduling in Web Advertising. ICALP (2) 2013: 446-458 - [i8]Susanne Albers, Matthias Hellwig:
Online Makespan Minimization with Parallel Schedules. CoRR abs/1304.5625 (2013) - 2012
- [j39]Susanne Albers, Matthias Hellwig:
Semi-online scheduling revisited. Theor. Comput. Sci. 443: 1-9 (2012) - [c47]Susanne Albers, Matthias Hellwig:
On the Value of Job Migration in Online Makespan Minimization. ESA 2012: 84-95 - 2011
- [j38]Susanne Albers, Jean-Yves Marion:
Preface: Special Issue on Theoretical Aspects of Computer Science (STACS). Theory Comput. Syst. 48(3): 443 (2011) - [i6]Susanne Albers, Matthias Hellwig:
On the Value of Job Migration in Online Makespan Minimization. CoRR abs/1111.0773 (2011) - 2009
- [c38]Susanne Albers, Jean-Yves Marion:
Preface - 26th International Symposium on Theoretical Aspects of Computer Science. STACS 2009 - [e5]Susanne Albers, Jean-Yves Marion:
26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings. LIPIcs 3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2009, ISBN 978-3-939897-09-5 [contents] - 2008
- [c37]Susanne Albers, Sonja Lauer:
On List Update with Locality of Reference. ICALP (1) 2008: 96-107 - 2005
- [j25]Susanne Albers, Markus Büttner:
Integrated prefetching and caching in single and parallel disk systems. Inf. Comput. 198(1): 24-39 (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. Discret. Math. 19(4): 938-951 (2005) - 2004
- [c28]Susanne Albers, Markus Schmidt:
On the performance of greedy algorithms in packet buffering. STOC 2004: 35-44 - 2003
- [c26]Susanne Albers, Helge Bals:
Dynamic TCP acknowledgement: penalizing long delays. SODA 2003: 47-55 - [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 - 2001
- [j16]Susanne Albers, Günter Schmidt:
Scheduling with unexpected machine breakdowns. Discret. Appl. Math. 110(2-3): 85-99 (2001) - [c20]Susanne Albers, Carsten Witt:
Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows. RANDOM-APPROX 2001: 12-23 - 1999
- [c17]Susanne Albers, Günter Schmidt:
Scheduling with Unexpected Machine Breakdowns. RANDOM-APPROX 1999: 269-280 - 1998
- [j8]Susanne Albers, Hisashi Koga:
New On-Line Algorithms for the Page Replication Problem. J. Algorithms 27(1): 75-96 (1998) - 1996
- [c8]Susanne Albers, Jeffery R. Westbrook:
Self-Organizing Data Structures. Online Algorithms 1996: 13-51 - 1995
- [c5]Susanne Albers, Hisashi Koga:
Page Migration with Limited Local Memory Capacity. WADS 1995: 147-158 - 1994
- [c3]Susanne Albers, Hisashi Koga:
New On-Line Algorithms for the Page Replication Problem. SWAT 1994: 25-36
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 23:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint