Generalized Reordering Buffer Management
Eytan Kidron , Matthias Englert , Yossi Azar , Iftah Gamzu
symposium on theoretical aspects of computer science 25 87 -98
2
2014
Reordering buffers with logarithmic diameter dependency for trees
Harald Räcke , Matthias Englert
symposium on discrete algorithms 1224 -1234
4
2017
Reordering buffer management for non-uniform cost models
Matthias Englert , Matthias Westermann
international colloquium on automata languages and programming 627 -638
43
2005
Comparison-Based Buffer Management in QoS Switches
Kamal Al-Bawani , Matthias Englert , Matthias Westermann
Algorithmica 80 ( 3) 1073 -1092
2018
Lower and Upper Bounds on FIFO Buffer Management in QoS Switches
Matthias Englert , Matthias Westermann
Algorithmica 53 ( 4) 523 -548
48
2009
Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP
Matthias Englert , Heiko Röglin , Berthold Vöcking
Algorithmica 68 ( 1) 190 -264
199
2014
The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes
Patrick Briest , Dimo Brockhoff , Bastian Degener , Matthias Englert
parallel problem solving from nature 31 -40
5
2004
Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization
Patrick Briest , Dimo Brockhoff , Bastian Degener , Matthias Englert
parallel problem solving from nature 21 -30
13
2004
An O(log k)-Competitive Algorithm for Generalized Caching
Anna Adamaszek , Artur Czumaj , Matthias Englert , Harald Räcke
ACM Transactions on Algorithms 15 ( 1) 6
1
2018
Economical caching with stochastic prices
Matthias Englert , Berthold Vöcking , Melanie Winkler
international conference on stochastic algorithms foundations and applications 179 -190
3
2009
Smoothed Analysis of the 2-Opt Algorithm for the General TSP
Matthias Englert , Heiko Röglin , Berthold Vöcking
ACM Transactions on Algorithms 13 ( 1) 10
6
2016
A lower bound for the coverability problem in acyclic pushdown VAS
Matthias Englert , Piotr Hofman , Sławomir Lasota , Ranko Lazić
Information Processing Letters 167 106079
2021
Oblivious Routing for the Lp-norm
Matthias Englert , Harald Räcke
2009 50th Annual IEEE Symposium on Foundations of Computer Science 32 -40
13
2009
Polylogarithmic Guarantees for Generalized Reordering Buffer Management
Matthias Englert , Harald Racke , Richard Stotz
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) 38 -59
2019
Considering Suppressed Packets Improves Buffer Management in Quality of Service Switches
Matthias Englert , Matthias Westermann
SIAM Journal on Computing 41 ( 5) 1166 -1192
13
2012
New bounds for online packing LPs
Matthias Englert , Nicolaos Matsakis , Marcin Mucha
latin american symposium on theoretical informatics 318 -329
2014
Reordering buffers for general metric spaces
Matthias Englert , Harald Räcke , Matthias Westermann
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing - STOC '07 556 -564
14
2007
Multiple-Choice Balanced Allocation in (Almost) Parallel
Petra Berenbrink , Artur Czumaj , Matthias Englert , Tom Friedetzky
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques 411 -422
13
2012