| Strong duality for a multiple‐good monopolist C Daskalakis, A Deckelbaum, C Tzamos Econometrica 85 (3), 735-767, 2017 | 184 | 2017 |
| The complexity of optimal mechanism design C Daskalakis, A Deckelbaum, C Tzamos Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014 | 115 | 2014 |
| Mechanism design via optimal transport C Daskalakis, A Deckelbaum, C Tzamos Proceedings of the fourteenth ACM conference on Electronic commerce, 269-286, 2013 | 105 | 2013 |
| Ten steps of EM suffice for mixtures of two Gaussians C Daskalakis, C Tzamos, M Zampetakis Conference on Learning Theory, 704-710, 2017 | 99 | 2017 |
| On the power of deterministic mechanisms for facility location games D Fotakis, C Tzamos ACM Transactions on Economics and Computation (TEAC) 2 (4), 1-37, 2014 | 91 | 2014 |
| Winner-imposing strategyproof mechanisms for multiple facility location games D Fotakis, C Tzamos Theoretical Computer Science 472, 90-103, 2013 | 72 | 2013 |
| Distribution-independent pac learning of halfspaces with massart noise I Diakonikolas, T Gouleakis, C Tzamos Advances in Neural Information Processing Systems 32, 2019 | 45 | 2019 |
| Strategyproof facility location for concave cost functions D Fotakis, C Tzamos Algorithmica 76 (1), 143-167, 2016 | 43 | 2016 |
| Tight hardness results for maximum weight rectangles A Backurs, N Dikkala, C Tzamos arXiv preprint arXiv:1602.05837, 2016 | 41 | 2016 |
| Improving viterbi is hard: Better runtimes imply faster clique algorithms A Backurs, C Tzamos International Conference on Machine Learning, 311-321, 2017 | 38 | 2017 |
| A size-free CLT for poisson multinomials and its applications C Daskalakis, A De, G Kamath, C Tzamos Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 36 | 2016 |
| A converse to Banach's fixed point theorem and its CLS-completeness C Daskalakis, C Tzamos, M Zampetakis Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 33 | 2018 |
| Efficient statistics, in high dimensions, from truncated samples C Daskalakis, T Gouleakis, C Tzamos, M Zampetakis 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018 | 30 | 2018 |
| Does information revelation improve revenue? C Daskalakis, C Papadimitriou, C Tzamos Proceedings of the 2016 ACM Conference on Economics and Computation, 233-250, 2016 | 29 | 2016 |
| Learning halfspaces with massart noise under structured distributions I Diakonikolas, V Kontonis, C Tzamos, N Zarifis Conference on Learning Theory, 1486-1513, 2020 | 28 | 2020 |
| On the structure, covering, and learning of poisson multinomial distributions C Daskalakis, G Kamath, C Tzamos 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 1203-1217, 2015 | 24 | 2015 |
| Optimal pricing is hard C Daskalakis, A Deckelbaum, C Tzamos International Workshop on Internet and Network Economics, 298-308, 2012 | 20 | 2012 |
| Capacitated dynamic programming: Faster knapsack and graph algorithms K Axiotis, C Tzamos arXiv preprint arXiv:1802.06440, 2018 | 19 | 2018 |
| Efficiently learning halfspaces with tsybakov noise I Diakonikolas, DM Kane, V Kontonis, C Tzamos, N Zarifis Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 18* | 2021 |
| Pandora's Box with Correlations: Learning and Approximation S Chawla, E Gergatsouli, Y Teng, C Tzamos, R Zhang 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020 | 15* | 2020 |
Constantinos DaskalakisProfessor of Computer Science, MITVerified email at csail.mit.edu
