Obserwuj
Christos Tzamos
Christos Tzamos
University of Athens and University of Wisconsin-Madison
Zweryfikowany adres z di.uoa.gr - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Strong duality for a multiple-good monopolist
C Daskalakis, A Deckelbaum, C Tzamos
Proceedings of the Sixteenth ACM Conference on Economics and Computation …, 2015
2242015
The complexity of optimal mechanism design
C Daskalakis, A Deckelbaum, C Tzamos
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
1332014
Ten steps of EM suffice for mixtures of two Gaussians
C Daskalakis, C Tzamos, M Zampetakis
Conference on Learning Theory, 704-710, 2017
1262017
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
1162014
Mechanism design via optimal transport
C Daskalakis, A Deckelbaum, C Tzamos
Proceedings of the fourteenth ACM conference on Electronic commerce, 269-286, 2013
1112013
Distribution-independent pac learning of halfspaces with massart noise
I Diakonikolas, T Gouleakis, C Tzamos
Advances in Neural Information Processing Systems 32, 2019
812019
Winner-imposing strategyproof mechanisms for multiple facility location games
D Fotakis, C Tzamos
Theoretical Computer Science 472, 90-103, 2013
772013
Learning halfspaces with massart noise under structured distributions
I Diakonikolas, V Kontonis, C Tzamos, N Zarifis
Conference on Learning Theory, 1486-1513, 2020
552020
Tight hardness results for maximum weight rectangles
A Backurs, N Dikkala, C Tzamos
arXiv preprint arXiv:1602.05837, 2016
522016
Strategyproof facility location for concave cost functions
D Fotakis, C Tzamos
Proceedings of the fourteenth ACM conference on Electronic commerce, 435-452, 2013
512013
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
492018
Improving viterbi is hard: Better runtimes imply faster clique algorithms
A Backurs, C Tzamos
International Conference on Machine Learning, 311-321, 2017
452017
Capacitated dynamic programming: Faster knapsack and graph algorithms
K Axiotis, C Tzamos
arXiv preprint arXiv:1802.06440, 2018
392018
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
382018
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
382016
Does information revelation improve revenue?
C Daskalakis, C Papadimitriou, C Tzamos
Proceedings of the 2016 ACM Conference on Economics and Computation, 233-250, 2016
352016
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
34*2020
Computationally and statistically efficient truncated regression
C Daskalakis, T Gouleakis, C Tzamos, M Zampetakis
Conference on Learning Theory, 955-960, 2019
302019
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
28*2021
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
282015
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20