default search action
BibTeX records: Dimitris Paparas
@article{DBLP:journals/corr/abs-2402-04177, author = {Berivan Isik and Natalia Ponomareva and Hussein Hazimeh and Dimitris Paparas and Sergei Vassilvitskii and Sanmi Koyejo}, title = {Scaling Laws for Downstream Task Performance of Large Language Models}, journal = {CoRR}, volume = {abs/2402.04177}, year = {2024}, url = {https://doi.org/10.48550/arXiv.2402.04177}, doi = {10.48550/ARXIV.2402.04177}, eprinttype = {arXiv}, eprint = {2402.04177}, timestamp = {Tue, 02 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2402-04177.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/ChenDOPSY22, author = {Xi Chen and Ilias Diakonikolas and Anthi Orfanou and Dimitris Paparas and Xiaorui Sun and Mihalis Yannakakis}, title = {On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer}, journal = {{SIAM} J. Comput.}, volume = {51}, number = {3}, pages = {492--548}, year = {2022}, url = {https://doi.org/10.1137/17m1136481}, doi = {10.1137/17M1136481}, timestamp = {Mon, 27 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/ChenDOPSY22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/semweb/AlrashedPBSN21, author = {Tarfah Alrashed and Dimitris Paparas and Omar Benjelloun and Ying Sheng and Natasha F. Noy}, editor = {Andreas Hotho and Eva Blomqvist and Stefan Dietze and Achille Fokoue and Ying Ding and Payam M. Barnaghi and Armin Haller and Mauro Dragoni and Harith Alani}, title = {Dataset or Not? {A} Study on the Veracity of Semantic Markup for Dataset Pages}, booktitle = {The Semantic Web - {ISWC} 2021 - 20th International Semantic Web Conference, {ISWC} 2021, Virtual Event, October 24-28, 2021, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {12922}, pages = {338--356}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-88361-4\_20}, doi = {10.1007/978-3-030-88361-4\_20}, timestamp = {Wed, 16 Mar 2022 23:55:49 +0100}, biburl = {https://dblp.org/rec/conf/semweb/AlrashedPBSN21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2012-00738, author = {Simina Br{\^{a}}nzei and Dimitris Paparas and Nicholas J. Recker}, title = {Searching, Sorting, and Cake Cutting in Rounds}, journal = {CoRR}, volume = {abs/2012.00738}, year = {2020}, url = {https://arxiv.org/abs/2012.00738}, eprinttype = {arXiv}, eprint = {2012.00738}, timestamp = {Fri, 04 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2012-00738.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/geb/ChenDPSY18, author = {Xi Chen and Ilias Diakonikolas and Dimitris Paparas and Xiaorui Sun and Mihalis Yannakakis}, title = {The complexity of optimal multidimensional pricing for a unit-demand buyer}, journal = {Games Econ. Behav.}, volume = {110}, pages = {139--164}, year = {2018}, url = {https://doi.org/10.1016/j.geb.2018.03.016}, doi = {10.1016/J.GEB.2018.03.016}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/geb/ChenDPSY18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/ChenMPY18, author = {Xi Chen and George Matikas and Dimitris Paparas and Mihalis Yannakakis}, editor = {Artur Czumaj}, title = {On the Complexity of Simple and Optimal Deterministic Mechanisms for an Additive Buyer}, booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018}, pages = {2036--2049}, publisher = {{SIAM}}, year = {2018}, url = {https://doi.org/10.1137/1.9781611975031.133}, doi = {10.1137/1.9781611975031.133}, timestamp = {Tue, 02 Feb 2021 17:07:58 +0100}, biburl = {https://dblp.org/rec/conf/soda/ChenMPY18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@phdthesis{DBLP:phd/us/Paparas17, author = {Dimitris Paparas}, title = {On the Complexity of Market Equilibria and Revenue Maximization}, school = {Columbia University, {USA}}, year = {2017}, url = {https://doi.org/10.7916/D8MW2NVD}, doi = {10.7916/D8MW2NVD}, timestamp = {Fri, 15 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/phd/us/Paparas17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/ChenPY17, author = {Xi Chen and Dimitris Paparas and Mihalis Yannakakis}, title = {The Complexity of Non-Monotone Markets}, journal = {J. {ACM}}, volume = {64}, number = {3}, pages = {20:1--20:56}, year = {2017}, url = {https://doi.org/10.1145/3064810}, doi = {10.1145/3064810}, timestamp = {Wed, 19 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jacm/ChenPY17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/ChenMPY17, author = {Xi Chen and George Matikas and Dimitris Paparas and Mihalis Yannakakis}, title = {On the Complexity of Bundle-Pricing and Simple Mechanisms}, journal = {CoRR}, volume = {abs/1702.07032}, year = {2017}, url = {http://arxiv.org/abs/1702.07032}, eprinttype = {arXiv}, eprint = {1702.07032}, timestamp = {Wed, 19 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/ChenMPY17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1708-00043, author = {Shuchi Chawla and J. Benjamin Miller and Dimitris Paparas and Yifeng Teng}, title = {Pricing for Online Resource Allocation: Beyond Subadditive Values}, journal = {CoRR}, volume = {abs/1708.00043}, year = {2017}, url = {http://arxiv.org/abs/1708.00043}, eprinttype = {arXiv}, eprint = {1708.00043}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1708-00043.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/AngelBKPPZ16, author = {Eric Angel and Evripidis Bampis and Alexander V. Kononov and Dimitris Paparas and Emmanouil Pountourakis and Vassilis Zissimopoulos}, title = {Clustering on k-edge-colored graphs}, journal = {Discret. Appl. Math.}, volume = {211}, pages = {15--22}, year = {2016}, url = {https://doi.org/10.1016/j.dam.2016.04.017}, doi = {10.1016/J.DAM.2016.04.017}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/AngelBKPPZ16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/ChenDOPSY15, author = {Xi Chen and Ilias Diakonikolas and Anthi Orfanou and Dimitris Paparas and Xiaorui Sun and Mihalis Yannakakis}, editor = {Venkatesan Guruswami}, title = {On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms}, booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS} 2015, Berkeley, CA, USA, 17-20 October, 2015}, pages = {1464--1479}, publisher = {{IEEE} Computer Society}, year = {2015}, url = {https://doi.org/10.1109/FOCS.2015.93}, doi = {10.1109/FOCS.2015.93}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/ChenDOPSY15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/infocom/PaparasSBA15, author = {Dimitris Paparas and Evangelia D. Skiani and Yigal Bejerano and Matthew Andrews}, title = {On-line profit-maximization algorithms for managing sponsored content in cellular networks}, booktitle = {2015 {IEEE} Conference on Computer Communications Workshops, {INFOCOM} Workshops, Hong Kong, China, April 26 - May 1, 2015}, pages = {1--6}, publisher = {{IEEE}}, year = {2015}, url = {https://doi.org/10.1109/INFCOMW.2015.7442437}, doi = {10.1109/INFCOMW.2015.7442437}, timestamp = {Wed, 16 Oct 2019 14:14:51 +0200}, biburl = {https://dblp.org/rec/conf/infocom/PaparasSBA15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/ChenDPSY14, author = {Xi Chen and Ilias Diakonikolas and Dimitris Paparas and Xiaorui Sun and Mihalis Yannakakis}, editor = {Chandra Chekuri}, title = {The Complexity of Optimal Multidimensional Pricing}, booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014}, pages = {1319--1328}, publisher = {{SIAM}}, year = {2014}, url = {https://doi.org/10.1137/1.9781611973402.97}, doi = {10.1137/1.9781611973402.97}, timestamp = {Tue, 02 Feb 2021 17:07:40 +0100}, biburl = {https://dblp.org/rec/conf/soda/ChenDPSY14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/AngelBKPPZ13, author = {Eric Angel and Evripidis Bampis and Alexander V. Kononov and Dimitris Paparas and Emmanouil Pountourakis and Vassilis Zissimopoulos}, editor = {Krishnendu Chatterjee and Jir{\'{\i}} Sgall}, title = {Clustering on k-Edge-Colored Graphs}, booktitle = {Mathematical Foundations of Computer Science 2013 - 38th International Symposium, {MFCS} 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8087}, pages = {50--61}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-40313-2\_7}, doi = {10.1007/978-3-642-40313-2\_7}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/AngelBKPPZ13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/ChenPY13, author = {Xi Chen and Dimitris Paparas and Mihalis Yannakakis}, editor = {Dan Boneh and Tim Roughgarden and Joan Feigenbaum}, title = {The complexity of non-monotone markets}, booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013}, pages = {181--190}, publisher = {{ACM}}, year = {2013}, url = {https://doi.org/10.1145/2488608.2488632}, doi = {10.1145/2488608.2488632}, timestamp = {Wed, 19 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/ChenPY13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/ChenDPSY13, author = {Xi Chen and Ilias Diakonikolas and Dimitris Paparas and Xiaorui Sun and Mihalis Yannakakis}, title = {The Complexity of Optimal Multidimensional Pricing}, journal = {CoRR}, volume = {abs/1311.2138}, year = {2013}, url = {http://arxiv.org/abs/1311.2138}, eprinttype = {arXiv}, eprint = {1311.2138}, timestamp = {Wed, 19 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/ChenDPSY13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1211-4918, author = {Xi Chen and Dimitris Paparas and Mihalis Yannakakis}, title = {The Complexity of Non-Monotone Markets}, journal = {CoRR}, volume = {abs/1211.4918}, year = {2012}, url = {http://arxiv.org/abs/1211.4918}, eprinttype = {arXiv}, eprint = {1211.4918}, timestamp = {Wed, 19 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1211-4918.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icde/TsakalozosKSRPD11, author = {Konstantinos Tsakalozos and Herald Kllapi and Eva Sitaridi and Mema Roussopoulos and Dimitris Paparas and Alex Delis}, editor = {Serge Abiteboul and Klemens B{\"{o}}hm and Christoph Koch and Kian{-}Lee Tan}, title = {Flexible use of cloud resources through profit maximization and price discrimination}, booktitle = {Proceedings of the 27th International Conference on Data Engineering, {ICDE} 2011, April 11-16, 2011, Hannover, Germany}, pages = {75--86}, publisher = {{IEEE} Computer Society}, year = {2011}, url = {https://doi.org/10.1109/ICDE.2011.5767932}, doi = {10.1109/ICDE.2011.5767932}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icde/TsakalozosKSRPD11.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.