Matthias Westermann

Algorithmica, 2018

Online Makespan Scheduling with Job Migration on Uniform Machines.

[BibT_eX]

[DOI]

David Mezlaf

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2016

Scheduling with a Reordering Buffer.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Online Packet Scheduling for CIOQ and Buffered Crossbar Switches.

[BibT_eX]

[DOI]

Kamal Al-Bawani

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Comparison-Based FIFO Buffer Management in QoS Switches.

[BibT_eX]

[DOI]

Kamal Al-Bawani

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2012

Considering Suppressed Packets Improves Buffer Management in Quality of Service Switches.

[BibT_eX]

[DOI]

SIAM J. Comput., 2012

Editorial to the special issue "Online algorithms".

[BibT_eX]

[DOI]

Comput. Sci. Res. Dev., 2012

2008

The Power of Reordering for Online Minimum Makespan Scheduling.

[BibT_eX]

[DOI]

Deniz Özmen

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007

Reordering buffers for general metric spaces.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Considering suppressed packets improves buffer management in QoS switches.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006

Evaluation of Online Strategies for Reordering Buffers.

[BibT_eX]

[DOI]

Heiko Röglin

Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

Lower and Upper Bounds on FIFO Buffer Management in QoS Switches.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2006

2005

Reordering Buffer Management for Non-uniform Cost Models.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004

Reducing State Changes with a Pipeline Buffer.

[BibT_eX]

Proceedings of the 9th International Fall Workshop on Vision, Modeling, and Visualization, 2004

2002

Distributed caching independent of the network size.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2002

Online Scheduling for Sorting Buffers.

[BibT_eX]

[DOI]

Christian Sohler

Proceedings of the Algorithms, 2002

2001

Approximation algorithms for data management in networks.

[BibT_eX]

[DOI]

Christof Krick

Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

2000

Caching in networks: non uniform algorithms and memory capacity constraints.

[BibT_eX]

[DOI]

PhD thesis, 2000

Data management in hierarchical bus networks.

[BibT_eX]

[DOI]

Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, 2000

Caching in networks (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999

Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.

[BibT_eX]

[DOI]

Christof Krick

Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, 1999

Caching in Networks.

[BibT_eX]

[DOI]

Proceedings of the Informatik '99, 1999

Provably Good and Practical Strategies for Non-Uniform Data Management in Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1999

1997

Exploiting Locality for Data Management in Systems of Limited Bandwidth.

[BibT_eX]

[DOI]

Bruce M. Maggs

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1995

Hot-Potato Routing on Multi-Dimensional Tori.

[BibT_eX]

[DOI]