| Online metric algorithms with untrusted predictions A Antoniadis, C Coester, M Eliáš, A Polak, B Simon ACM Transactions on Algorithms 19 (2), 1-34, 2023 | 169 | 2023 |
| Improved approximation for vector bin packing N Bansal, M Eliáš, A Khan Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016 | 70 | 2016 |
| Differentially Private Release of Synthetic Graphs M Eliáš, M Kapralov, J Kulkarni, YT Lee Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 42 | 2020 |
| Nested convex bodies are chaseable N Bansal, M Böhm, M Eliáš, G Koumoutsos, SW Umboh Algorithmica, 1-14, 2019 | 41 | 2019 |
| Higher-order Erdős–Szekeres theorems M Eliáš, J Matoušek Advances in Mathematics 244, 1-15, 2013 | 37 | 2013 |
| Differentially private correlation clustering M Bun, M Elias, J Kulkarni International Conference on Machine Learning, 1136-1146, 2021 | 26 | 2021 |
| Competitive Algorithms for Generalized k-Server in Uniform Metrics N Bansal, M Eliáš, G Koumoutsos, J Nederlof ACM Transactions on Algorithms 19 (1), 1-15, 2023 | 24* | 2023 |
| Learning-augmented dynamic power management with multiple states via new ski rental bounds A Antoniadis, C Coester, M Eliás, A Polak, B Simon Advances in Neural Information Processing Systems 34, 16714-16726, 2021 | 22 | 2021 |
| Weighted k-server bounds via combinatorial dichotomies N Bansal, M Eliáš, G Koumoutsos 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017 | 22 | 2017 |
| Paging with succinct predictions A Antoniadis, J Boyar, M Eliás, LM Favrholdt, R Hoeksma, KS Larsen, ... International Conference on Machine Learning, 952-968, 2023 | 21 | 2023 |
| The (h, k)-server problem on bounded depth trees N Bansal, M Eliáš, Ł Jeż, G Koumoutsos ACM Transactions on Algorithms (TALG) 15 (2), 1-26, 2019 | 17 | 2019 |
| Mixing predictions for online metric algorithms A Antoniadis, C Coester, M Elias, A Polak, B Simon International Conference on Machine Learning, 969-983, 2023 | 13 | 2023 |
| Tight bounds for double coverage against weak adversaries N Bansal, M Eliáš, Ł Jeż, G Koumoutsos, K Pruhs Theory of Computing Systems 62 (2), 349-365, 2018 | 12 | 2018 |
| Lower bounds on geometric Ramsey functions M Eliás, J Matousek, E Roldán-Pensado, Z Safernová SIAM Journal on Discrete Mathematics 28 (4), 1960-1970, 2014 | 12 | 2014 |
| Algorithms for Caching and MTS with reduced number of predictions KA Sadek, M Elias arXiv preprint arXiv:2404.06280, 2024 | 6 | 2024 |
| Learning-Augmented Algorithms with Explicit Predictors M Elias, H Kaplan, Y Mansour, S Moran arXiv preprint arXiv:2403.07413, 2024 | 4 | 2024 |
| Approximation Algorithms for Combinatorial Optimization with Predictions A Antoniadis, M Eliáš, A Polak, M Venzin arXiv preprint arXiv:2411.16600, 2024 | 1 | 2024 |
| Stronger adversaries grow cheaper forests: online node-weighted Steiner problems S Borst, M Eliáš, M Venzin arXiv preprint arXiv:2410.18542, 2024 | | 2024 |
| Bandits with Knapsacks and Predictions D Drago, A Celli, M Elias The 40th Conference on Uncertainty in Artificial Intelligence, 0 | | |
Nikhil BansalUniversity of MichiganVerified email at umich.edu
