Marek Eliás

According to our database, Marek Eliás authored at least 18 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Learning-Augmented Algorithms with Explicit Predictors.

Marek Eliás, Haim Kaplan, Yishay Mansour, Shay Moran

CoRR, 2024

2023

Online Metric Algorithms with Untrusted Predictions.

Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon

ACM Trans. Algorithms, April, 2023

Competitive Algorithms for Generalized <i>k</i>-Server in Uniform Metrics.

Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos, Jesper Nederlof

ACM Trans. Algorithms, January, 2023

Mixing Predictions for Online Metric Algorithms.

Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon

Proceedings of the International Conference on Machine Learning, 2023

Paging with Succinct Predictions.

Antonios Antoniadis, Joan Boyar, Marek Eliás, Lene Monrad Favrholdt, Ruben Hoeksma, Kim S. Larsen, Adam Polak, Bertrand Simon

Proceedings of the International Conference on Machine Learning, 2023

2021

Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds.

Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Differentially Private Correlation Clustering.

Mark Bun, Marek Eliás, Janardhan Kulkarni

Proceedings of the 38th International Conference on Machine Learning, 2021

2020

Nested Convex Bodies are Chaseable.

Nikhil Bansal, Martin Böhm, Marek Eliás, Grigorios Koumoutsos, Seeun William Umboh

Algorithmica, 2020

Differentially Private Release of Synthetic Graphs.

Marek Eliás, Michael Kapralov, Janardhan Kulkarni, Yin Tat Lee

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019

The (<i>h, k</i>)-Server Problem on Bounded Depth Trees.

Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos

ACM Trans. Algorithms, 2019

2018

Tight Bounds for Double Coverage Against Weak Adversaries.

Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos, Kirk Pruhs

Theory Comput. Syst., 2018

2017

Competitive Algorithms for Generalized k-Server in Uniform Metrics.

Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos, Jesper Nederlof

CoRR, 2017

The (<i>h</i>, <i>k</i>)-Server Problem on Bounded Depth Trees.

Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos

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

Weighted k-Server Bounds via Combinatorial Dichotomies.

Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016

New Bounds for the $(h, k)$-Server Problem.

Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos

CoRR, 2016

Improved Approximation for Vector Bin Packing.

Nikhil Bansal, Marek Eliás, Arindam Khan

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2014

Lower Bounds on Geometric Ramsey Functions.

Marek Eliás, Jirí Matousek, Edgardo Roldán-Pensado, Zuzana Safernová

SIAM J. Discret. Math., 2014

2012

Higher-order Erdos-Szekeres theorems.

Marek Eliás, Jirí Matousek

Proceedings of the 28th ACM Symposium on Computational Geometry, 2012