default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristos Tzamos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c73]Alexia Atsidakou, Constantine Caramanis, Evangelia Gergatsouli
, Orestis Papadigenopoulos, Christos Tzamos:
Contextual Pandora's Box. AAAI 2024: 10944-10952- [c72]Vasilis Kontonis, Mingchen Ma, Christos Tzamos:
Active Learning with Simple Questions. COLT 2024: 3064-3098 - [c71]Ilias Diakonikolas, Mingchen Ma, Lisheng Ren, Christos Tzamos:
Fast Co-Training under Weak Dependence via Stream-Based Active Learning. ICML 2024 - [i69]Vasilis Kontonis, Mingchen Ma, Christos Tzamos:
Active Learning with Simple Questions. CoRR abs/2405.07937 (2024) - [i68]Ilias Diakonikolas, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis:
Online Learning of Halfspaces with Massart Noise. CoRR abs/2405.12958 (2024) - [i67]Ilias Diakonikolas, Sushrut Karmalkar, Jongho Park, Christos Tzamos:
First Order Stochastic Optimization with Oblivious Noise. CoRR abs/2408.02090 (2024) - 2023
- [c70]Shuchi Chawla, Evangelia Gergatsouli, Jeremy McMahan, Christos Tzamos:
Approximating Pandora's Box with Correlations. APPROX/RANDOM 2023: 26:1-26:24 - [c69]Ilias Diakonikolas, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis:
Self-Directed Linear Classification. COLT 2023: 2919-2947 - [c68]Ilias Diakonikolas, Sushrut Karmalkar, Jongho Park, Christos Tzamos:
Distribution-Independent Regression for Generalized Linear Models with Oblivious Corruptions. COLT 2023: 5453-5475 - [c67]Mingchen Ma, Christos Tzamos:
Buying Information for Stochastic Optimization. ICML 2023: 23388-23411 - [c66]Dimitris Fotakis, Evangelia Gergatsouli, Charilaos Pipis, Miltiadis Stouras, Christos Tzamos:
Graph Connectivity with Noisy Queries. MFCS 2023: 47:1-47:14 - [c65]Constantine Caramanis, Dimitris Fotakis, Alkis Kalavasis, Vasilis Kontonis, Christos Tzamos:
Optimizing Solution-Samplers for Combinatorial Problems: The Landscape of Policy-Gradient Method. NeurIPS 2023 - [c64]Ilias Diakonikolas, Sushrut Karmalkar, Jongho Park, Christos Tzamos:
First Order Stochastic Optimization with Oblivious Noise. NeurIPS 2023 - [c63]Evangelia Gergatsouli, Christos Tzamos:
Weitzman's Rule for Pandora's Box with Correlations. NeurIPS 2023 - [c62]Vasilis Kontonis, Mingchen Ma, Christos Tzamos:
The Gain from Ordering in Online Learning. NeurIPS 2023 - [c61]Ilias Diakonikolas, Christos Tzamos, Daniel M. Kane:
A Strongly Polynomial Algorithm for Approximate Forster Transforms and Its Application to Halfspace Learning. STOC 2023: 1741-1754 - [c60]Shuchi Chawla, Rojin Rezvan, Yifeng Teng, Christos Tzamos:
Buy-Many Mechanisms for Many Unit-Demand Buyers. WINE 2023: 21-38 - [i66]Evangelia Gergatsouli, Christos Tzamos:
Weitzman's Rule for Pandora's Box with Correlations. CoRR abs/2301.13534 (2023) - [i65]Mingchen Ma, Christos Tzamos:
Buying Information for Stochastic Optimization. CoRR abs/2306.03607 (2023) - [i64]Ilias Diakonikolas, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis:
Self-Directed Linear Classification. CoRR abs/2308.03142 (2023) - [i63]Ilias Diakonikolas, Sushrut Karmalkar, Jongho Park, Christos Tzamos:
Distribution-Independent Regression for Generalized Linear Models with Oblivious Corruptions. CoRR abs/2309.11657 (2023) - [i62]Constantine Caramanis, Dimitris Fotakis, Alkis Kalavasis, Vasilis Kontonis, Christos Tzamos:
Optimizing Solution-Samplers for Combinatorial Problems: The Landscape of Policy-Gradient Methods. CoRR abs/2310.05309 (2023) - [i61]Ilias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis:
Agnostically Learning Multi-index Models with Queries. CoRR abs/2312.16616 (2023) - 2022
- [j11]Dimitris Fotakis, Alkis Kalavasis, Christos Tzamos:
Efficient Parameter Estimation of Truncated Boolean Product Distributions. Algorithmica 84(8): 2186-2221 (2022) - [j10]Shuchi Chawla, Yifeng Teng, Christos Tzamos:
Buy-many mechanisms are not much better than item pricing. Games Econ. Behav. 134: 104-116 (2022) - [c59]Ilias Diakonikolas, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis:
Learning a Single Neuron with Adversarial Label Noise via Gradient Descent. COLT 2022: 4313-4361 - [c58]Alberto Del Pia, Mingchen Ma, Christos Tzamos:
Clustering with Queries under Semi-Random Noise. COLT 2022: 5278-5313 - [c57]Ilias Diakonikolas, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis:
Learning General Halfspaces with Adversarial Label Noise via Online Gradient Descent. ICML 2022: 5118-5141 - [c56]Evangelia Gergatsouli, Christos Tzamos:
Online Learning for Min Sum Set Cover and Pandora's Box. ICML 2022: 7382-7403 - [c55]Dimitris Fotakis, Alkis Kalavasis, Vasilis Kontonis, Christos Tzamos:
Linear Label Ranking with Bounded Noise. NeurIPS 2022 - [c54]Dimitris Fotakis, Alkis Kalavasis, Christos Tzamos:
Perfect Sampling from Pairwise Comparisons. NeurIPS 2022 - [c53]Shuchi Chawla, Rojin Rezvan, Yifeng Teng, Christos Tzamos:
Pricing ordered items. STOC 2022: 722-735 - [c52]Ilias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis:
Learning general halfspaces with general Massart noise under the Gaussian distribution. STOC 2022: 874-885 - [i60]Evangelia Gergatsouli, Christos Tzamos:
Online Learning for Min Sum Set Cover and Pandora's Box. CoRR abs/2202.04870 (2022) - [i59]Shuchi Chawla, Rojin Rezvan, Yifeng Teng, Christos Tzamos:
Buy-Many Mechanisms for Many Unit-Demand Buyers. CoRR abs/2204.01962 (2022) - [i58]Alexia Atsidakou, Constantine Caramanis, Evangelia Gergatsouli, Orestis Papadigenopoulos, Christos Tzamos:
Contextual Pandora's Box. CoRR abs/2205.13114 (2022) - [i57]Alberto Del Pia, Mingchen Ma, Christos Tzamos:
Clustering with Queries under Semi-Random Noise. CoRR abs/2206.04583 (2022) - [i56]Ilias Diakonikolas, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis:
Learning a Single Neuron with Adversarial Label Noise via Gradient Descent. CoRR abs/2206.08918 (2022) - [i55]Dimitris Fotakis, Evangelia Gergatsouli, Charilaos Pipis, Miltiadis Stouras, Christos Tzamos:
Graph Connectivity with Noisy Queries. CoRR abs/2208.10423 (2022) - [i54]Dimitris Fotakis, Alkis Kalavasis, Christos Tzamos:
Perfect Sampling from Pairwise Comparisons. CoRR abs/2211.12868 (2022) - [i53]Ilias Diakonikolas, Christos Tzamos, Daniel M. Kane:
A Strongly Polynomial Algorithm for Approximate Forster Transforms and its Application to Halfspace Learning. CoRR abs/2212.03008 (2022) - [i52]Ilias Diakonikolas, Christos Tzamos, Daniel Kane:
A Strongly Polynomial Algorithm for Approximate Forster Transforms and its Application to Halfspace Learning. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j9]Nicole Immorlica, Brendan Lucier, Jieming Mao, Vasilis Syrgkanis, Christos Tzamos:
Combinatorial Assortment Optimization. ACM Trans. Economics and Comput. 9(1): 5:1-5:34 (2021) - [c51]Constantinos Daskalakis, Vasilis Kontonis, Christos Tzamos, Emmanouil Zampetakis:
A Statistical Taylor Theorem and Extrapolation of Truncated Densities. COLT 2021: 1395-1398 - [c50]Ilias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis:
Agnostic Proper Learning of Halfspaces under Gaussian Marginals. COLT 2021: 1522-1551 - [c49]Ilias Diakonikolas, Russell Impagliazzo, Daniel M. Kane, Rex Lei, Jessica Sorrell, Christos Tzamos:
Boosting in the Presence of Massart Noise. COLT 2021: 1585-1644 - [c48]Dimitris Fotakis, Alkis Kalavasis, Vasilis Kontonis, Christos Tzamos:
Efficient Algorithms for Learning from Coarse Labels. COLT 2021: 2060-2079 - [c47]Ilias Diakonikolas, Vasilis Kontonis, Christos Tzamos, Ali Vakilian, Nikos Zarifis:
Learning Online Algorithms with Distributional Advice. ICML 2021: 2687-2696 - [c46]Zifan Liu, Jongho Park, Theodoros Rekatsinas, Christos Tzamos:
On Robust Mean Estimation under Coordinate-level Corruption. ICML 2021: 6914-6924 - [c45]Ilias Diakonikolas, Daniel Kane, Christos Tzamos:
Forster Decomposition and Learning Halfspaces with Noise. NeurIPS 2021: 7732-7744 - [c44]Ilias Diakonikolas, Jongho Park, Christos Tzamos:
ReLU Regression with Massart Noise. NeurIPS 2021: 25891-25903 - [c43]Kyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin, Vasileios Nakos, Christos Tzamos, Hongxun Wu:
Fast and Simple Modular Subset Sum. SOSA 2021: 57-67 - [c42]Ilias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis:
Efficiently learning halfspaces with Tsybakov noise. STOC 2021: 88-101 - [i51]Ilias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis:
Agnostic Proper Learning of Halfspaces under Gaussian Marginals. CoRR abs/2102.05629 (2021) - [i50]Shuchi Chawla, Rojin Rezvan, Yifeng Teng, Christos Tzamos:
Pricing Ordered Items. CoRR abs/2106.04704 (2021) - [i49]Ilias Diakonikolas, Russell Impagliazzo, Daniel Kane, Rex Lei, Jessica Sorrell, Christos Tzamos:
Boosting in the Presence of Massart Noise. CoRR abs/2106.07779 (2021) - [i48]Ilias Diakonikolas, Daniel M. Kane, Christos Tzamos:
Forster Decomposition and Learning Halfspaces with Noise. CoRR abs/2107.05582 (2021) - [i47]Ilias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis:
Threshold Phenomena in Learning Halfspaces with Massart Noise. CoRR abs/2108.08767 (2021) - [i46]Dimitris Fotakis, Alkis Kalavasis, Vasilis Kontonis, Christos Tzamos:
Efficient Algorithms for Learning from Coarse Labels. CoRR abs/2108.09805 (2021) - [i45]Shuchi Chawla, Evangelia Gergatsouli, Jeremy McMahan, Christos Tzamos:
Approximating Pandora's Box with Correlations. CoRR abs/2108.12976 (2021) - [i44]Ilias Diakonikolas, Jongho Park, Christos Tzamos:
ReLU Regression with Massart Noise. CoRR abs/2109.04623 (2021) - 2020
- [j8]Shuchi Chawla, Yifeng Teng, Christos Tzamos:
Buy-many mechanisms: what are they and why should you care? SIGecom Exch. 18(1): 12-18 (2020) - [j7]Evangelia Gergatsouli, Brendan Lucier, Christos Tzamos:
The Complexity of Black-Box Mechanism Design with Priors. ACM Trans. Economics and Comput. 8(4): 20:1-20:19 (2020) - [c41]Ilias Diakonikolas, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis:
Learning Halfspaces with Massart Noise Under Structured Distributions. COLT 2020: 1486-1513 - [c40]Dimitris Fotakis, Alkis Kalavasis, Christos Tzamos:
Efficient Parameter Estimation of Truncated Boolean Product Distributions. COLT 2020: 1586-1600 - [c39]Shuchi Chawla, Evangelia Gergatsouli, Yifeng Teng, Christos Tzamos, Ruimin Zhang:
Pandora's Box with Correlations: Learning and Approximation. FOCS 2020: 1214-1225 - [c38]Evangelia Gergatsouli, Brendan Lucier, Christos Tzamos:
Black-Box Methods for Restoring Monotonicity. ICML 2020: 3463-3473 - [c37]Ilias Diakonikolas, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis:
Non-Convex SGD Learns Halfspaces with Adversarial Label Noise. NeurIPS 2020 - [c36]Christos Tzamos, Emmanouil V. Vlatakis-Gkaragkounis, Ilias Zadik:
Optimal Private Median Estimation under Minimal Distributional Assumptions. NeurIPS 2020 - [c35]Shuchi Chawla, Yifeng Teng, Christos Tzamos:
Menu-size Complexity and Revenue Continuity of Buy-many Mechanisms. EC 2020: 475-476 - [i43]Zifan Liu, Jongho Park, Nils Palumbo, Theodoros Rekatsinas, Christos Tzamos:
Robust Mean Estimation under Coordinate-level Corruption. CoRR abs/2002.04137 (2020) - [i42]Ilias Diakonikolas, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis:
Learning Halfspaces with Massart Noise Under Structured Distributions. CoRR abs/2002.05632 (2020) - [i41]Evangelia Gergatsouli, Brendan Lucier, Christos Tzamos:
Black-box Methods for Restoring Monotonicity. CoRR abs/2003.09554 (2020) - [i40]Shuchi Chawla, Yifeng Teng, Christos Tzamos:
Menu-size Complexity and Revenue Continuity of Buy-many Mechanisms. CoRR abs/2003.10636 (2020) - [i39]Ilias Diakonikolas, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis:
Learning Halfspaces with Tsybakov Noise. CoRR abs/2006.06467 (2020) - [i38]Ilias Diakonikolas, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis:
Non-Convex SGD Learns Halfspaces with Adversarial Label Noise. CoRR abs/2006.06742 (2020) - [i37]Dimitris Fotakis, Alkis Kalavasis, Christos Tzamos:
Efficient Parameter Estimation of Truncated Boolean Product Distributions. CoRR abs/2007.02392 (2020) - [i36]Kyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin, Vasileios Nakos, Christos Tzamos, Hongxun Wu:
Fast and Simple Modular Subset Sum. CoRR abs/2008.10577 (2020) - [i35]Ilias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis:
A Polynomial Time Algorithm for Learning Halfspaces with Tsybakov Noise. CoRR abs/2010.01705 (2020) - [i34]Constantinos Daskalakis, Themis Gouleakis, Christos Tzamos, Manolis Zampetakis:
Computationally and Statistically Efficient Truncated Regression. CoRR abs/2010.12000 (2020) - [i33]Christos Tzamos, Emmanouil V. Vlatakis-Gkaragkounis, Ilias Zadik:
Optimal Private Median Estimation under Minimal Distributional Assumptions. CoRR abs/2011.06202 (2020) - [i32]Vasilis Kontonis, Sihan Liu, Christos Tzamos:
Convergence and Sample Complexity of SGD in GANs. CoRR abs/2012.00732 (2020)
2010 – 2019
- 2019
- [j6]Ioannis Stamatopoulos, Christos Tzamos:
Design and Dynamic Pricing of Vertically Differentiated Inventories. Manag. Sci. 65(9): 4222-4241 (2019) - [c34]Daniel Alabi, Adam Tauman Kalai, Katrina Ligett, Cameron Musco, Christos Tzamos, Ellen Vitercik:
Learning to Prune: Speeding up Repeated Computations. COLT 2019: 30-33 - [c33]Constantinos Daskalakis, Themis Gouleakis, Christos Tzamos, Manolis Zampetakis:
Computationally and Statistically Efficient Truncated Regression. COLT 2019: 955-960 - [c32]Shuchi Chawla, Yifeng Teng, Christos Tzamos:
Buy-Many Mechanisms are Not Much Better than Item Pricing. EC 2019: 237-238 - [c31]Evangelia Gergatsouli, Brendan Lucier, Christos Tzamos:
The Complexity of Black-Box Mechanism Design with Priors. EC 2019: 869-883 - [c30]Vasilis Kontonis, Christos Tzamos, Manolis Zampetakis:
Efficient Truncated Statistics with Unknown Truncation. FOCS 2019: 1578-1595 - [c29]Kyriakos Axiotis, Christos Tzamos:
Capacitated Dynamic Programming: Faster Knapsack and Graph Algorithms. ICALP 2019: 19:1-19:13 - [c28]Ilias Diakonikolas, Themis Gouleakis, Christos Tzamos:
Distribution-Independent PAC Learning of Halfspaces with Massart Noise. NeurIPS 2019: 4751-4762 - [c27]Kyriakos Axiotis, Arturs Backurs, Ce Jin, Christos Tzamos, Hongxun Wu:
Fast Modular Subset Sum using Linear Sketching. SODA 2019: 58-69 - [c26]Gautam Kamath, Christos Tzamos:
Anaconda: A Non-Adaptive Conditional Sampling Algorithm for Distribution Testing. SODA 2019: 679-693 - [c25]Nicole Immorlica, Jieming Mao, Christos Tzamos:
Diversity and Exploration in Social Learning. WWW 2019: 762-772 - [i31]Shuchi Chawla, Yifeng Teng, Christos Tzamos:
Reasonable multi-item mechanisms are not much better than item pricing. CoRR abs/1902.10315 (2019) - [i30]Daniel Alabi, Adam Tauman Kalai, Katrina Ligett, Cameron Musco, Christos Tzamos, Ellen Vitercik:
Learning to Prune: Speeding up Repeated Computations. CoRR abs/1904.11875 (2019) - [i29]Nicole Immorlica, Jieming Mao, Christos Tzamos:
Diversity and Exploration in Social Learning. CoRR abs/1905.05213 (2019) - [i28]Ilias Diakonikolas, Themis Gouleakis, Christos Tzamos:
Distribution-Independent PAC Learning of Halfspaces with Massart Noise. CoRR abs/1906.10075 (2019) - [i27]Evangelia Gergatsouli, Brendan Lucier, Christos Tzamos:
The Complexity of Black-Box Mechanism Design with Priors. CoRR abs/1906.10794 (2019) - [i26]Vasilis Kontonis, Christos Tzamos, Manolis Zampetakis:
Efficient Truncated Statistics with Unknown Truncation. CoRR abs/1908.01034 (2019) - [i25]Shuchi Chawla, Evangelia Gergatsouli, Yifeng Teng, Christos Tzamos, Ruimin Zhang:
Learning Optimal Search Algorithms from Data. CoRR abs/1911.01632 (2019) - 2018
- [c24]Costis Daskalakis, Christos Tzamos, Manolis Zampetakis:
Bootstrapping EM via Power EM and Convergence in the Naive Bayes Model. AISTATS 2018: 2056-2064 - [c23]Steve Hanneke, Adam Tauman Kalai, Gautam Kamath, Christos Tzamos:
Actively Avoiding Nonsense in Generative Models. COLT 2018: 209-227 - [c22]Themis Gouleakis, Christos Tzamos, Manolis Zampetakis:
Certified Computation from Unreliable Datasets. COLT 2018: 3271-3294 - [c21]Constantinos Daskalakis, Themis Gouleakis, Christos Tzamos, Manolis Zampetakis:
Efficient Statistics, in High Dimensions, from Truncated Samples. FOCS 2018: 639-649 - [c20]Constantinos Daskalakis, Christos Tzamos, Manolis Zampetakis:
A converse to Banach's fixed point theorem and its CLS-completeness. STOC 2018: 44-50 - [c19]Nicole Immorlica, Brendan Lucier, Jieming Mao, Vasilis Syrgkanis, Christos Tzamos:
Combinatorial Assortment Optimization. WINE 2018: 218-231 - [i24]Kyriakos Axiotis, Christos Tzamos:
Capacitated Dynamic Programming: Faster Knapsack and Graph Algorithms. CoRR abs/1802.06440 (2018) - [i23]Steve Hanneke, Adam Kalai, Gautam Kamath, Christos Tzamos:
Actively Avoiding Nonsense in Generative Models. CoRR abs/1802.07229 (2018) - [i22]Kyriakos Axiotis, Arturs Backurs, Christos Tzamos:
Fast Modular Subset Sum using Linear Sketching. CoRR abs/1807.04825 (2018) - [i21]Gautam Kamath, Christos Tzamos:
Anaconda: A Non-Adaptive Conditional Sampling Algorithm for Distribution Testing. CoRR abs/1807.06168 (2018) - [i20]Constantinos Daskalakis, Themis Gouleakis, Christos Tzamos, Manolis Zampetakis:
Efficient Statistics, in High Dimensions, from Truncated Samples. CoRR abs/1809.03986 (2018) - [i19]Gautam Kamath, Christos Tzamos:
Anaconda: A Non-Adaptive Conditional Sampling Algorithm for Distribution Testing. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [b1]Christos Tzamos:
Mechanism design: from optimal transport theory to revenue maximization. Massachusetts Institute of Technology, Cambridge, USA, 2017 - [c18]Constantinos Daskalakis, Christos Tzamos, Manolis Zampetakis:
Ten Steps of EM Suffice for Mixtures of Two Gaussians. COLT 2017: 704-710 - [c17]Arturs Backurs, Christos Tzamos:
Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms. ICML 2017: 311-321 - [c16]Themistoklis Gouleakis, Christos Tzamos, Manolis Zampetakis:
Faster Sublinear Algorithms using Conditional Sampling. SODA 2017: 1743-1757 - [i18]Iddan Golomb, Christos Tzamos:
Truthful Facility Location with Additive Errors. CoRR abs/1701.00529 (2017) - [i17]Constantinos Daskalakis, Christos Tzamos, Manolis Zampetakis:
A Converse to Banach's Fixed Point Theorem and its CLS Completeness. CoRR abs/1702.07339 (2017) - [i16]Themis Gouleakis, Christos Tzamos, Manolis Zampetakis:
Certified Computation in Crowdsourcing. CoRR abs/1709.03926 (2017) - [i15]Nicole Immorlica, Brendan Lucier, Jieming Mao, Vasilis Syrgkanis, Christos Tzamos:
Combinatorial Assortment Optimization. CoRR abs/1711.02601 (2017) - 2016
- [j5]Dimitris Fotakis, Christos Tzamos:
Strategyproof Facility Location for Concave Cost Functions. Algorithmica 76(1): 143-167 (2016) - [j4]Dimitris Fotakis, Dimitris Tsipras, Christos Tzamos, Emmanouil Zampetakis:
Efficient Money Burning in General Domains. Theory Comput. Syst. 59(4): 619-640 (2016) - [c15]Arturs Backurs, Nishanth Dikkala, Christos Tzamos:
Tight Hardness Results for Maximum Weight Rectangles. ICALP 2016: 81:1-81:13 - [c14]Constantinos Daskalakis, Christos H. Papadimitriou, Christos Tzamos:
Does Information Revelation Improve Revenue? EC 2016: 233-250 - [c13]Dimitris Fotakis, Christos Tzamos, Manolis Zampetakis:
Mechanism Design with Selective Verification. EC 2016: 771-788 - [c12]Constantinos Daskalakis, Anindya De, Gautam Kamath, Christos Tzamos:
A size-free CLT for poisson multinomials and its applications. STOC 2016: 1074-1086 - [c11]Christos Tzamos, Christopher A. Wilkens:
Anonymous Auctions Maximizing Revenue. WINE 2016: 188-206 - [i14]Arturs Backurs, Nishanth Dikkala, Christos Tzamos:
Tight Hardness Results for Maximum Weight Rectangles. CoRR abs/1602.05837 (2016) - [i13]Arturs Backurs, Christos Tzamos:
Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms. CoRR abs/1607.04229 (2016) - [i12]Themistoklis Gouleakis, Christos Tzamos, Manolis Zampetakis:
Faster Sublinear Algorithms using Conditional Sampling. CoRR abs/1608.04759 (2016) - [i11]Constantinos Daskalakis, Christos Tzamos, Manolis Zampetakis:
Ten Steps of EM Suffice for Mixtures of Two Gaussians. CoRR abs/1609.00368 (2016) - 2015
- [c10]Constantinos Daskalakis, Gautam Kamath, Christos Tzamos:
On the Structure, Covering, and Learning of Poisson Multinomial Distributions. FOCS 2015: 1203-1217 - [c9]William Wu, Constantinos Daskalakis, Nicolaas Kaashoek, Christos Tzamos, S. Matthew Weinberg:
Game Theory based Peer Grading Mechanisms for MOOCs. L@S 2015: 281-286 - [c8]Dimitris Fotakis, Dimitris Tsipras, Christos Tzamos, Emmanouil Zampetakis:
Efficient Money Burning in General Domains. SAGT 2015: 85-97 - [c7]Constantinos Daskalakis, Alan Deckelbaum, Christos Tzamos:
Strong Duality for a Multiple-Good Monopolist. EC 2015: 449-450 - [i10]Constantinos Daskalakis, Alan Deckelbaum, Christos Tzamos:
Mechanism Design via Optimal Transport. CoRR abs/1503.01958 (2015) - [i9]Constantinos Daskalakis, Alan Deckelbaum, Christos Tzamos:
Optimal Pricing is Hard. CoRR abs/1503.02516 (2015) - [i8]Constantinos Daskalakis, Gautam Kamath, Christos Tzamos:
On the Structure, Covering, and Learning of Poisson Multinomial Distributions. CoRR abs/1504.08363 (2015) - [i7]Dimitris Fotakis, Christos Tzamos, Emmanouil Zampetakis:
Who to Trust for Truthfully Maximizing Welfare? CoRR abs/1507.02301 (2015) - [i6]Constantinos Daskalakis, Anindya De, Gautam Kamath, Christos Tzamos:
A Size-Free CLT for Poisson Multinomials and its Applications. CoRR abs/1511.03641 (2015) - 2014
- [j3]Dimitris Fotakis, Christos Tzamos:
On the Power of Deterministic Mechanisms for Facility Location Games. ACM Trans. Economics and Comput. 2(4): 15:1-15:37 (2014) - [c6]Constantinos Daskalakis, Alan Deckelbaum, Christos Tzamos:
The Complexity of Optimal Mechanism Design. SODA 2014: 1302-1318 - [i5]Constantinos Daskalakis, Alan Deckelbaum, Christos Tzamos:
Strong Duality for a Multiple-Good Monopolist. CoRR abs/1409.4150 (2014) - [i4]Christos Tzamos, Christopher A. Wilkens:
The Value of Knowing Your Enemy. CoRR abs/1411.1379 (2014) - 2013
- [j2]Dimitris Fotakis, Christos Tzamos:
Strategyproof facility location with concave costs. SIGecom Exch. 12(2): 46-49 (2013) - [j1]Dimitris Fotakis, Christos Tzamos:
Winner-imposing strategyproof mechanisms for multiple Facility Location games. Theor. Comput. Sci. 472: 90-103 (2013) - [c5]Dimitris Fotakis, Christos Tzamos:
On the Power of Deterministic Mechanisms for Facility Location Games. ICALP (1) 2013: 449-460 - [c4]Constantinos Daskalakis, Alan Deckelbaum, Christos Tzamos:
Mechanism design via optimal transport. EC 2013: 269-286 - [c3]Dimitris Fotakis, Christos Tzamos:
Strategyproof facility location for concave cost functions. EC 2013: 435-452 - [i3]Dimitris Fotakis, Christos Tzamos:
Strategy-Proof Facility Location for Concave Cost Functions. CoRR abs/1305.3333 (2013) - 2012
- [c2]Constantinos Daskalakis, Alan Deckelbaum, Christos Tzamos:
Optimal Pricing Is Hard. WINE 2012: 298-308 - [i2]Dimitris Fotakis, Christos Tzamos:
On the Power of Deterministic Mechanisms for Facility Location Games. CoRR abs/1207.0935 (2012) - [i1]Constantinos Daskalakis, Alan Deckelbaum, Christos Tzamos:
The Complexity of Optimal Mechanism Design. CoRR abs/1211.1703 (2012) - 2010
- [c1]Dimitris Fotakis, Christos Tzamos:
Winner-Imposing Strategyproof Mechanisms for Multiple Facility Location Games. WINE 2010: 234-245
Coauthor Index
Constantinos Daskalakis
aka: Costis Daskalakis
aka: Costis Daskalakis
Themis Gouleakis
aka: Themistoklis Gouleakis
aka: Themistoklis Gouleakis
Manolis Zampetakis
aka: Emmanouil Zampetakis
aka: Emmanouil Zampetakis
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 2024-10-07 21:16 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:
