Optimal Pricing Is Hard. - Constantinos Daskalakis; Alan Deckelbaum; Christos Tzamos (WINE, 2012)

Mechanism design via optimal transport. - Constantinos Daskalakis; Alan Deckelbaum; Christos Tzamos (EC, 2013)

Strategy-Proof Facility Location for Concave Cost Functions - Dimitris Fotakis 001; Christos Tzamos (CoRR, 2013)

Strategyproof facility location with concave costs. - Dimitris Fotakis 001; Christos Tzamos (SIGecom Exch., 2013)

Winner-imposing strategyproof mechanisms for multiple Facility Location games. - Dimitris Fotakis 001; Christos Tzamos (Theor. Comput. Sci., 2013)

The Complexity of Optimal Mechanism Design. - Constantinos Daskalakis; Alan Deckelbaum; Christos Tzamos (SODA, 2014)

The Value of Knowing Your Enemy. - Christos Tzamos; Christopher A. Wilkens (CoRR, 2014)

On the Power of Deterministic Mechanisms for Facility Location Games. - Dimitris Fotakis 001; Christos Tzamos (ACM Trans. Economics and Comput., 2014)

On the Structure, Covering, and Learning of Poisson Multinomial Distributions. - Constantinos Daskalakis; Gautam Kamath 001; Christos Tzamos (FOCS, 2015)

Game Theory based Peer Grading Mechanisms for MOOCs. - William Wu; Constantinos Daskalakis; Nicolaas Kaashoek; Christos Tzamos; S. Matthew Weinberg (L@S, 2015)

Strong Duality for a Multiple-Good Monopolist. - Constantinos Daskalakis; Alan Deckelbaum; Christos Tzamos (EC, 2015)

Who to Trust for Truthfully Maximizing Welfare? - Dimitris Fotakis 001; Christos Tzamos; Emmanouil Zampetakis (CoRR, 2015)

Tight Hardness Results for Maximum Weight Rectangles. - Arturs Backurs; Nishanth Dikkala; Christos Tzamos (ICALP, 2016)

Does Information Revelation Improve Revenue? - Constantinos Daskalakis; Christos H. Papadimitriou; Christos Tzamos (EC, 2016)

Mechanism Design with Selective Verification. - Dimitris Fotakis 001; Christos Tzamos; Manolis Zampetakis (EC, 2016)

A size-free CLT for poisson multinomials and its applications. - Constantinos Daskalakis; Anindya De; Gautam Kamath 001; Christos Tzamos (STOC, 2016)

Anonymous Auctions Maximizing Revenue. - Christos Tzamos; Christopher A. Wilkens (WINE, 2016)

Strategyproof Facility Location for Concave Cost Functions. - Dimitris Fotakis 001; Christos Tzamos (Algorithmica, 2016)

Efficient Money Burning in General Domains. - Dimitris Fotakis 001; Dimitris Tsipras; Christos Tzamos; Emmanouil Zampetakis (Theory Comput. Syst., 2016)

Ten Steps of EM Suffice for Mixtures of Two Gaussians. - Constantinos Daskalakis; Christos Tzamos; Manolis Zampetakis (COLT, 2017)

Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms. - Arturs Backurs; Christos Tzamos (ICML, 2017)

Faster Sublinear Algorithms using Conditional Sampling. - Themistoklis Gouleakis; Christos Tzamos; Manolis Zampetakis (SODA, 2017)

Truthful Facility Location with Additive Errors. - Iddan Golomb; Christos Tzamos (CoRR, 2017)

Certified Computation in Crowdsourcing. - Themis Gouleakis; Christos Tzamos; Manolis Zampetakis (CoRR, 2017)

Mechanism design: from optimal transport theory to revenue maximization. - Christos Tzamos (2017)

Bootstrapping EM via Power EM and Convergence in the Naive Bayes Model. - Costis Daskalakis; Christos Tzamos; Manolis Zampetakis (AISTATS, 2018)

Certified Computation from Unreliable Datasets. - Themis Gouleakis; Christos Tzamos; Manolis Zampetakis (COLT, 2018)

Actively Avoiding Nonsense in Generative Models. - Steve Hanneke; Adam Tauman Kalai; Gautam Kamath 001; Christos Tzamos (COLT, 2018)

Efficient Statistics, in High Dimensions, from Truncated Samples. - Constantinos Daskalakis; Themis Gouleakis; Christos Tzamos; Manolis Zampetakis (FOCS, 2018)

A converse to Banach's fixed point theorem and its CLS-completeness. - Constantinos Daskalakis; Christos Tzamos; Manolis Zampetakis (STOC, 2018)

Fast Modular Subset Sum using Linear Sketching. - Kyriakos Axiotis; Arturs Backurs; Christos Tzamos (CoRR, 2018)

Anaconda: A Non-Adaptive Conditional Sampling Algorithm for Distribution Testing. - Gautam Kamath 001; Christos Tzamos (Electron. Colloquium Comput. Complex., 2018)

Learning to Prune: Speeding up Repeated Computations. - Daniel Alabi; Adam Tauman Kalai; Katrina Ligett; Cameron Musco; Christos Tzamos; Ellen Vitercik (COLT, 2019)

Computationally and Statistically Efficient Truncated Regression. - Constantinos Daskalakis; Themis Gouleakis; Christos Tzamos; Manolis Zampetakis (COLT, 2019)

Efficient Truncated Statistics with Unknown Truncation. - Vasilis Kontonis; Christos Tzamos; Manolis Zampetakis (FOCS, 2019)

Capacitated Dynamic Programming: Faster Knapsack and Graph Algorithms. - Kyriakos Axiotis; Christos Tzamos (ICALP, 2019)

Distribution-Independent PAC Learning of Halfspaces with Massart Noise. - Ilias Diakonikolas; Themis Gouleakis; Christos Tzamos (NeurIPS, 2019)

Fast Modular Subset Sum using Linear Sketching. - Kyriakos Axiotis; Arturs Backurs; Ce Jin 001; Christos Tzamos; Hongxun Wu (SODA, 2019)

Diversity and Exploration in Social Learning. - Nicole Immorlica; Jieming Mao; Christos Tzamos (WWW, 2019)

Reasonable multi-item mechanisms are not much better than item pricing. - Shuchi Chawla 001; Yifeng Teng; Christos Tzamos (CoRR, 2019)

Learning Optimal Search Algorithms from Data. - Shuchi Chawla 001; Evangelia Gergatsouli; Yifeng Teng; Christos Tzamos; Ruimin Zhang (CoRR, 2019)

Design and Dynamic Pricing of Vertically Differentiated Inventories. - Ioannis Stamatopoulos; Christos Tzamos (Manag. Sci., 2019)

Learning Halfspaces with Massart Noise Under Structured Distributions. - Ilias Diakonikolas; Vasilis Kontonis; Christos Tzamos; Nikos Zarifis (COLT, 2020)

Pandora's Box with Correlations: Learning and Approximation. - Shuchi Chawla 001; Evangelia Gergatsouli; Yifeng Teng; Christos Tzamos; Ruimin Zhang (FOCS, 2020)

Black-Box Methods for Restoring Monotonicity. - Evangelia Gergatsouli; Brendan Lucier; Christos Tzamos (ICML, 2020)

Non-Convex SGD Learns Halfspaces with Adversarial Label Noise. - Ilias Diakonikolas; Vasilis Kontonis; Christos Tzamos; Nikos Zarifis (NeurIPS, 2020)

Optimal Private Median Estimation under Minimal Distributional Assumptions. - Christos Tzamos; Emmanouil V. Vlatakis-Gkaragkounis; Ilias Zadik (NeurIPS, 2020)

Menu-size Complexity and Revenue Continuity of Buy-many Mechanisms. - Shuchi Chawla 001; Yifeng Teng; Christos Tzamos (EC, 2020)

Robust Mean Estimation under Coordinate-level Corruption. - Zifan Liu; Jongho Park 004; Nils Palumbo; Theodoros Rekatsinas; Christos Tzamos (CoRR, 2020)

Learning Halfspaces with Tsybakov Noise. - Ilias Diakonikolas; Vasilis Kontonis; Christos Tzamos; Nikos Zarifis (CoRR, 2020)

A Polynomial Time Algorithm for Learning Halfspaces with Tsybakov Noise. - Ilias Diakonikolas; Daniel M. Kane; Vasilis Kontonis; Christos Tzamos; Nikos Zarifis (CoRR, 2020)

Convergence and Sample Complexity of SGD in GANs. - Vasilis Kontonis; Sihan Liu; Christos Tzamos (CoRR, 2020)

Buy-many mechanisms: what are they and why should you care? - Shuchi Chawla 001; Yifeng Teng; Christos Tzamos (SIGecom Exch., 2020)

The Complexity of Black-Box Mechanism Design with Priors. - Evangelia Gergatsouli; Brendan Lucier; Christos Tzamos (ACM Trans. Economics and Comput., 2020)

A Statistical Taylor Theorem and Extrapolation of Truncated Densities. - Constantinos Daskalakis; Vasilis Kontonis; Christos Tzamos; Emmanouil Zampetakis (COLT, 2021)

Boosting in the Presence of Massart Noise. - Ilias Diakonikolas; Russell Impagliazzo; Daniel M. Kane; Rex Lei; Jessica Sorrell; Christos Tzamos (COLT, 2021)

Agnostic Proper Learning of Halfspaces under Gaussian Marginals. - Ilias Diakonikolas; Daniel M. Kane; Vasilis Kontonis; Christos Tzamos; Nikos Zarifis (COLT, 2021)

Efficient Algorithms for Learning from Coarse Labels. - Dimitris Fotakis 001; Alkis Kalavasis; Vasilis Kontonis; Christos Tzamos (COLT, 2021)

Learning Online Algorithms with Distributional Advice. - Ilias Diakonikolas; Vasilis Kontonis; Christos Tzamos; Ali Vakilian; Nikos Zarifis (ICML, 2021)

On Robust Mean Estimation under Coordinate-level Corruption. - Zifan Liu; Jongho Park 004; Theodoros Rekatsinas; Christos Tzamos (ICML, 2021)

Forster Decomposition and Learning Halfspaces with Noise. - Ilias Diakonikolas; Daniel Kane 001; Christos Tzamos (NeurIPS, 2021)

ReLU Regression with Massart Noise. - Ilias Diakonikolas; Jongho Park 004; Christos Tzamos (NeurIPS, 2021)

Fast and Simple Modular Subset Sum. - Kyriakos Axiotis; Arturs Backurs; Karl Bringmann; Ce Jin 001; Vasileios Nakos; Christos Tzamos; Hongxun Wu (SOSA, 2021)

Efficiently learning halfspaces with Tsybakov noise. - Ilias Diakonikolas; Daniel M. Kane; Vasilis Kontonis; Christos Tzamos; Nikos Zarifis (STOC, 2021)

Threshold Phenomena in Learning Halfspaces with Massart Noise. - Ilias Diakonikolas; Daniel M. Kane; Vasilis Kontonis; Christos Tzamos; Nikos Zarifis (CoRR, 2021)

Combinatorial Assortment Optimization. - Nicole Immorlica; Brendan Lucier; Jieming Mao; Vasilis Syrgkanis; Christos Tzamos (ACM Trans. Economics and Comput., 2021)

Learning a Single Neuron with Adversarial Label Noise via Gradient Descent. - Ilias Diakonikolas; Vasilis Kontonis; Christos Tzamos; Nikos Zarifis (COLT, 2022)

Clustering with Queries under Semi-Random Noise. - Alberto Del Pia; Mingchen Ma; Christos Tzamos (COLT, 2022)

Learning General Halfspaces with Adversarial Label Noise via Online Gradient Descent. - Ilias Diakonikolas; Vasilis Kontonis; Christos Tzamos; Nikos Zarifis (ICML, 2022)

Online Learning for Min Sum Set Cover and Pandora's Box. - Evangelia Gergatsouli; Christos Tzamos (ICML, 2022)

Linear Label Ranking with Bounded Noise. - Dimitris Fotakis 001; Alkis Kalavasis; Vasilis Kontonis; Christos Tzamos (NeurIPS, 2022)

Perfect Sampling from Pairwise Comparisons. - Dimitris Fotakis 001; Alkis Kalavasis; Christos Tzamos (NeurIPS, 2022)

Pricing ordered items. - Shuchi Chawla 001; Rojin Rezvan; Yifeng Teng; Christos Tzamos (STOC, 2022)

Learning general halfspaces with general Massart noise under the Gaussian distribution. - Ilias Diakonikolas; Daniel M. Kane; Vasilis Kontonis; Christos Tzamos; Nikos Zarifis (STOC, 2022)

Efficient Parameter Estimation of Truncated Boolean Product Distributions. - Dimitris Fotakis 001; Alkis Kalavasis; Christos Tzamos (Algorithmica, 2022)

