Matthias Englert

Available identifiers

zbMath Open englert.matthiasMaRDI QIDQ987395

List of research outcomes

Publication	Date of Publication	Type
Improved approximation guarantees for shortest superstrings using cycle classification by overlap to length ratios	2023-12-08	Paper
The Reachability Problem for Two-Dimensional Vector Addition Systems with States	2022-12-08	Paper
Almost Tight Bounds for Reordering Buffer Management	2022-06-08	Paper
Online makespan scheduling with job migration on uniform machines	2022-01-18	Paper
Online Makespan Scheduling with Job Migration on Uniform Machines	2021-08-04	Paper
A lower bound for the coverability problem in acyclic pushdown VAS	2021-03-11	Paper
An \(O(\log k)\)-competitive algorithm for generalized caching	2019-05-10	Paper
An \(O(\log k)\)-competitive algorithm for generalized caching	2019-03-28	Paper
Smoothed analysis of the 2-Opt algorithm for the general TSP	2018-11-05	Paper
Online packet scheduling for CIOQ and buffered crossbar switches	2018-10-18	Paper
Reordering buffers with logarithmic diameter dependency for trees	2018-07-16	Paper
Reachability in two-dimensional unary vector addition systems with states is NL-complete	2018-04-23	Paper
Comparison-based buffer management in QoS switches	2018-04-11	Paper
Catch them if you can	2017-05-16	Paper
Generalized Reordering Buffer Management	2017-03-03	Paper
Comparison-based FIFO buffer management in QoS switches	2016-05-03	Paper
Economical caching	2015-09-24	Paper
Considering suppressed packets improves buffer management in QoS switches	2014-12-18	Paper
Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP (extended abstract)	2014-12-18	Paper
Vertex sparsifiers: new results from old techniques	2014-11-14	Paper
The Power of Reordering for Online Minimum Makespan Scheduling	2014-09-18	Paper
Oblivious Routing for the Lp-norm	2014-07-25	Paper
Almost tight bounds for reordering buffer management	2014-06-05	Paper
Optimal online buffer scheduling for block devices	2014-05-13	Paper
Evaluation of online strategies for reordering buffers	2014-04-01	Paper
New bounds for online packing LPs	2014-03-31	Paper
Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP	2014-03-25	Paper
Considering suppressed packets improves buffer management in quality of service switches	2013-02-04	Paper
Multiple-choice balanced allocation in (almost) parallel	2012-11-02	Paper
Economical caching	2012-04-24	Paper
https://portal.mardi4nfdi.de/entity/Q3002815	2011-05-24	Paper
Vertex Sparsifiers: New Results from Old Techniques	2010-09-10	Paper
Sensitivity of Wardrop equilibria	2010-08-13	Paper
Economical Caching with Stochastic Prices	2009-11-19	Paper
Lower and upper bounds on FIFO buffer management in QoS switches	2009-05-06	Paper
https://portal.mardi4nfdi.de/entity/Q3549655	2009-01-05	Paper
Sensitivity of Wardrop Equilibria	2008-05-02	Paper
Lower and Upper Bounds on FIFO Buffer Management in QoS Switches	2008-03-11	Paper
Evaluation of Online Strategies for Reordering Buffers	2007-09-14	Paper
Automata, Languages and Programming	2006-01-10	Paper

Research outcomes over time

This page was built for person: Matthias Englert