default search action
Marek Eliás 0001
Person information
- unicode name: Marek Eliáš
- affiliation: Bocconi University, Milan, Italy
- affiliation (former): École Polytechnique Fédérale de Lausanne, Switzerland
- affiliation (PhD 2018): TU Eindhoven, The Netherlands
Other persons with the same name
- Marek Eliás 0002 — Masaryk University, Brno, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c15]Karim Abdel Sadek, Marek Eliás:
Algorithms for Caching and MTS with reduced number of predictions. ICLR 2024 - [i12]Marek Eliás, Haim Kaplan, Yishay Mansour, Shay Moran:
Learning-Augmented Algorithms with Explicit Predictors. CoRR abs/2403.07413 (2024) - [i11]Karim Abdel Sadek, Marek Eliás:
Algorithms for Caching and MTS with reduced number of predictions. CoRR abs/2404.06280 (2024) - 2023
- [j6]Nikhil Bansal
, Marek Eliás
Competitive Algorithms for Generalized k-Server in Uniform Metrics. ACM Trans. Algorithms 19(1): 8:1-8:15 (2023) - [j5]Antonios Antoniadis
Online Metric Algorithms with Untrusted Predictions. ACM Trans. Algorithms 19(2): 19:1-19:34 (2023) - [c14]Antonios Antoniadis, Joan Boyar, Marek Eliás, Lene Monrad Favrholdt, Ruben Hoeksma, Kim S. Larsen, Adam Polak, Bertrand Simon:
Paging with Succinct Predictions. ICML 2023: 952-968 - [c13]Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon:
Mixing Predictions for Online Metric Algorithms. ICML 2023: 969-983 - [i10]Antonios Antoniadis, Christian Coester, Marek Eliás
Mixing predictions for online metric algorithms. CoRR abs/2304.01781 (2023) - 2022
- [i9]Antonios Antoniadis, Joan Boyar, Marek Eliás
Paging with Succinct Predictions. CoRR abs/2210.02775 (2022) - 2021
- [c12]Mark Bun, Marek Eliás, Janardhan Kulkarni:
Differentially Private Correlation Clustering. ICML 2021: 1136-1146 - [c11]Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon:
Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds. NeurIPS 2021: 16714-16726 - [i8]Mark Bun, Marek Eliás, Janardhan Kulkarni:
Differentially Private Correlation Clustering. CoRR abs/2102.08885 (2021) - [i7]Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon:
Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds. CoRR abs/2110.13116 (2021) - 2020
- [j4]Nikhil Bansal, Martin Böhm, Marek Eliás
Nested Convex Bodies are Chaseable. Algorithmica 82(6): 1640-1653 (2020) - [c10]Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon:
Online metric algorithms with untrusted predictions. ICML 2020: 345-355 - [c9]Marek Eliás, Michael Kapralov
Differentially Private Release of Synthetic Graphs. SODA 2020: 560-578 - [i6]Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon:
Online metric algorithms with untrusted predictions. CoRR abs/2003.02144 (2020)
2010 – 2019
- 2019
- [j3]Nikhil Bansal, Marek Eliás
The (h, k)-Server Problem on Bounded Depth Trees. ACM Trans. Algorithms 15(2): 28:1-28:26 (2019) - 2018
- [j2]Nikhil Bansal, Marek Eliás
Tight Bounds for Double Coverage Against Weak Adversaries. Theory Comput. Syst. 62(2): 349-365 (2018) - [c8]Nikhil Bansal, Marek Eliás
Competitive Algorithms for Generalized k-Server in Uniform Metrics. SODA 2018: 992-1001 - [c7]Nikhil Bansal, Martin Böhm, Marek Eliás
Nested Convex Bodies are Chaseable. SODA 2018: 1253-1260 - 2017
- [c6]Nikhil Bansal, Marek Eliás
Weighted k-Server Bounds via Combinatorial Dichotomies. FOCS 2017: 493-504 - [c5]Nikhil Bansal, Marek Eliás
The (h, k)-Server Problem on Bounded Depth Trees. SODA 2017: 1022-1037 - [i5]Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos:
Weighted k-Server Bounds via Combinatorial Dichotomies. CoRR abs/1704.03318 (2017) - [i4]Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos, Jesper Nederlof:
Competitive Algorithms for Generalized k-Server in Uniform Metrics. CoRR abs/1707.04519 (2017) - [i3]Nikhil Bansal, Martin Böhm, Marek Eliás, Grigorios Koumoutsos, Seeun William Umboh:
Nested Convex Bodies are Chaseable. CoRR abs/1707.05527 (2017) - 2016
- [c4]Nikhil Bansal, Marek Eliás
Improved Approximation for Vector Bin Packing. SODA 2016: 1561-1579 - [i2]Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos:
New Bounds for the $(h, k)$-Server Problem. CoRR abs/1608.08527 (2016) - 2015
- [c3]Nikhil Bansal, Marek Eliás
Tight Bounds for Double Coverage Against Weak Adversaries. WAOA 2015: 47-58 - 2014
- [j1]Marek Eliás
Lower Bounds on Geometric Ramsey Functions. SIAM J. Discret. Math. 28(4): 1960-1970 (2014) - [c2]Marek Eliás
Lower bounds on geometric Ramsey functions. SoCG 2014: 558 - 2012
- [c1]Marek Eliás
Higher-order Erdos-Szekeres theorems. SCG 2012: 81-90 - 2011
- [i1]Marek Eliás, Jirí Matousek:
Higher-order Erdos-Szekeres theorems. CoRR abs/1111.3824 (2011)
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-10-07 21:21 CEST 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: