# Christos Tzamos

According to our database

Collaborative distances:

^{1}, Christos Tzamos authored at least 28 papers between 2010 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

Anaconda: A Non-Adaptive Conditional Sampling Algorithm for Distribution Testing.

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Fast Modular Subset Sum using Linear Sketching.

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

Combinatorial Assortment Optimization.

Proceedings of the Web and Internet Economics - 14th International Conference, 2018

A converse to Banach's fixed point theorem and its CLS-completeness.

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Efficient Statistics, in High Dimensions, from Truncated Samples.

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

Actively Avoiding Nonsense in Generative Models.

Proceedings of the Conference On Learning Theory, 2018

Certified Computation from Unreliable Datasets.

Proceedings of the Conference On Learning Theory, 2018

Bootstrapping EM via Power EM and Convergence in the Naive Bayes Model.

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

2017

Mechanism design: from optimal transport theory to revenue maximization.

PhD thesis, 2017

Faster Sublinear Algorithms using Conditional Sampling.

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms.

Proceedings of the 34th International Conference on Machine Learning, 2017

Ten Steps of EM Suffice for Mixtures of Two Gaussians.

Proceedings of the 30th Conference on Learning Theory, 2017

2016

Anonymous Auctions Maximizing Revenue.

Proceedings of the Web and Internet Economics - 12th International Conference, 2016

A size-free CLT for poisson multinomials and its applications.

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Mechanism Design with Selective Verification.

Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Does Information Revelation Improve Revenue?

Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Tight Hardness Results for Maximum Weight Rectangles.

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

Strong Duality for a Multiple-Good Monopolist.

Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

Efficient Money Burning in General Domains.

Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015

Game Theory based Peer Grading Mechanisms for MOOCs.

Proceedings of the Second ACM Conference on Learning @ Scale, 2015

On the Structure, Covering, and Learning of Poisson Multinomial Distributions.

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014

The Complexity of Optimal Mechanism Design.

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013

Strategyproof facility location with concave costs.

SIGecom Exchanges, 2013

Strategyproof facility location for concave cost functions.

Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Mechanism design via optimal transport.

Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

On the Power of Deterministic Mechanisms for Facility Location Games.

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

Optimal Pricing Is Hard.

Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

2010

Winner-Imposing Strategyproof Mechanisms for Multiple Facility Location Games.

Proceedings of the Internet and Network Economics - 6th International Workshop, 2010