Matthias Englert

According to our database1, Matthias Englert authored at least 36 papers between 2004 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
An O(log k)-Competitive Algorithm for Generalized Caching.
ACM Trans. Algorithms, 2019

Polylogarithmic Guarantees for Generalized Reordering Buffer Management.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018
The reordering buffer problem on the line revisited.
SIGACT News, 2018

Online Packet Scheduling for CIOQ and Buffered Crossbar Switches.
Algorithmica, 2018

Comparison-Based Buffer Management in QoS Switches.
Algorithmica, 2018

Online Makespan Scheduling with Job Migration on Uniform Machines.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017
Reordering Buffers with Logarithmic Diameter Dependency for Trees.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
Scheduling with a Reordering Buffer.
Encyclopedia of Algorithms, 2016

Smoothed Analysis of the 2-Opt Algorithm for the General TSP.
ACM Trans. Algorithms, 2016

Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Comparison-Based FIFO Buffer Management in QoS Switches.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2014
The Power of Reordering for Online Minimum Makespan Scheduling.
SIAM J. Comput., 2014

Vertex Sparsifiers: New Results from Old Techniques.
SIAM J. Comput., 2014

Logical Limitations to Machine Ethics with Consequences to Lethal Autonomous Weapons.
CoRR, 2014

Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP.
Algorithmica, 2014

Generalized Reordering Buffer Management.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

New Bounds for Online Packing LPs.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

2013
Economical Caching.
TOCT, 2013

Catch them if you can: how to serve impatient users.
Proceedings of the Innovations in Theoretical Computer Science, 2013

2012
Considering Suppressed Packets Improves Buffer Management in Quality of Service Switches.
SIAM J. Comput., 2012

An overview of some results for reordering buffers.
Computer Science - R&D, 2012

Optimal online buffer scheduling for block devices.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Multiple-Choice Balanced Allocation in (Almost) Parallel.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2011
Almost tight bounds for reordering buffer management.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

2010
Reordering Buffers for General Metric Spaces.
Theory of Computing, 2010

Sensitivity of Wardrop Equilibria.
Theory Comput. Syst., 2010

2009
Evaluation of online strategies for reordering buffers.
ACM Journal of Experimental Algorithmics, 2009

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

Economical Caching with Stochastic Prices.
Proceedings of the Stochastic Algorithms: Foundations and Applications, 2009

Oblivious Routing for the Lp-norm.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

2008
Online scheduling for buffering problems.
PhD thesis, 2008

2007
Considering suppressed packets improves buffer management in QoS switches.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP: extended abstract.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2005
Reordering Buffer Management for Non-uniform Cost Models.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004
The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes.
Proceedings of the Parallel Problem Solving from Nature, 2004

Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization.
Proceedings of the Parallel Problem Solving from Nature, 2004


  Loading...