default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthias Englert
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j20]Antonios Antoniadis
, Matthias Englert, Nicolaos Matsakis, Pavel Veselý:
Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop. ACM Trans. Algorithms 20(4): 38:1-38:29 (2024)- 2023
- [c34]Matthias Englert, Nicolaos Matsakis, Pavel Veselý:
Approximation Guarantees for Shortest Superstrings: Simpler and Better. ISAAC 2023: 29:1-29:17 - [c33]Dmitry Chistikov, Matthias Englert, Ranko Lazic:
Learning a Neuron by a Shallow ReLU Network: Dynamics and Implicit Bias for Correlated Inputs. NeurIPS 2023 - [i9]Matthias Englert, Heiko Röglin, Berthold Vöcking:
Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP. CoRR abs/2302.06889 (2023) - [i8]Dmitry Chistikov, Matthias Englert, Ranko Lazic:
Learning a Neuron by a Shallow ReLU Network: Dynamics and Implicit Bias for Correlated Inputs. CoRR abs/2306.06479 (2023) - 2022
- [j19]Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke:
Almost Tight Bounds for Reordering Buffer Management. SIAM J. Comput. 51(3): 701-722 (2022) - [c32]Matthias Englert, Ranko Lazic:
Adversarial Reprogramming Revisited. NeurIPS 2022 - [c31]Matthias Englert, Nicolaos Matsakis, Pavel Veselý:
Improved approximation guarantees for shortest superstrings using cycle classification by overlap to length ratios. STOC 2022: 317-330 - [i7]Matthias Englert, Ranko Lazic:
Adversarial Reprogramming Revisited. CoRR abs/2206.03466 (2022) - 2021
- [j18]Matthias Englert, David Mezlaf, Matthias Westermann:
Online Makespan Scheduling with Job Migration on Uniform Machines. Algorithmica 83(12): 3537-3566 (2021) - [j17]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: 106079 (2021) - [j16]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): 34:1-34:43 (2021) - [c30]Antonios Antoniadis, Matthias Englert, Nicolaos Matsakis, Pavel Veselý:
Breaking the Barrier Of 2 for the Competitiveness of Longest Queue Drop. ICALP 2021: 17:1-17:20 - [c29]Matthias Englert:
Modeling Asteroid (101955) Bennu as a Real-time Terrain. SIGGRAPH Talks 2021: 22:1-22:2 - [i6]Matthias Englert, Nicolaos Matsakis, Pavel Veselý:
Improved Approximation Guarantees for Shortest Superstrings using Cycle Classification by Overlap to Length Ratios. CoRR abs/2111.03968 (2021) - 2020
- [c28]Matthias Englert:
Using Mesh Shaders for Continuous Level-of-Detail Terrain Rendering. SIGGRAPH Talks 2020: 44:1-44:2 - [i5]Antonios Antoniadis, Matthias Englert, Nicolaos Matsakis, Pavel Veselý:
Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop. CoRR abs/2012.03906 (2020)
2010 – 2019
- 2019
- [j15]Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke:
An O(log k)-Competitive Algorithm for Generalized Caching. ACM Trans. Algorithms 15(1): 6:1-6:18 (2019) - [c27]Matthias Englert, Harald Räcke, Richard Stotz:
Polylogarithmic Guarantees for Generalized Reordering Buffer Management. FOCS 2019: 38-59 - 2018
- [j14]Kamal Al-Bawani, Matthias Englert, Matthias Westermann:
Comparison-Based Buffer Management in QoS Switches. Algorithmica 80(3): 1073-1092 (2018) - [j13]Kamal Al-Bawani, Matthias Englert, Matthias Westermann:
Online Packet Scheduling for CIOQ and Buffered Crossbar Switches. Algorithmica 80(12): 3861-3888 (2018) - [j12]Matthias Englert:
The reordering buffer problem on the line revisited. SIGACT News 49(1): 67-72 (2018) - [c26]Matthias Englert, David Mezlaf, Matthias Westermann:
Online Makespan Scheduling with Job Migration on Uniform Machines. ESA 2018: 26:1-26:14 - 2017
- [c25]Matthias Englert, Harald Räcke:
Reordering Buffers with Logarithmic Diameter Dependency for Trees. SODA 2017: 1224-1234 - 2016
- [j11]Matthias Englert, Heiko Röglin, Berthold Vöcking:
Smoothed Analysis of the 2-Opt Algorithm for the General TSP. ACM Trans. Algorithms 13(1): 10:1-10:15 (2016) - [c24]Kamal Al-Bawani, Matthias Englert, Matthias Westermann:
Comparison-Based FIFO Buffer Management in QoS Switches. LATIN 2016: 27-40 - [c23]Matthias Englert, Ranko Lazic, Patrick Totzke:
Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete. LICS 2016: 477-484 - [c22]Kamal Al-Bawani, Matthias Englert, Matthias Westermann:
Online Packet Scheduling for CIOQ and Buffered Crossbar Switches. SPAA 2016: 241-250 - [r1]Matthias Englert, Matthias Westermann:
Scheduling with a Reordering Buffer. Encyclopedia of Algorithms 2016: 1905-1910 - [i4]Matthias Englert, Ranko Lazic, Patrick Totzke:
Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete. CoRR abs/1602.00477 (2016) - 2014
- [j10]Matthias Englert, Heiko Röglin, Berthold Vöcking:
Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP. Algorithmica 68(1): 190-264 (2014) - [j9]Matthias Englert, Deniz Özmen, Matthias Westermann:
The Power of Reordering for Online Minimum Makespan Scheduling. SIAM J. Comput. 43(3): 1220-1237 (2014) - [j8]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): 1239-1262 (2014) - [c21]Matthias Englert, Nicolaos Matsakis, Marcin Mucha:
New Bounds for Online Packing LPs. LATIN 2014: 318-329 - [c20]Yossi Azar, Matthias Englert, Iftah Gamzu, Eytan Kidron:
Generalized Reordering Buffer Management. STACS 2014: 87-98 - [i3]Matthias Englert, Sandra Siebert, Martin Ziegler:
Logical Limitations to Machine Ethics with Consequences to Lethal Autonomous Weapons. CoRR abs/1411.2842 (2014) - 2013
- [j7]Matthias Englert, Heiko Röglin, Jacob Spönemann, Berthold Vöcking:
Economical Caching. ACM Trans. Comput. Theory 5(2): 4:1-4:21 (2013) - [c19]Marek Cygan, Matthias Englert, Anupam Gupta, Marcin Mucha, Piotr Sankowski:
Catch them if you can: how to serve impatient users. ITCS 2013: 485-494 - 2012
- [j6]Matthias Englert:
An overview of some results for reordering buffers. Comput. Sci. Res. Dev. 27(3): 217-223 (2012) - [j5]Matthias Englert, Matthias Westermann:
Considering Suppressed Packets Improves Buffer Management in Quality of Service Switches. SIAM J. Comput. 41(5): 1166-1192 (2012) - [c18]Petra Berenbrink, Artur Czumaj, Matthias Englert, Tom Friedetzky, Lars Nagel:
Multiple-Choice Balanced Allocation in (Almost) Parallel. APPROX-RANDOM 2012: 411-422 - [c17]Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke:
An O(log k)-competitive algorithm for generalized caching. SODA 2012: 1681-1689 - [c16]Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke:
Optimal online buffer scheduling for block devices. STOC 2012: 589-598 - 2011
- [c15]Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke:
Almost tight bounds for reordering buffer management. STOC 2011: 607-616 - 2010
- [j4]Matthias Englert, Thomas Franke, Lars Olbrich:
Sensitivity of Wardrop Equilibria. Theory Comput. Syst. 47(1): 3-14 (2010) - [j3]Matthias Englert, Harald Räcke, Matthias Westermann:
Reordering Buffers for General Metric Spaces. Theory Comput. 6(1): 27-46 (2010) - [c14]Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, Kunal Talwar:
Vertex Sparsifiers: New Results from Old Techniques. APPROX-RANDOM 2010: 152-165 - [i2]Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, Kunal Talwar:
Vertex Sparsifiers: New Results from Old Techniques. CoRR abs/1006.4586 (2010)
2000 – 2009
- 2009
- [j2]Matthias Englert, Matthias Westermann:
Lower and Upper Bounds on FIFO Buffer Management in QoS Switches. Algorithmica 53(4): 523-548 (2009) - [j1]Matthias Englert, Heiko Röglin, Matthias Westermann:
Evaluation of online strategies for reordering buffers. ACM J. Exp. Algorithmics 14 (2009) - [c13]Matthias Englert, Harald Räcke:
Oblivious Routing for the Lp-norm. FOCS 2009: 32-40 - [c12]Matthias Englert, Berthold Vöcking, Melanie Winkler:
Economical Caching with Stochastic Prices. SAGA 2009: 179-190 - [c11]Matthias Englert, Heiko Röglin, Jacob Spönemann, Berthold Vöcking:
Economical Caching. STACS 2009: 385-396 - 2008
- [b1]Matthias Englert:
Online scheduling for buffering problems. RWTH Aachen University, Germany, 2008 - [c10]Matthias Englert, Deniz Özmen, Matthias Westermann:
The Power of Reordering for Online Minimum Makespan Scheduling. FOCS 2008: 603-612 - [c9]Matthias Englert, Thomas Franke, Lars Olbrich:
Sensitivity of Wardrop Equilibria. SAGT 2008: 158-169 - 2007
- [c8]Matthias Englert, Matthias Westermann:
Considering suppressed packets improves buffer management in QoS switches. SODA 2007: 209-218 - [c7]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: 1295-1304 - [c6]Matthias Englert, Harald Räcke, Matthias Westermann:
Reordering buffers for general metric spaces. STOC 2007: 556-564 - 2006
- [c5]Matthias Englert, Matthias Westermann:
Lower and Upper Bounds on FIFO Buffer Management in QoS Switches. ESA 2006: 352-363 - [c4]Matthias Englert, Heiko Röglin, Matthias Westermann:
Evaluation of Online Strategies for Reordering Buffers. WEA 2006: 183-194 - [i1]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. TR06 (2006) - 2005
- [c3]Matthias Englert, Matthias Westermann:
Reordering Buffer Management for Non-uniform Cost Models. ICALP 2005: 627-638 - 2004
- [c2]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: 21-30 - [c1]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: 31-40
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