A Strongly Polynomial Algorithm for Approximate Forster Transforms and its Application to Halfspace Learning. - Ilias Diakonikolas; Christos Tzamos; Daniel Kane 001 (Electron. Colloquium Comput. Complex., 2022)

Buy-many mechanisms are not much better than item pricing. - Shuchi Chawla 001; Yifeng Teng; Christos Tzamos (Games Econ. Behav., 2022)

Approximating Pandora's Box with Correlations. - Shuchi Chawla 001; Evangelia Gergatsouli; Jeremy McMahan; Christos Tzamos (APPROX/RANDOM, 2023)

Distribution-Independent Regression for Generalized Linear Models with Oblivious Corruptions. - Ilias Diakonikolas; Sushrut Karmalkar; Jongho Park 004; Christos Tzamos (COLT, 2023)

Self-Directed Linear Classification. - Ilias Diakonikolas; Vasilis Kontonis; Christos Tzamos; Nikos Zarifis (COLT, 2023)

Buying Information for Stochastic Optimization. - Mingchen Ma; Christos Tzamos (ICML, 2023)

Graph Connectivity with Noisy Queries. - Dimitris Fotakis 001; Evangelia Gergatsouli; Charilaos Pipis; Miltiadis Stouras; Christos Tzamos (MFCS, 2023)

Optimizing Solution-Samplers for Combinatorial Problems: The Landscape of Policy-Gradient Method. - Constantine Caramanis; Dimitris Fotakis 001; Alkis Kalavasis; Vasilis Kontonis; Christos Tzamos (NeurIPS, 2023)

First Order Stochastic Optimization with Oblivious Noise. - Ilias Diakonikolas; Sushrut Karmalkar; Jongho Park 004; Christos Tzamos (NeurIPS, 2023)

Weitzman's Rule for Pandora's Box with Correlations. - Evangelia Gergatsouli; Christos Tzamos (NeurIPS, 2023)

The Gain from Ordering in Online Learning. - Vasilis Kontonis; Mingchen Ma; Christos Tzamos (NeurIPS, 2023)

Buy-Many Mechanisms for Many Unit-Demand Buyers. - Shuchi Chawla 001; Rojin Rezvan; Yifeng Teng; Christos Tzamos (WINE, 2023)

Optimizing Solution-Samplers for Combinatorial Problems: The Landscape of Policy-Gradient Methods. - Constantine Caramanis; Dimitris Fotakis 001; Alkis Kalavasis; Vasilis Kontonis; Christos Tzamos (CoRR, 2023)

Contextual Pandora's Box. - Alexia Atsidakou; Constantine Caramanis; Evangelia Gergatsouli; Orestis Papadigenopoulos; Christos Tzamos (AAAI, 2024)

Active Learning with Simple Questions. - Vasilis Kontonis; Mingchen Ma; Christos Tzamos (COLT, 2024)

Agnostically Learning Multi-Index Models with Queries. - Ilias Diakonikolas; Daniel M. Kane; Vasilis Kontonis; Christos Tzamos; Nikos Zarifis (FOCS, 2024)

Fast Co-Training under Weak Dependence via Stream-Based Active Learning. - Ilias Diakonikolas; Mingchen Ma; Lisheng Ren; Christos Tzamos (ICML, 2024)

Active Classification with Few Queries under Misspecification. - Vasilis Kontonis; Mingchen Ma; Christos Tzamos (NeurIPS, 2024)

Optimization Can Learn Johnson Lindenstrauss Embeddings. - Nikos Tsikouras; Constantine Caramanis; Christos Tzamos (NeurIPS, 2024)

Online Learning of Halfspaces with Massart Noise. - Ilias Diakonikolas; Vasilis Kontonis; Christos Tzamos; Nikos Zarifis (CoRR, 2024)

Learning Intersections of Two Margin Halfspaces under Factorizable Distributions. - Ilias Diakonikolas; Mingchen Ma; Lisheng Ren; Christos Tzamos (COLT, 2025)

Oracle efficient truncated statistics. - Konstantinos Karatapanis; Vasilis Kontonis; Christos Tzamos (ICLR, 2025)

Statistical Query Hardness of Multiclass Linear Classification with Random Classification Noise. - Ilias Diakonikolas; Mingchen Ma; Lisheng Ren; Christos Tzamos (CoRR, 2025)