MAREK ELIAS

Courses a.y. 2023/2024
30553 ADVANCED PROGRAMMING AND OPTIMIZATION ALGORITHMS
Courses previous a.y.
Biographical note
I received my PhD from TU Eindhoven. Before coming to Bocconi, I was a postdoctoral researcher at EPFL in Lausanne and at CWI in Amsterdam.
Research interests
I study algorithms for optimization problems with uncertainty. This includes online optimization problems with uncertainty about the future as well as problems in differential privacy with intentionally added uncertainty protecting sensitive data
Working papers
Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds
NeurIPS 2021
Selected Publications
Improved approximation for vector bin packing
Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2016
Weighted k-server bounds via combinatorial dichotomies
Annual Symposium on Foundations of Computer Science - Proceedings, 2017
The (h,k)-server problem on bounded depth trees
ACM TRANSACTIONS ON ALGORITHMS, 2019
Tight bounds for Double Coverage against weak adversaries
THEORY OF COMPUTING SYSTEMS, 2018
Differentially private correlation clustering
Differentially Private Correlation Clustering, 2021
Learning-augmented dynamic power management with multiple states via new ski rental bounds
Advances in Neural Information Processing Systems 34, 2021
Nested Convex Bodies are chaseable
ALGORITHMICA, 2020
Competitive algorithms for generalized k-server in uniform metrics
Proceedings of the 2018 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2018
Lower bounds on geometric Ramsey functions
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2014