Matthias Englert

Publication Activity (10 Years)

Years Active: 2004-2023
Publications (10 Years): 28

Top Venues

CoRR

Algorithmica

SIAM J. Comput.

LATIN

RWTH Aachen University, Germany (PHD)

Education History

RWTH Aachen University, Germany

PHD

Publications

Matthias Englert, Heiko Röglin, Berthold Vöcking
Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP. CoRR (2023)
Matthias Englert, Nicolaos Matsakis, Pavel Veselý
Approximation Guarantees for Shortest Superstrings: Simpler and Better. ISAAC (2023)
Dmitry Chistikov, Matthias Englert, Ranko Lazic
Learning a Neuron by a Shallow ReLU Network: Dynamics and Implicit Bias for Correlated Inputs. CoRR (2023)
Dmitry Chistikov, Matthias Englert, Ranko Lazic
Learning a Neuron by a Shallow ReLU Network: Dynamics and Implicit Bias for Correlated Inputs. NeurIPS (2023)
Matthias Englert, Nicolaos Matsakis, Pavel Veselý
Improved approximation guarantees for shortest superstrings using cycle classification by overlap to length ratios. STOC (2022)
Matthias Englert, Ranko Lazic
Adversarial Reprogramming Revisited. NeurIPS (2022)
Matthias Englert, Ranko Lazic
Adversarial Reprogramming Revisited. CoRR (2022)
Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke
Almost Tight Bounds for Reordering Buffer Management. SIAM J. Comput. 51 (3) (2022)
Matthias Englert, Nicolaos Matsakis, Pavel Veselý
Improved Approximation Guarantees for Shortest Superstrings using Cycle Classification by Overlap to Length Ratios. CoRR (2021)
Matthias Englert, David Mezlaf, Matthias Westermann
Online Makespan Scheduling with Job Migration on Uniform Machines. Algorithmica 83 (12) (2021)
Antonios Antoniadis, Matthias Englert, Nicolaos Matsakis, Pavel Veselý
Breaking the Barrier Of 2 for the Competitiveness of Longest Queue Drop. ICALP (2021)
Matthias Englert, Piotr Hofman, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Juliusz Straszynski
A lower bound for the coverability problem in acyclic pushdown VAS. Inf. Process. Lett. 167 (2021)
Matthias Englert
Modeling Asteroid (101955) Bennu as a Real-time Terrain. SIGGRAPH Talks (2021)
Michael Blondin, Matthias Englert, Alain Finkel, Stefan Göller, Christoph Haase, Ranko Lazic, Pierre McKenzie, Patrick Totzke
The Reachability Problem for Two-Dimensional Vector Addition Systems with States. J. ACM 68 (5) (2021)
Antonios Antoniadis, Matthias Englert, Nicolaos Matsakis, Pavel Veselý
Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop. CoRR (2020)
Matthias Englert
Using Mesh Shaders for Continuous Level-of-Detail Terrain Rendering. SIGGRAPH Talks (2020)
Matthias Englert, Harald Räcke, Richard Stotz
Polylogarithmic Guarantees for Generalized Reordering Buffer Management. FOCS (2019)
Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke
)-Competitive Algorithm for Generalized Caching. ACM Trans. Algorithms 15 (1) (2019)
Matthias Englert, David Mezlaf, Matthias Westermann
Online Makespan Scheduling with Job Migration on Uniform Machines. ESA (2018)
Matthias Englert
The reordering buffer problem on the line revisited. SIGACT News 49 (1) (2018)
Kamal Al-Bawani, Matthias Englert, Matthias Westermann
Online Packet Scheduling for CIOQ and Buffered Crossbar Switches. Algorithmica 80 (12) (2018)
Kamal Al-Bawani, Matthias Englert, Matthias Westermann
Comparison-Based Buffer Management in QoS Switches. Algorithmica 80 (3) (2018)
Matthias Englert, Harald Räcke
Reordering Buffers with Logarithmic Diameter Dependency for Trees. SODA (2017)
Matthias Englert, Heiko Röglin, Berthold Vöcking
Smoothed Analysis of the 2-Opt Algorithm for the General TSP. ACM Trans. Algorithms 13 (1) (2016)
Matthias Englert, Ranko Lazic, Patrick Totzke
Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete. LICS (2016)
Matthias Englert, Ranko Lazic, Patrick Totzke
Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete. CoRR (2016)
Kamal Al-Bawani, Matthias Englert, Matthias Westermann
Comparison-Based FIFO Buffer Management in QoS Switches. LATIN (2016)
Kamal Al-Bawani, Matthias Englert, Matthias Westermann
Online Packet Scheduling for CIOQ and Buffered Crossbar Switches. SPAA (2016)
Yossi Azar, Matthias Englert, Iftah Gamzu, Eytan Kidron
Generalized Reordering Buffer Management. STACS (2014)
Matthias Englert, Heiko Röglin, Berthold Vöcking
Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP. Algorithmica 68 (1) (2014)
Matthias Englert, Deniz Özmen, Matthias Westermann
The Power of Reordering for Online Minimum Makespan Scheduling. SIAM J. Comput. 43 (3) (2014)
Matthias Englert, Sandra Siebert, Martin Ziegler
Logical Limitations to Machine Ethics with Consequences to Lethal Autonomous Weapons. CoRR (2014)
Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, Kunal Talwar
Vertex Sparsifiers: New Results from Old Techniques. SIAM J. Comput. 43 (4) (2014)
Matthias Englert, Nicolaos Matsakis, Marcin Mucha
New Bounds for Online Packing LPs. LATIN (2014)
Marek Cygan, Matthias Englert, Anupam Gupta, Marcin Mucha, Piotr Sankowski
Catch them if you can: how to serve impatient users. ITCS (2013)
Matthias Englert, Heiko Röglin, Jacob Spönemann, Berthold Vöcking
Economical Caching. ACM Trans. Comput. Theory 5 (2) (2013)
Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke
Optimal online buffer scheduling for block devices. STOC (2012)
Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke
)-competitive algorithm for generalized caching. SODA (2012)
Matthias Englert, Matthias Westermann
Considering Suppressed Packets Improves Buffer Management in Quality of Service Switches. SIAM J. Comput. 41 (5) (2012)
Petra Berenbrink, Artur Czumaj, Matthias Englert, Tom Friedetzky, Lars Nagel
Multiple-Choice Balanced Allocation in (Almost) Parallel. APPROX-RANDOM (2012)
Matthias Englert
An overview of some results for reordering buffers. Comput. Sci. Res. Dev. 27 (3) (2012)
Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke
Almost tight bounds for reordering buffer management. STOC (2011)
Matthias Englert, Thomas Franke, Lars Olbrich
Sensitivity of Wardrop Equilibria. Theory Comput. Syst. 47 (1) (2010)
Matthias Englert, Harald Räcke, Matthias Westermann
Reordering Buffers for General Metric Spaces. Theory Comput. 6 (1) (2010)
Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, Kunal Talwar
Vertex Sparsifiers: New Results from Old Techniques. APPROX-RANDOM (2010)
Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, Kunal Talwar
Vertex Sparsifiers: New Results from Old Techniques CoRR (2010)
Matthias Englert, Berthold Vöcking, Melanie Winkler
Economical Caching with Stochastic Prices. SAGA (2009)
Matthias Englert, Harald Räcke
Oblivious Routing for the Lp-norm. FOCS (2009)
Matthias Englert, Heiko Röglin, Matthias Westermann
Evaluation of online strategies for reordering buffers. ACM J. Exp. Algorithmics 14 (2009)
Matthias Englert, Heiko Röglin, Jacob Spönemann, Berthold Vöcking
Economical Caching. STACS (2009)
Matthias Englert, Matthias Westermann
Lower and Upper Bounds on FIFO Buffer Management in QoS Switches. Algorithmica 53 (4) (2009)
Matthias Englert, Thomas Franke, Lars Olbrich
Sensitivity of Wardrop Equilibria. SAGT (2008)
Matthias Englert, Deniz Özmen, Matthias Westermann
The Power of Reordering for Online Minimum Makespan Scheduling. FOCS (2008)
Matthias Englert, Harald Räcke, Matthias Westermann
Reordering buffers for general metric spaces. STOC (2007)
Matthias Englert, Matthias Westermann
Considering suppressed packets improves buffer management in QoS switches. SODA (2007)
Matthias Englert, Heiko Röglin, Berthold Vöcking
Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP: extended abstract. SODA (2007)
Matthias Englert, Matthias Westermann
Lower and Upper Bounds on FIFO Buffer Management in QoS Switches. ESA (2006)
Matthias Englert, Heiko Röglin, Berthold Vöcking
Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP. Electron. Colloquium Comput. Complex. 13 (092) (2006)
Matthias Englert, Heiko Röglin, Matthias Westermann
Evaluation of Online Strategies for Reordering Buffers. WEA (2006)
Matthias Englert, Matthias Westermann
Reordering Buffer Management for Non-uniform Cost Models. ICALP (2005)
Patrick Briest, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian Gunia, Oliver Heering, Thomas Jansen, Michael Leifhelm, Kai Plociennik, Heiko Röglin, Andrea Schweer, Dirk Sudholt, Stefan Tannenbaum, Ingo Wegener
The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes. PPSN (2004)
Patrick Briest, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian Gunia, Oliver Heering, Thomas Jansen, Michael Leifhelm, Kai Plociennik, Heiko Röglin, Andrea Schweer, Dirk Sudholt, Stefan Tannenbaum, Ingo Wegener
Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization. PPSN (2004)

Matthias Englert.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Matthias Englert