Marek Eliáš
From MaRDI portal
Person:1743119
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Competitive Algorithms for Generalized k -Server in Uniform Metrics ACM Transactions on Algorithms | 2023-10-23 | Paper |
| Differentially Private Release of Synthetic Graphs Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
| Nested convex bodies are chaseable Algorithmica | 2020-04-14 | Paper |
| Improved Approximation for Vector Bin Packing Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| The (h, k)-Server Problem on Bounded Depth Trees Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Lower bounds on geometric Ramsey functions Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
| Tight bounds for double coverage against weak adversaries Theory of Computing Systems | 2018-04-12 | Paper |
| Competitive algorithms for generalized \(k\)-server in uniform metrics | 2018-03-15 | Paper |
| Competitive algorithms for generalized \(k\)-server in uniform metrics (available as arXiv preprint) | 2018-03-15 | Paper |
| Nested convex bodies are chaseable | 2018-03-15 | Paper |
| Nested convex bodies are chaseable (available as arXiv preprint) | 2018-03-15 | Paper |
| Tight Bounds for Double Coverage Against Weak Adversaries Approximation and Online Algorithms | 2016-02-26 | Paper |
| Lower bounds on geometric Ramsey functions SIAM Journal on Discrete Mathematics | 2015-04-17 | Paper |
| Higher-order Erdős-Szekeres theorems Advances in Mathematics | 2014-03-03 | Paper |
Research outcomes over time
This page was built for person: Marek Eliáš
