Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarBibTeX records: Marek Eliás 0001
@article{DBLP:journals/algorithmica/BansalBEKU20,
author = {Nikhil Bansal and
Martin B{\"{o}}hm and
Marek Eli{\'{a}}s and
Grigorios Koumoutsos and
Seeun William Umboh},
title = {Nested Convex Bodies are Chaseable},
journal = {Algorithmica},
volume = {82},
number = {6},
pages = {1640--1653},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00661-x},
doi = {10.1007/s00453-019-00661-x},
timestamp = {Mon, 04 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BansalBEKU20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EliasKKL20,
author = {Marek Eli{\'{a}}s and
Michael Kapralov and
Janardhan Kulkarni and
Yin Tat Lee},
editor = {Shuchi Chawla},
title = {Differentially Private Release of Synthetic Graphs},
booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
pages = {560--578},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611975994.34},
doi = {10.1137/1.9781611975994.34},
timestamp = {Mon, 03 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/EliasKKL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-02144,
author = {Antonios Antoniadis and
Christian Coester and
Marek Eli{\'{a}}s and
Adam Polak and
Bertrand Simon},
title = {Online metric algorithms with untrusted predictions},
journal = {CoRR},
volume = {abs/2003.02144},
year = {2020},
url = {https://arxiv.org/abs/2003.02144},
archivePrefix = {arXiv},
eprint = {2003.02144},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-02144.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BansalEJK19,
author = {Nikhil Bansal and
Marek Eli{\'{a}}s and
Lukasz Jez and
Grigorios Koumoutsos},
title = {The (\emph{h, k})-Server Problem on Bounded Depth Trees},
journal = {{ACM} Trans. Algorithms},
volume = {15},
number = {2},
pages = {28:1--28:26},
year = {2019},
url = {https://doi.org/10.1145/3301314},
doi = {10.1145/3301314},
timestamp = {Wed, 06 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/BansalEJK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BansalEJKP18,
author = {Nikhil Bansal and
Marek Eli{\'{a}}s and
Lukasz Jez and
Grigorios Koumoutsos and
Kirk Pruhs},
title = {Tight Bounds for Double Coverage Against Weak Adversaries},
journal = {Theory Comput. Syst.},
volume = {62},
number = {2},
pages = {349--365},
year = {2018},
url = {https://doi.org/10.1007/s00224-016-9703-3},
doi = {10.1007/s00224-016-9703-3},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BansalEJKP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Bansal0KN18,
author = {Nikhil Bansal and
Marek Eli{\'{a}}s and
Grigorios Koumoutsos and
Jesper Nederlof},
editor = {Artur Czumaj},
title = {Competitive Algorithms for Generalized \emph{k}-Server in Uniform
Metrics},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {992--1001},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.64},
doi = {10.1137/1.9781611975031.64},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/Bansal0KN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BansalB0KU18,
author = {Nikhil Bansal and
Martin B{\"{o}}hm and
Marek Eli{\'{a}}s and
Grigorios Koumoutsos and
Seeun William Umboh},
editor = {Artur Czumaj},
title = {Nested Convex Bodies are Chaseable},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {1253--1260},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.81},
doi = {10.1137/1.9781611975031.81},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BansalB0KU18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BansalEK17,
author = {Nikhil Bansal and
Marek Eli{\'{a}}s and
Grigorios Koumoutsos},
editor = {Chris Umans},
title = {Weighted k-Server Bounds via Combinatorial Dichotomies},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {493--504},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.52},
doi = {10.1109/FOCS.2017.52},
timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
biburl = {https://dblp.org/rec/conf/focs/BansalEK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BansalEJK17,
author = {Nikhil Bansal and
Marek Eli{\'{a}}s and
Lukasz Jez and
Grigorios Koumoutsos},
editor = {Philip N. Klein},
title = {The (\emph{h}, \emph{k})-Server Problem on Bounded Depth Trees},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {1022--1037},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.65},
doi = {10.1137/1.9781611974782.65},
timestamp = {Wed, 06 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BansalEJK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BansalEK17,
author = {Nikhil Bansal and
Marek Eli{\'{a}}s and
Grigorios Koumoutsos},
title = {Weighted k-Server Bounds via Combinatorial Dichotomies},
journal = {CoRR},
volume = {abs/1704.03318},
year = {2017},
url = {http://arxiv.org/abs/1704.03318},
archivePrefix = {arXiv},
eprint = {1704.03318},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BansalEK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BansalEKN17,
author = {Nikhil Bansal and
Marek Eli{\'{a}}s and
Grigorios Koumoutsos and
Jesper Nederlof},
title = {Competitive Algorithms for Generalized k-Server in Uniform Metrics},
journal = {CoRR},
volume = {abs/1707.04519},
year = {2017},
url = {http://arxiv.org/abs/1707.04519},
archivePrefix = {arXiv},
eprint = {1707.04519},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BansalEKN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BansalBEKU17,
author = {Nikhil Bansal and
Martin B{\"{o}}hm and
Marek Eli{\'{a}}s and
Grigorios Koumoutsos and
Seeun William Umboh},
title = {Nested Convex Bodies are Chaseable},
journal = {CoRR},
volume = {abs/1707.05527},
year = {2017},
url = {http://arxiv.org/abs/1707.05527},
archivePrefix = {arXiv},
eprint = {1707.05527},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BansalBEKU17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BansalE016,
author = {Nikhil Bansal and
Marek Eli{\'{a}}s and
Arindam Khan},
editor = {Robert Krauthgamer},
title = {Improved Approximation for Vector Bin Packing},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {1561--1579},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch106},
doi = {10.1137/1.9781611974331.ch106},
timestamp = {Wed, 06 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BansalE016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BansalEJK16,
author = {Nikhil Bansal and
Marek Eli{\'{a}}s and
Lukasz Jez and
Grigorios Koumoutsos},
title = {New Bounds for the {\textdollar}(h, k){\textdollar}-Server Problem},
journal = {CoRR},
volume = {abs/1608.08527},
year = {2016},
url = {http://arxiv.org/abs/1608.08527},
archivePrefix = {arXiv},
eprint = {1608.08527},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BansalEJK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BansalEJKP15,
author = {Nikhil Bansal and
Marek Eli{\'{a}}s and
Lukasz Jez and
Grigorios Koumoutsos and
Kirk Pruhs},
editor = {Laura Sanit{\`{a}} and
Martin Skutella},
title = {Tight Bounds for Double Coverage Against Weak Adversaries},
booktitle = {Approximation and Online Algorithms - 13th International Workshop,
{WAOA} 2015, Patras, Greece, September 17-18, 2015. Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {9499},
pages = {47--58},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-28684-6\_5},
doi = {10.1007/978-3-319-28684-6\_5},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/BansalEJKP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/EliasMRS14,
author = {Marek Eli{\'{a}}s and
Jir{\'{\i}} Matousek and
Edgardo Rold{\'{a}}n{-}Pensado and
Zuzana Safernov{\'{a}}},
title = {Lower Bounds on Geometric Ramsey Functions},
journal = {{SIAM} J. Discret. Math.},
volume = {28},
number = {4},
pages = {1960--1970},
year = {2014},
url = {https://doi.org/10.1137/140963716},
doi = {10.1137/140963716},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/EliasMRS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/EliasMRS14,
author = {Marek Eli{\'{a}}s and
Jir{\'{\i}} Matousek and
Edgardo Rold{\'{a}}n{-}Pensado and
Zuzana Safernov{\'{a}}},
editor = {Siu{-}Wing Cheng and
Olivier Devillers},
title = {Lower bounds on geometric Ramsey functions},
booktitle = {30th Annual Symposium on Computational Geometry, SOCG'14, Kyoto, Japan,
June 08 - 11, 2014},
pages = {558},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2582112.2582146},
doi = {10.1145/2582112.2582146},
timestamp = {Thu, 24 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/compgeom/EliasMRS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/EliayM12,
author = {Marek Eli{\'{a}}s and
Jir{\'{\i}} Matousek},
editor = {Tamal K. Dey and
Sue Whitesides},
title = {Higher-order Erdos-Szekeres theorems},
booktitle = {Symposuim on Computational Geometry 2012, SoCG '12, Chapel Hill, NC,
USA, June 17-20, 2012},
pages = {81--90},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2261250.2261264},
doi = {10.1145/2261250.2261264},
timestamp = {Thu, 24 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/compgeom/EliayM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1111-3824,
author = {Marek Eli{\'{a}}s and
Jir{\'{\i}} Matousek},
title = {Higher-order Erdos-Szekeres theorems},
journal = {CoRR},
volume = {abs/1111.3824},
year = {2011},
url = {http://arxiv.org/abs/1111.3824},
archivePrefix = {arXiv},
eprint = {1111.3824},
timestamp = {Thu, 24 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1111-3824.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
last updated on 2020-05-20 21:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
