Matthias Englert

Ranko Lazic

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Approximation Guarantees for Shortest Superstrings: Simpler and Better.

[BibT_eX]

[DOI]

Nicolaos Matsakis

Pavel Veselý

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

2022

Almost Tight Bounds for Reordering Buffer Management.

[BibT_eX]

[DOI]

SIAM J. Comput., 2022

Improved approximation guarantees for shortest superstrings using cycle classification by overlap to length ratios.

[BibT_eX]

[DOI]

Nicolaos Matsakis

Pavel Veselý

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Adversarial Reprogramming Revisited.

[BibT_eX]

[DOI]

Ranko Lazic

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021

The Reachability Problem for Two-Dimensional Vector Addition Systems with States.

[BibT_eX]

[DOI]

J. ACM, 2021

A lower bound for the coverability problem in acyclic pushdown VAS.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2021

Online Makespan Scheduling with Job Migration on Uniform Machines.

[BibT_eX]

[DOI]

David Mezlaf

Algorithmica, 2021

Modeling Asteroid (101955) Bennu as a Real-time Terrain.

[BibT_eX]

[DOI]

Proceedings of the SIGGRAPH 2021: Special Interest Group on Computer Graphics and Interactive Techniques Conference, 2021

2020

Using Mesh Shaders for Continuous Level-of-Detail Terrain Rendering.

[BibT_eX]

[DOI]

Proceedings of the SIGGRAPH '20: Special Interest Group on Computer Graphics and Interactive Techniques Conference, 2020

2019

An <i>O</i>(log <i>k</i>)-Competitive Algorithm for Generalized Caching.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

Polylogarithmic Guarantees for Generalized Reordering Buffer Management.

[BibT_eX]

[DOI]

Richard Stotz

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018

The reordering buffer problem on the line revisited.

[BibT_eX]

[DOI]

SIGACT News, 2018

Online Packet Scheduling for CIOQ and Buffered Crossbar Switches.

[BibT_eX]

[DOI]

Kamal Al-Bawani

Algorithmica, 2018

Comparison-Based Buffer Management in QoS Switches.

[BibT_eX]

[DOI]

Kamal Al-Bawani

Algorithmica, 2018

2017

Reordering Buffers with Logarithmic Diameter Dependency for Trees.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016

Scheduling with a Reordering Buffer.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Smoothed Analysis of the 2-Opt Algorithm for the General TSP.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete.

[BibT_eX]

[DOI]

Ranko Lazic

Patrick Totzke

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Comparison-Based FIFO Buffer Management in QoS Switches.

[BibT_eX]

[DOI]

Kamal Al-Bawani

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2014

The Power of Reordering for Online Minimum Makespan Scheduling.

[BibT_eX]

[DOI]

Deniz Özmen

SIAM J. Comput., 2014

Vertex Sparsifiers: New Results from Old Techniques.

[BibT_eX]

[DOI]

SIAM J. Comput., 2014

Logical Limitations to Machine Ethics with Consequences to Lethal Autonomous Weapons.

[BibT_eX]

[DOI]

Sandra Siebert

Martin Ziegler

CoRR, 2014

Generalized Reordering Buffer Management.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

New Bounds for Online Packing LPs.

[BibT_eX]

[DOI]

Nicolaos Matsakis

Marcin Mucha

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

2013

Economical Caching.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2013

Catch them if you can: how to serve impatient users.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Theoretical Computer Science, 2013

2012

Considering Suppressed Packets Improves Buffer Management in Quality of Service Switches.

[BibT_eX]

[DOI]

SIAM J. Comput., 2012

An overview of some results for reordering buffers.

[BibT_eX]

[DOI]

Comput. Sci. Res. Dev., 2012

Optimal online buffer scheduling for block devices.

[BibT_eX]

[DOI]

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Multiple-Choice Balanced Allocation in (Almost) Parallel.

[BibT_eX]

[DOI]

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2010

Reordering Buffers for General Metric Spaces.

[BibT_eX]

[DOI]

Theory Comput., 2010

Sensitivity of Wardrop Equilibria.

[BibT_eX]

[DOI]

Thomas Franke

Lars Olbrich

Theory Comput. Syst., 2010

2009

Evaluation of online strategies for reordering buffers.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2009

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

[BibT_eX]

[DOI]

Algorithmica, 2009

Economical Caching with Stochastic Prices.

[BibT_eX]

[DOI]

Melanie Winkler

Proceedings of the Stochastic Algorithms: Foundations and Applications, 2009

Oblivious Routing for the Lp-norm.

[BibT_eX]

[DOI]

Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

2008

Online scheduling for buffering problems.

[BibT_eX]

[DOI]

PhD thesis, 2008

2007

Considering suppressed packets improves buffer management in QoS switches.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006

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

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2006

2005

Reordering Buffer Management for Non-uniform Cost Models.

[BibT_eX]

[DOI]