Matthias Englert

70 papers A* 16A 7B 6Journal 33Unranked 6
YearRankTypeTitle / Venue / Authors
2026 J jnl
Velocity and stroke rate reconstruction of canoe sprint team boats based on panned and zoomed video recordings.
CoRR
Julian Ziegler, Daniel Matthes, Finn Gerdts, Patrick Frenzel, Torsten Warnke, Matthias Englert, Tina Koevari, Mirco Fuchs
2025 B ed.
Approximation and Online Algorithms - 22nd International Workshop, WAOA 2024, Egham, UK, September 5-6, 2024, Proceedings
WAOA
Marcin Bienkowski, Matthias Englert
2025 J jnl
Benignity of loss landscape with weight decay requires both large overparametrization and initialization.
CoRR
Etienne Boursier, Matthew Bowditch, Matthias Englert, Ranko Lazic
2025 J jnl
Variance Dichotomy in Feature Spaces of Facial Recognition Systems is a Weak Defense against Simple Weight Manipulation Attacks.
Trans. Mach. Learn. Res.
Matthew Bowditch, Mike Paterson, Matthias Englert, Ranko Lazic
2024 J jnl
Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop.
ACM Trans. Algorithms
Antonios Antoniadis, Matthias Englert, Nicolaos Matsakis, Pavel Veselý
2024 J jnl
Implicit Regularization of AdaDelta.
Trans. Mach. Learn. Res.
Matthias Englert, Ranko Lazic, Avi Semler
2023 B conf
Approximation Guarantees for Shortest Superstrings: Simpler and Better.
ISAAC
Matthias Englert, Nicolaos Matsakis, Pavel Veselý
2023 A* conf
Learning a Neuron by a Shallow ReLU Network: Dynamics and Implicit Bias for Correlated Inputs.
NeurIPS
Dmitry Chistikov, Matthias Englert, Ranko Lazic
2023 J jnl
Learning a Neuron by a Shallow ReLU Network: Dynamics and Implicit Bias for Correlated Inputs.
CoRR
Dmitry Chistikov, Matthias Englert, Ranko Lazic
2023 J jnl
Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP.
CoRR
Matthias Englert, Heiko Röglin, Berthold Vöcking
2022 A* conf
Adversarial Reprogramming Revisited.
NeurIPS
Matthias Englert, Ranko Lazic
2022 J jnl
Adversarial Reprogramming Revisited.
CoRR
Matthias Englert, Ranko Lazic
2022 J jnl
Almost Tight Bounds for Reordering Buffer Management.
SIAM J. Comput.
Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke
2022 A* conf
Improved approximation guarantees for shortest superstrings using cycle classification by overlap to length ratios.
STOC
Matthias Englert, Nicolaos Matsakis, Pavel Veselý
2021 J jnl
A lower bound for the coverability problem in acyclic pushdown VAS.
Inf. Process. Lett.
Matthias Englert, Piotr Hofman, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Juliusz Straszynski
2021 A* conf
Breaking the Barrier Of 2 for the Competitiveness of Longest Queue Drop.
ICALP
Antonios Antoniadis, Matthias Englert, Nicolaos Matsakis, Pavel Veselý
2021 J jnl
Improved Approximation Guarantees for Shortest Superstrings using Cycle Classification by Overlap to Length Ratios.
CoRR
Matthias Englert, Nicolaos Matsakis, Pavel Veselý
2021 — conf
Modeling Asteroid (101955) Bennu as a Real-time Terrain.
SIGGRAPH Talks
Matthias Englert
2021 J jnl
Online Makespan Scheduling with Job Migration on Uniform Machines.
Algorithmica
Matthias Englert, David Mezlaf, Matthias Westermann
2021 J jnl
The Reachability Problem for Two-Dimensional Vector Addition Systems with States.
J. ACM
Michael Blondin, Matthias Englert, Alain Finkel, Stefan Göller, Christoph Haase, Ranko Lazic, Pierre McKenzie, Patrick Totzke
2020 J jnl
Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop.
CoRR
Antonios Antoniadis, Matthias Englert, Nicolaos Matsakis, Pavel Veselý
2020 — conf
Using Mesh Shaders for Continuous Level-of-Detail Terrain Rendering.
SIGGRAPH Talks
Matthias Englert
2019 J jnl
An
ACM Trans. Algorithms
Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke
2019 A* conf
Polylogarithmic Guarantees for Generalized Reordering Buffer Management.
FOCS
Matthias Englert, Harald Räcke, Richard Stotz
2018 J jnl
Comparison-Based Buffer Management in QoS Switches.
Algorithmica
Kamal Al-Bawani, Matthias Englert, Matthias Westermann
2018 A conf
Online Makespan Scheduling with Job Migration on Uniform Machines.
ESA
Matthias Englert, David Mezlaf, Matthias Westermann
2018 J jnl
Online Packet Scheduling for CIOQ and Buffered Crossbar Switches.
Algorithmica
Kamal Al-Bawani, Matthias Englert, Matthias Westermann
2018 J jnl
The reordering buffer problem on the line revisited.
SIGACT News
Matthias Englert
2017 A* conf
Reordering Buffers with Logarithmic Diameter Dependency for Trees.
SODA
Matthias Englert, Harald Räcke
2016 B conf
Comparison-Based FIFO Buffer Management in QoS Switches.
LATIN
Kamal Al-Bawani, Matthias Englert, Matthias Westermann
2016 B conf
Online Packet Scheduling for CIOQ and Buffered Crossbar Switches.
SPAA
Kamal Al-Bawani, Matthias Englert, Matthias Westermann
2016 A* conf
Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete.
LICS
Matthias Englert, Ranko Lazic, Patrick Totzke
2016 J jnl
Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete.
CoRR
Matthias Englert, Ranko Lazic, Patrick Totzke
2016 — ch.
Scheduling with a Reordering Buffer.
Encyclopedia of Algorithms
Matthias Englert, Matthias Westermann
2016 J jnl
Smoothed Analysis of the 2-Opt Algorithm for the General TSP.
ACM Trans. Algorithms
Matthias Englert, Heiko Röglin, Berthold Vöcking
2014 A conf
Generalized Reordering Buffer Management.
STACS
Yossi Azar, Matthias Englert, Iftah Gamzu, Eytan Kidron
2014 J jnl
Logical Limitations to Machine Ethics with Consequences to Lethal Autonomous Weapons.
CoRR
Matthias Englert, Sandra Siebert, Martin Ziegler
2014 B conf
New Bounds for Online Packing LPs.
LATIN
Matthias Englert, Nicolaos Matsakis, Marcin Mucha
2014 J jnl
The Power of Reordering for Online Minimum Makespan Scheduling.
SIAM J. Comput.
Matthias Englert, Deniz Özmen, Matthias Westermann
2014 J jnl
Vertex Sparsifiers: New Results from Old Techniques.
SIAM J. Comput.
Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, Kunal Talwar
2014 J jnl
Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP.
Algorithmica
Matthias Englert, Heiko Röglin, Berthold Vöcking
2013 A conf
Catch them if you can: how to serve impatient users.
ITCS
Marek Cygan, Matthias Englert, Anupam Gupta, Marcin Mucha, Piotr Sankowski
2013 J jnl
Economical Caching.
ACM Trans. Comput. Theory
Matthias Englert, Heiko Röglin, Jacob Spönemann, Berthold Vöcking
2012 A* conf
An
SODA
Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke
2012 J jnl
An overview of some results for reordering buffers.
Comput. Sci. Res. Dev.
Matthias Englert
2012 J jnl
Considering Suppressed Packets Improves Buffer Management in Quality of Service Switches.
SIAM J. Comput.
Matthias Englert, Matthias Westermann
2012 — conf
Multiple-Choice Balanced Allocation in (Almost) Parallel.
APPROX-RANDOM
Petra Berenbrink, Artur Czumaj, Matthias Englert, Tom Friedetzky, Lars Nagel
2012 A* conf
Optimal online buffer scheduling for block devices.
STOC
Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke
2011 A* conf
Almost tight bounds for reordering buffer management.
STOC
Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke
2010 J jnl
Reordering Buffers for General Metric Spaces.
Theory Comput.
Matthias Englert, Harald Räcke, Matthias Westermann
2010 J jnl
Sensitivity of Wardrop Equilibria.
Theory Comput. Syst.
Matthias Englert, Thomas Franke, Lars Olbrich
2010 J jnl
Vertex Sparsifiers: New Results from Old Techniques
CoRR
Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, Kunal Talwar
2010 — conf
Vertex Sparsifiers: New Results from Old Techniques.
APPROX-RANDOM
Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, Kunal Talwar
2009 — conf
Economical Caching with Stochastic Prices.
SAGA
Matthias Englert, Berthold Vöcking, Melanie Winkler
2009 A conf
Economical Caching.
STACS
Matthias Englert, Heiko Röglin, Jacob Spönemann, Berthold Vöcking
2009 J jnl
Evaluation of online strategies for reordering buffers.
ACM J. Exp. Algorithmics
Matthias Englert, Heiko Röglin, Matthias Westermann
2009 J jnl
Lower and Upper Bounds on FIFO Buffer Management in QoS Switches.
Algorithmica
Matthias Englert, Matthias Westermann
2009 A* conf
Oblivious Routing for the Lp-norm.
FOCS
Matthias Englert, Harald Räcke
2008 — —
Online scheduling for buffering problems.
Matthias Englert
2008 B conf
Sensitivity of Wardrop Equilibria.
SAGT
Matthias Englert, Thomas Franke, Lars Olbrich
2008 A* conf
The Power of Reordering for Online Minimum Makespan Scheduling.
FOCS
Matthias Englert, Deniz Özmen, Matthias Westermann
2007 A* conf
Considering suppressed packets improves buffer management in QoS switches.
SODA
Matthias Englert, Matthias Westermann
2007 A* conf
Reordering buffers for general metric spaces.
STOC
Matthias Englert, Harald Räcke, Matthias Westermann
2007 A* conf
Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP: extended abstract.
SODA
Matthias Englert, Heiko Röglin, Berthold Vöcking
2006 — conf
Evaluation of Online Strategies for Reordering Buffers.
WEA
Matthias Englert, Heiko Röglin, Matthias Westermann
2006 A conf
Lower and Upper Bounds on FIFO Buffer Management in QoS Switches.
ESA
Matthias Englert, Matthias Westermann
2006 J jnl
Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP.
Electron. Colloquium Comput. Complex.
Matthias Englert, Heiko Röglin, Berthold Vöcking
2005 A* conf
Reordering Buffer Management for Non-uniform Cost Models.
ICALP
Matthias Englert, Matthias Westermann
2004 A conf
Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization.
PPSN
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
2004 A conf
The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes.
PPSN
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