Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Westermann, Matthias"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The power of reordering for online minimum makespan scheduling
Matthias Englert
,
Deniz Özmen
,
Matthias Westermann
SIAM Journal on Computing
43
(3), 2014, pp. 1220-1237
Considering suppressed packets improves buffer management in quality of service switches
Matthias Englert
,
Matthias Westermann
SIAM Journal on Computing
41
(5), 2012, pp. 1166-1192
Lower and upper bounds on FIFO buffer management in QoS switches
Matthias Englert
,
Matthias Westermann
Algorithmica
53
(4), 2009, pp. 523-548
Reordering buffers for general metric spaces
Matthias Englert
,
Harald Räcke
,
Matthias Westermann
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007)
, 2007, pp. 556-564
Lower and upper bounds on FIFO buffer management in QoS switches
Matthias Englert
,
Matthias Westermann
Lecture Notes in Computer Science
4168
, 2006, pp. 352-363
Reordering buffer management for non-uniform cost models
Matthias Englert
,
Matthias Westermann
Lecture Notes in Computer Science
3580
, 2005, pp. 627-638
Approximation algorithms for data management in networks
Christof Krick
,
Harald Räcke
,
Matthias Westermann
Theory of Computing Systems
36
(5), 2003, pp. 497-519
Online scheduling for sorting buffers
Harald Räcke
,
Christian Sohler
,
Matthias Westermann
Lecture Notes in Computer Science
2461
, 2002, pp. 820-832
Distributed caching independent of the network size
Matthias Westermann
Proceedings of the 14th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'2002 (Winnipeg, Canada, August 10-13, 2002)
, 2002, pp. 31-40
Approximation algorithms for data management in networks
Christof Krick
,
Harald Räcke
,
Matthias Westermann
Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'2001 (Crete Island, Greece, July 3-6, 2001)
, 2001, pp. 237-246
Data management in networks: Experimental evaluation of a provably good strategy
Christof Krick
,
Friedhelm Meyer auf der Heide
,
Harald Räcke
,
Berthold Vöcking
,
Matthias Westermann
Proceedings of the 11th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'99 (Saint-Malo, France, June 27-30,1999)
, 1999, pp. 165-174
Provably good and practical strategies for non-uniform data management in networks
Friedhelm Meyer auf der Heide
,
Berthold Vöcking
,
Matthias Westermann
Lecture Notes in Computer Science
1643
, 1999, pp. 89-100
Exploiting locality for data management in systems of limited bandwidth
Bruce M. Maggs
,
Friedhelm Meyer auf der Heide
,
Berthold Vöcking
,
Matthias Westermann
Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, FOCS'97 (Miami Beach, Florida, October 20-22, 1997)
, 1997, pp. 284-293
Hot-potato routing on multi-dimensional tori
Friedhelm Meyer auf der Heide
,
Matthias Westermann
Lecture Notes in Computer Science
1017
, 1995, pp. 209-221