default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDManolis Zampetakis
Emmanouil Zampetakis
Person information
- affiliation: Yale University, New Haven, CT, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c43]Alkis Kalavasis, Anay Mehrotra, Manolis Zampetakis:
Smaller Confidence Intervals From IPW Estimators via Data-Dependent Coarsening (Extended Abstract). COLT 2024: 2767- [c42]Emanuel Tewolde, Brian Hu Zhang, Caspar Oesterheld, Manolis Zampetakis, Tuomas Sandholm, Paul Goldberg, Vincent Conitzer:
Imperfect-Recall Games: Equilibrium Concepts and Their Complexity. IJCAI 2024: 2994-3004 - [c41]Ioannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm, Manolis Zampetakis
:
On the Complexity of Computing Sparse Equilibria and Lower Bounds for No-Regret Learning in Games. ITCS 2024: 5:1-5:24 - [i42]Alkis Kalavasis, Ilias Zadik, Manolis Zampetakis:
Transfer Learning Beyond Bounded Density Ratios. CoRR abs/2403.11963 (2024) - [i41]Alkis Kalavasis, Amin Karbasi, Argyris Oikonomou, Katerina Sotiraki, Grigoris Velegkas, Manolis Zampetakis:
Injecting Undetectable Backdoors in Deep Learning and Language Models. CoRR abs/2406.05660 (2024) - [i40]Emanuel Tewolde, Brian Hu Zhang, Caspar Oesterheld, Manolis Zampetakis, Tuomas Sandholm, Paul W. Goldberg, Vincent Conitzer:
Imperfect-Recall Games: Equilibrium Concepts and Their Complexity. CoRR abs/2406.15970 (2024) - [i39]Jane H. Lee, Anay Mehrotra, Manolis Zampetakis:
Efficient Statistics With Unknown Truncation, Polynomial Time Algorithms, Beyond Gaussians. CoRR abs/2410.01656 (2024) - [i38]Alkis Kalavasis, Anay Mehrotra, Manolis Zampetakis:
Smaller Confidence Intervals From IPW Estimators via Data-Dependent Coarsening. CoRR abs/2410.01658 (2024) - [i37]Shuchen Li, Ilias Zadik, Manolis Zampetakis:
On the Hardness of Learning One Hidden Layer Neural Networks. CoRR abs/2410.03477 (2024) - 2023
- [j5]Michael I. Jordan, Tianyi Lin, Manolis Zampetakis:
First-Order Algorithms for Nonlinear Generalized Nash Equilibrium Problems. J. Mach. Learn. Res. 24: 38:1-38:46 (2023) - [j4]Aris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki, Manolis Zampetakis:
Consensus-Halving: Does It Ever Get Easier? SIAM J. Comput. 52(2): 412-451 (2023) - [c40]Emmanouil Zampetakis, Fred Zhang:
Bayesian Strategy-Proof Facility Location via Robust Estimation. AISTATS 2023: 4196-4208 - [c39]Michael I. Jordan, Guy Kornowski, Tianyi Lin, Ohad Shamir, Manolis Zampetakis:
Deterministic Nonsmooth Nonconvex Optimization. COLT 2023: 4570-4597 - [c38]Constantinos Daskalakis, Noah Golowich, Stratis Skoulakis, Emmanouil Zampetakis:
STay-ON-the-Ridge: Guaranteed Convergence to Local Minimax Equilibrium in Nonconvex-Nonconcave Games. COLT 2023: 5146-5198 - [c37]Alexandros Hollender, Emmanouil Zampetakis:
The Computational Complexity of Finding Stationary Points in Non-Convex Optimization. COLT 2023: 5571-5572 - [c36]Jane H. Lee, Andre Wibisono, Emmanouil Zampetakis:
Learning Exponential Families from Truncated Samples. NeurIPS 2023 - [c35]Naveen Durvasula, Nika Haghtalab, Manolis Zampetakis:
Smoothed Analysis of Online Non-parametric Auctions. EC 2023: 540-560 - [c34]Christos H. Papadimitriou, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Manolis Zampetakis:
The Computational Complexity of Multi-player Concave Games and Kakutani Fixed Points. EC 2023: 1045 - [c33]Yeshwanth Cherapanamjeri, Constantinos Daskalakis, Andrew Ilyas, Manolis Zampetakis:
What Makes a Good Fisherman? Linear Regression under Self-Selection Bias. STOC 2023: 1699-1712 - [i36]Michael I. Jordan, Guy Kornowski, Tianyi Lin, Ohad Shamir, Manolis Zampetakis:
Deterministic Nonsmooth Nonconvex Optimization. CoRR abs/2302.08300 (2023) - [i35]Alexandros Hollender, Manolis Zampetakis:
The Computational Complexity of Finding Stationary Points in Non-Convex Optimization. CoRR abs/2310.09157 (2023) - [i34]Kiriaki Frangias, Andrew Lin, Ellen Vitercik, Manolis Zampetakis:
Algorithmic Contract Design for Crowdsourced Ranking. CoRR abs/2310.09974 (2023) - [i33]Ellen Vitercik, Manolis Zampetakis, David Zhang:
Sorting from Crowdsourced Comparisons using Expert Verifications. CoRR abs/2310.14113 (2023) - [i32]Ioannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm, Manolis Zampetakis:
On the Complexity of Computing Sparse Equilibria and Lower Bounds for No-Regret Learning in Games. CoRR abs/2311.14869 (2023) - [i31]Anay Mehrotra, Manolis Zampetakis, Paul Kassianik, Blaine Nelson, Hyrum S. Anderson, Yaron Singer, Amin Karbasi:
Tree of Attacks: Jailbreaking Black-Box LLMs Automatically. CoRR abs/2312.02119 (2023) - 2022
- [j3]Manolis Zampetakis:
Analyzing data with systematic bias. SIGecom Exch. 20(1): 55-63 (2022) - [c32]Alkis Kalavasis, Konstantinos Stavropoulos, Emmanouil Zampetakis:
Learning and Covering Sums of Independent Random Variables with Unbounded Support. NeurIPS 2022 - [c31]Yeshwanth Cherapanamjeri, Constantinos Daskalakis, Andrew Ilyas, Manolis Zampetakis:
Estimation of Standard Auction Models. EC 2022: 602-603 - [i30]Michael I. Jordan, Tianyi Lin, Manolis Zampetakis:
First-Order Algorithms for Nonlinear Generalized Nash Equilibrium Problems. CoRR abs/2204.03132 (2022) - [i29]Yeshwanth Cherapanamjeri, Constantinos Daskalakis, Andrew Ilyas, Manolis Zampetakis:
Estimation of Standard Auction Models. CoRR abs/2205.02060 (2022) - [i28]Yeshwanth Cherapanamjeri, Constantinos Daskalakis, Andrew Ilyas, Manolis Zampetakis:
What Makes A Good Fisherman? Linear Regression under Self-Selection Bias. CoRR abs/2205.03246 (2022) - [i27]Christos H. Papadimitriou, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Manolis Zampetakis:
The Computational Complexity of Multi-player Concave Games and Kakutani Fixed Points. CoRR abs/2207.07557 (2022) - [i26]Constantinos Daskalakis, Patroklos Stefanou, Rui Yao, Manolis Zampetakis:
Efficient Truncated Linear Regression with Unknown Noise Variance. CoRR abs/2208.12042 (2022) - [i25]Michael I. Jordan, Tianyi Lin, Manolis Zampetakis:
On the Complexity of Deterministic Nonsmooth and Nonconvex Optimization. CoRR abs/2209.12463 (2022) - [i24]Constantinos Daskalakis, Noah Golowich, Stratis Skoulakis, Manolis Zampetakis:
STay-ON-the-Ridge: Guaranteed Convergence to Local Minimax Equilibrium in Nonconvex-Nonconcave Games. CoRR abs/2210.09769 (2022) - [i23]Alkis Kalavasis, Konstantinos Stavropoulos, Manolis Zampetakis:
Learning and Covering Sums of Independent Random Variables with Unbounded Support. CoRR abs/2210.13313 (2022) - 2021
- [c30]Constantinos Daskalakis, Vasilis Kontonis, Christos Tzamos, Emmanouil Zampetakis:
A Statistical Taylor Theorem and Extrapolation of Truncated Densities. COLT 2021: 1395-1398 - [c29]Constantinos Daskalakis, Patroklos Stefanou, Rui Yao, Emmanouil Zampetakis:
Efficient Truncated Linear Regression with Unknown Noise Variance. NeurIPS 2021: 1952-1963 - [c28]Róbert Busa-Fekete, Dimitris Fotakis, Emmanouil Zampetakis:
Private and Non-private Uniformity Testing for Ranking Data. NeurIPS 2021: 9480-9492 - [c27]Wenshuo Guo, Michael I. Jordan, Emmanouil Zampetakis:
Robust Learning of Optimal Auctions. NeurIPS 2021: 21273-21284 - [c26]Róbert Busa-Fekete, Dimitris Fotakis, Balázs Szörényi, Emmanouil Zampetakis:
Identity testing for Mallows model. NeurIPS 2021: 23179-23190 - [c25]Aris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki, Manolis Zampetakis:
A Topological Characterization of Modulo-p Arguments and Implications for Necklace Splitting. SODA 2021: 2615-2634 - [c24]Constantinos Daskalakis, Stratis Skoulakis, Manolis Zampetakis:
The complexity of constrained min-max optimization. STOC 2021: 1466-1478 - [i22]Wenshuo Guo, Michael I. Jordan, Manolis Zampetakis:
Robust Learning of Optimal Auctions. CoRR abs/2107.06259 (2021) - [i21]Tatjana Chavdarova, Michael I. Jordan, Manolis Zampetakis:
Last-Iterate Convergence of Saddle Point Optimizers via High-Resolution Differential Equations. CoRR abs/2112.13826 (2021) - 2020
- [c23]Andrew Ilyas, Emmanouil Zampetakis, Constantinos Daskalakis:
A Theoretical and Practical Framework for Regression and Classification from Truncated Samples. AISTATS 2020: 4463-4473 - [c22]Mika Göös, Pritish Kamath, Katerina Sotiraki, Manolis Zampetakis:
On the Complexity of Modulo-q Arguments and the Chevalley - Warning Theorem. CCC 2020: 19:1-19:42 - [c21]Vasilis Syrgkanis, Manolis Zampetakis:
Estimation and Inference with Trees and Forests in High Dimensions. COLT 2020: 3453-3454 - [c20]Constantinos Daskalakis, Dhruv Rohatgi, Emmanouil Zampetakis:
Truncated Linear Regression in High Dimensions. NeurIPS 2020 - [c19]Constantinos Daskalakis, Dhruv Rohatgi, Emmanouil Zampetakis:
Constant-Expansion Suffices for Compressed Sensing with Generative Priors. NeurIPS 2020 - [c18]Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Emmanouil Zampetakis:
Optimal Approximation - Smoothness Tradeoffs for Soft-Max Functions. NeurIPS 2020 - [c17]Constantinos Daskalakis, Manolis Zampetakis:
More Revenue from Two Samples via Factor Revealing SDPs. EC 2020: 257-272 - [c16]Aris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki, Manolis Zampetakis:
Consensus-Halving: Does It Ever Get Easier? EC 2020: 381-399 - [i20]Aris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki, Manolis Zampetakis:
Consensus-Halving: Does it Ever Get Easier? CoRR abs/2002.11437 (2020) - [i19]Aris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki, Manolis Zampetakis:
A Topological Characterization of Modulo-p Arguments and Implications for Necklace Splitting. CoRR abs/2003.11974 (2020) - [i18]Constantinos Daskalakis, Dhruv Rohatgi, Manolis Zampetakis:
Constant-Expansion Suffices for Compressed Sensing with Generative Priors. CoRR abs/2006.04237 (2020) - [i17]Vasilis Syrgkanis, Manolis Zampetakis:
Estimation and Inference with Trees and Forests in High Dimensions. CoRR abs/2007.03210 (2020) - [i16]Constantinos Daskalakis, Dhruv Rohatgi, Manolis Zampetakis:
Truncated Linear Regression in High Dimensions. CoRR abs/2007.14539 (2020) - [i15]Constantinos Daskalakis, Stratis Skoulakis, Manolis Zampetakis:
The Complexity of Constrained Min-Max Optimization. CoRR abs/2009.09623 (2020) - [i14]Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Manolis Zampetakis:
Optimal Approximation - Smoothness Tradeoffs for Soft-Max Functions. CoRR abs/2010.11450 (2020) - [i13]Constantinos Daskalakis, Themis Gouleakis, Christos Tzamos, Manolis Zampetakis:
Computationally and Statistically Efficient Truncated Regression. CoRR abs/2010.12000 (2020)
2010 – 2019
- 2019
- [c15]Róbert Busa-Fekete, Dimitris Fotakis, Balázs Szörényi, Manolis Zampetakis:
Optimal Learning of Mallows Block Model. COLT 2019: 529-532 - [c14]Constantinos Daskalakis, Themis Gouleakis, Christos Tzamos, Manolis Zampetakis:
Computationally and Statistically Efficient Truncated Regression. COLT 2019: 955-960 - [c13]Vasilis Kontonis, Christos Tzamos, Manolis Zampetakis:
Efficient Truncated Statistics with Unknown Truncation. FOCS 2019: 1578-1595 - [i12]Róbert Busa-Fekete, Dimitris Fotakis, Balázs Szörényi, Manolis Zampetakis:
Optimal Learning of Mallows Block Model. CoRR abs/1906.01009 (2019) - [i11]Vasilis Kontonis, Christos Tzamos, Manolis Zampetakis:
Efficient Truncated Statistics with Unknown Truncation. CoRR abs/1908.01034 (2019) - [i10]Mika Göös, Pritish Kamath, Katerina Sotiraki, Manolis Zampetakis:
On the Complexity of Modulo-q Arguments and the Chevalley-Warning Theorem. CoRR abs/1912.04467 (2019) - 2018
- [c12]Costis Daskalakis, Christos Tzamos, Manolis Zampetakis:
Bootstrapping EM via Power EM and Convergence in the Naive Bayes Model. AISTATS 2018: 2056-2064 - [c11]Themis Gouleakis, Christos Tzamos, Manolis Zampetakis:
Certified Computation from Unreliable Datasets. COLT 2018: 3271-3294 - [c10]Katerina Sotiraki, Manolis Zampetakis, Giorgos Zirdelis:
PPP-Completeness with Connections to Cryptography. FOCS 2018: 148-158 - [c9]Constantinos Daskalakis, Themis Gouleakis, Christos Tzamos, Manolis Zampetakis:
Efficient Statistics, in High Dimensions, from Truncated Samples. FOCS 2018: 639-649 - [c8]Constantinos Daskalakis, Christos Tzamos, Manolis Zampetakis:
A converse to Banach's fixed point theorem and its CLS-completeness. STOC 2018: 44-50 - [i9]Katerina Sotiraki, Manolis Zampetakis, Giorgos Zirdelis:
PPP-Completeness with Connections to Cryptography. CoRR abs/1808.06407 (2018) - [i8]Constantinos Daskalakis, Themis Gouleakis, Christos Tzamos, Manolis Zampetakis:
Efficient Statistics, in High Dimensions, from Truncated Samples. CoRR abs/1809.03986 (2018) - [i7]Katerina Sotiraki, Manolis Zampetakis, Giorgos Zirdelis:
PPP-Completeness with Connections to Cryptography. IACR Cryptol. ePrint Arch. 2018: 778 (2018) - 2017
- [c7]Constantinos Daskalakis, Christos Tzamos, Manolis Zampetakis:
Ten Steps of EM Suffice for Mixtures of Two Gaussians. COLT 2017: 704-710 - [c6]Themistoklis Gouleakis, Christos Tzamos, Manolis Zampetakis:
Faster Sublinear Algorithms using Conditional Sampling. SODA 2017: 1743-1757 - [i6]Constantinos Daskalakis, Christos Tzamos, Manolis Zampetakis:
A Converse to Banach's Fixed Point Theorem and its CLS Completeness. CoRR abs/1702.07339 (2017) - [i5]Themis Gouleakis, Christos Tzamos, Manolis Zampetakis:
Certified Computation in Crowdsourcing. CoRR abs/1709.03926 (2017) - 2016
- [j2]Dimitris Fotakis, Dimitris Tsipras, Christos Tzamos, Emmanouil Zampetakis:
Efficient Money Burning in General Domains. Theory Comput. Syst. 59(4): 619-640 (2016) - [c5]Dimitris Fotakis, Christos Tzamos, Manolis Zampetakis:
Mechanism Design with Selective Verification. EC 2016: 771-788 - [i4]Themistoklis Gouleakis, Christos Tzamos, Manolis Zampetakis:
Faster Sublinear Algorithms using Conditional Sampling. CoRR abs/1608.04759 (2016) - [i3]Constantinos Daskalakis, Christos Tzamos, Manolis Zampetakis:
Ten Steps of EM Suffice for Mixtures of Two Gaussians. CoRR abs/1609.00368 (2016) - 2015
- [j1]Dimitris Fotakis, Emmanouil Zampetakis:
Truthfulness Flooded Domains and the Power of Verification for Mechanism Design. ACM Trans. Economics and Comput. 3(4): 20:1-20:29 (2015) - [c4]Dimitris Fotakis, Dimitris Tsipras, Christos Tzamos, Emmanouil Zampetakis:
Efficient Money Burning in General Domains. SAGT 2015: 85-97 - [c3]Dimitris Fotakis, Ioannis Milis, Orestis Papadigenopoulos, Emmanouil Zampetakis, Georgios Zois:
Scheduling MapReduce Jobs and Data Shuffle on Unrelated Processors. SEA 2015: 137-150 - [i2]Dimitris Fotakis, Christos Tzamos, Emmanouil Zampetakis:
Who to Trust for Truthfully Maximizing Welfare? CoRR abs/1507.02301 (2015) - 2014
- [c2]Dimitris Fotakis, Ioannis Milis, Emmanouil Zampetakis, Georgios Zois:
Scheduling MapReduce Jobs on Unrelated Processors. EDBT/ICDT Workshops 2014: 2-5 - 2013
- [c1]Dimitris Fotakis, Emmanouil Zampetakis:
Truthfulness Flooded Domains and the Power of Verification for Mechanism Design. WINE 2013: 202-215 - [i1]Dimitris Fotakis, Ioannis Milis, Emmanouil Zampetakis, Georgios Zois:
Scheduling MapReduce Jobs on Unrelated Processors. CoRR abs/1312.4203 (2013)
Coauthor Index
Constantinos Daskalakis
aka: Costis Daskalakis
aka: Costis Daskalakis
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-12-01 00:08 CET 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:
