default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthias Westermann
Person information
- affiliation: RWTH Aachen University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j11]Matthias Englert, David Mezlaf, Matthias Westermann:
Online Makespan Scheduling with Job Migration on Uniform Machines. Algorithmica 83(12): 3537-3566 (2021)
2010 – 2019
- 2018
- [j10]Kamal Al-Bawani
, Matthias Englert, Matthias Westermann:
Comparison-Based Buffer Management in QoS Switches. Algorithmica 80(3): 1073-1092 (2018) - [j9]Kamal Al-Bawani, Matthias Englert, Matthias Westermann:
Online Packet Scheduling for CIOQ and Buffered Crossbar Switches. Algorithmica 80(12): 3861-3888 (2018) - [c20]Matthias Englert, David Mezlaf, Matthias Westermann:
Online Makespan Scheduling with Job Migration on Uniform Machines. ESA 2018: 26:1-26:14 - 2016
- [c19]Kamal Al-Bawani, Matthias Englert, Matthias Westermann:
Comparison-Based FIFO Buffer Management in QoS Switches. LATIN 2016: 27-40 - [c18]Kamal Al-Bawani, Matthias Englert, Matthias Westermann:
Online Packet Scheduling for CIOQ and Buffered Crossbar Switches. SPAA 2016: 241-250 - [r1]Matthias Englert, Matthias Westermann:
Scheduling with a Reordering Buffer. Encyclopedia of Algorithms 2016: 1905-1910 - 2014
- [j8]Matthias Englert, Deniz Özmen, Matthias Westermann:
The Power of Reordering for Online Minimum Makespan Scheduling. SIAM J. Comput. 43(3): 1220-1237 (2014) - 2012
- [j7]Matthias Westermann:
Editorial to the special issue "Online algorithms". Comput. Sci. Res. Dev. 27(3): 167-168 (2012) - [j6]Matthias Englert, Matthias Westermann:
Considering Suppressed Packets Improves Buffer Management in Quality of Service Switches. SIAM J. Comput. 41(5): 1166-1192 (2012) - 2010
- [j5]Matthias Englert, Harald Räcke, Matthias Westermann:
Reordering Buffers for General Metric Spaces. Theory Comput. 6(1): 27-46 (2010)
2000 – 2009
- 2009
- [j4]Matthias Englert, Matthias Westermann:
Lower and Upper Bounds on FIFO Buffer Management in QoS Switches. Algorithmica 53(4): 523-548 (2009) - [j3]Matthias Englert, Heiko Röglin, Matthias Westermann:
Evaluation of online strategies for reordering buffers. ACM J. Exp. Algorithmics 14 (2009) - 2008
- [c17]Matthias Englert, Deniz Özmen, Matthias Westermann:
The Power of Reordering for Online Minimum Makespan Scheduling. FOCS 2008: 603-612 - 2007
- [c16]Matthias Englert, Matthias Westermann:
Considering suppressed packets improves buffer management in QoS switches. SODA 2007: 209-218 - [c15]Matthias Englert, Harald Räcke, Matthias Westermann:
Reordering buffers for general metric spaces. STOC 2007: 556-564 - 2006
- [c14]Matthias Englert, Matthias Westermann:
Lower and Upper Bounds on FIFO Buffer Management in QoS Switches. ESA 2006: 352-363 - [c13]Matthias Englert, Heiko Röglin, Matthias Westermann:
Evaluation of Online Strategies for Reordering Buffers. WEA 2006: 183-194 - 2005
- [c12]Matthias Englert, Matthias Westermann:
Reordering Buffer Management for Non-uniform Cost Models. ICALP 2005: 627-638 - 2004
- [c11]Jens Krokowski, Harald Räcke, Christian Sohler, Matthias Westermann:
Reducing State Changes with a Pipeline Buffer. VMV 2004: 217 - 2003
- [j2]Christof Krick, Harald Räcke, Matthias Westermann:
Approximation Algorithms for Data Management in Networks. Theory Comput. Syst. 36(5): 497-519 (2003) - 2002
- [j1]Christof Krick, Friedhelm Meyer auf der Heide, Harald Räcke, Berthold Vöcking, Matthias Westermann:
Data Management in Networks: Experimental Evaluation of a Provably Good Strategy. Theory Comput. Syst. 35(2): 217-245 (2002) - [c10]Harald Räcke, Christian Sohler, Matthias Westermann:
Online Scheduling for Sorting Buffers. ESA 2002: 820-832 - [c9]Matthias Westermann:
Distributed caching independent of the network size. SPAA 2002: 31-40 - 2001
- [c8]Christof Krick, Harald Räcke, Matthias Westermann:
Approximation algorithms for data management in networks. SPAA 2001: 237-246 - 2000
- [b1]Matthias Westermann:
Caching in networks: non uniform algorithms and memory capacity constraints. University of Paderborn, Germany, 2000, ISBN 978-3-931466-89-3, pp. 1-85 - [c7]Friedhelm Meyer auf der Heide, Berthold Vöcking, Matthias Westermann:
Caching in networks (extended abstract). SODA 2000: 430-439 - [c6]Friedhelm Meyer auf der Heide, Harald Räcke, Matthias Westermann:
Data management in hierarchical bus networks. SPAA 2000: 109-118
1990 – 1999
- 1999
- [c5]Friedhelm Meyer auf der Heide, Berthold Vöcking, Matthias Westermann:
Provably Good and Practical Strategies for Non-Uniform Data Management in Networks. ESA 1999: 89-100 - [c4]Matthias Westermann:
Caching in Networks. GI Jahrestagung 1999: 297-304 - [c3]Christof Krick, Friedhelm Meyer auf der Heide, Harald Räcke, Berthold Vöcking, Matthias Westermann:
Data Management in Networks: Experimental Evaluation of a Provably Good Strategy. SPAA 1999: 165-174 - 1997
- [c2]Bruce M. Maggs, Friedhelm Meyer auf der Heide, Berthold Vöcking, Matthias Westermann:
Exploiting Locality for Data Management in Systems of Limited Bandwidth. FOCS 1997: 284-293 - 1995
- [c1]Friedhelm Meyer auf der Heide, Matthias Westermann:
Hot-Potato Routing on Multi-Dimensional Tori. WG 1995: 209-221
Coauthor Index
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-04-25 05:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
