default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDimitris Paparas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[i8]Aishwarya Kamath, Johan Ferret, Shreya Pathak, Nino Vieillard, Ramona Merhej, Sarah Perrin, Tatiana Matejovicova, Alexandre Ramé, Morgane Rivière, Louis Rouillard, Thomas Mesnard, Geoffrey Cideron, Jean-Bastien Grill, Sabela Ramos, Edouard Yvinec, Michelle Casbon, Etienne Pot, Ivo Penchev, Gaël Liu, Francesco Visin, Kathleen Kenealy, Lucas Beyer, Xiaohai Zhai, Anton Tsitsulin, Róbert Busa-Fekete, Alex Feng, Noveen Sachdeva, Benjamin Coleman, Yi Gao, Basil Mustafa, Iain Barr, Emilio Parisotto, David Tian, Matan Eyal, Colin Cherry, Jan-Thorsten Peter, Danila Sinopalnikov, Surya Bhupatiraju, Rishabh Agarwal, Mehran Kazemi, Dan Malkin, Ravin Kumar, David Vilar, Idan Brusilovsky, Jiaming Luo, Andreas Steiner, Abe Friesen, Abhanshu Sharma, Abheesht Sharma, Adi Mayrav Gilady, Adrian Goedeckemeyer, Alaa Saade, Alexander Kolesnikov, Alexei Bendebury, Alvin Abdagic, Amit Vadi, András György, André Susano Pinto, Anil Das, Ankur Bapna, Antoine Miech, Antoine Yang, Antonia Paterson, Ashish Shenoy, Ayan Chakrabarti, Bilal Piot, Bo Wu, Bobak Shahriari, Bryce Petrini, Charlie Chen, Charline Le Lan, Christopher A. Choquette-Choo, CJ Carey, Cormac Brick, Daniel Deutsch, Danielle Eisenbud, Dee Cattle, Derek Cheng, Dimitris Paparas, Divyashree Shivakumar Sreepathihalli, Doug Reid, Dustin Tran, Dustin Zelle, Eric Noland, Erwin Huizenga, Eugene Kharitonov, Frederick Liu, Gagik Amirkhanyan, Glenn Cameron, Hadi Hashemi, Hanna Klimczak-Plucinska, Harman Singh, Harsh Mehta, Harshal Tushar Lehri, Hussein Hazimeh, Ian Ballantyne, Idan Szpektor, Ivan Nardini:
Gemma 3 Technical Report. CoRR abs/2503.19786 (2025)- 2024
- [c9]Robert Stevenson, Dimitris Paparas, Omar Faris, Xiaoxian Xu, Catherine Merchant, Elliot Smith, Benjamin Nicholls
, Charles Fox:
Open Source Hardware Whisker Sensor. TAROS (1) 2024: 222-233 - [i7]Berivan Isik, Natalia Ponomareva, Hussein Hazimeh, Dimitris Paparas, Sergei Vassilvitskii, Sanmi Koyejo:
Scaling Laws for Downstream Task Performance of Large Language Models. CoRR abs/2402.04177 (2024) - [i6]Yurong Liu, R. Teal Witter, Flip Korn, Tarfah Alrashed, Dimitris Paparas, Juliana Freire:
Kernel Banzhaf: A Fast and Robust Estimator for Banzhaf Values. CoRR abs/2410.08336 (2024) - 2022
- [j4]Xi Chen, Ilias Diakonikolas, Anthi Orfanou, Dimitris Paparas, Xiaorui Sun, Mihalis Yannakakis:
On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer. SIAM J. Comput. 51(3): 492-548 (2022) - 2021
- [c8]Tarfah Alrashed, Dimitris Paparas, Omar Benjelloun, Ying Sheng, Natasha F. Noy:
Dataset or Not? A Study on the Veracity of Semantic Markup for Dataset Pages. ISWC 2021: 338-356 - 2020
- [i5]Simina Brânzei, Dimitris Paparas, Nicholas J. Recker:
Searching, Sorting, and Cake Cutting in Rounds. CoRR abs/2012.00738 (2020)
2010 – 2019
- 2018
- [j3]Xi Chen, Ilias Diakonikolas, Dimitris Paparas, Xiaorui Sun, Mihalis Yannakakis:
The complexity of optimal multidimensional pricing for a unit-demand buyer. Games Econ. Behav. 110: 139-164 (2018) - [c7]Xi Chen, George Matikas, Dimitris Paparas, Mihalis Yannakakis:
On the Complexity of Simple and Optimal Deterministic Mechanisms for an Additive Buyer. SODA 2018: 2036-2049 - 2017
- [b1]Dimitris Paparas:
On the Complexity of Market Equilibria and Revenue Maximization. Columbia University, USA, 2017 - [j2]Xi Chen, Dimitris Paparas, Mihalis Yannakakis:
The Complexity of Non-Monotone Markets. J. ACM 64(3): 20:1-20:56 (2017) - [i4]Xi Chen, George Matikas, Dimitris Paparas, Mihalis Yannakakis:
On the Complexity of Bundle-Pricing and Simple Mechanisms. CoRR abs/1702.07032 (2017) - [i3]Shuchi Chawla, J. Benjamin Miller, Dimitris Paparas, Yifeng Teng:
Pricing for Online Resource Allocation: Beyond Subadditive Values. CoRR abs/1708.00043 (2017) - 2016
- [j1]Eric Angel, Evripidis Bampis, Alexander V. Kononov, Dimitris Paparas, Emmanouil Pountourakis, Vassilis Zissimopoulos:
Clustering on k-edge-colored graphs. Discret. Appl. Math. 211: 15-22 (2016) - 2015
- [c6]Xi Chen, Ilias Diakonikolas, Anthi Orfanou, Dimitris Paparas, Xiaorui Sun, Mihalis Yannakakis:
On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms. FOCS 2015: 1464-1479 - [c5]Dimitris Paparas, Evangelia D. Skiani, Yigal Bejerano, Matthew Andrews:
On-line profit-maximization algorithms for managing sponsored content in cellular networks. INFOCOM Workshops 2015: 1-6 - 2014
- [c4]Xi Chen, Ilias Diakonikolas, Dimitris Paparas, Xiaorui Sun, Mihalis Yannakakis:
The Complexity of Optimal Multidimensional Pricing. SODA 2014: 1319-1328 - 2013
- [c3]Eric Angel, Evripidis Bampis, Alexander V. Kononov, Dimitris Paparas, Emmanouil Pountourakis, Vassilis Zissimopoulos:
Clustering on k-Edge-Colored Graphs. MFCS 2013: 50-61 - [c2]Xi Chen, Dimitris Paparas, Mihalis Yannakakis:
The complexity of non-monotone markets. STOC 2013: 181-190 - [i2]Xi Chen, Ilias Diakonikolas, Dimitris Paparas, Xiaorui Sun, Mihalis Yannakakis:
The Complexity of Optimal Multidimensional Pricing. CoRR abs/1311.2138 (2013) - 2012
- [i1]Xi Chen, Dimitris Paparas, Mihalis Yannakakis:
The Complexity of Non-Monotone Markets. CoRR abs/1211.4918 (2012) - 2011
- [c1]Konstantinos Tsakalozos, Herald Kllapi, Eva Sitaridi, Mema Roussopoulos, Dimitris Paparas, Alex Delis:
Flexible use of cloud resources through profit maximization and price discrimination. ICDE 2011: 75-86
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 2025-04-29 22:18 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:
