| Estimating the unseen: an n/log (n)-sample estimator for entropy and support size, shown optimal via new CLTs G Valiant, P Valiant Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 343 | 2011 |
| Optimal algorithms for testing closeness of discrete distributions SO Chan, I Diakonikolas, P Valiant, G Valiant Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014 | 239 | 2014 |
| An automatic inequality prover and instance optimal identity testing G Valiant, P Valiant SIAM Journal on Computing 46 (1), 429-455, 2017 | 234 | 2017 |
| Incrementally verifiable computation or proofs of knowledge imply time/space efficiency P Valiant Theory of Cryptography: Fifth Theory of Cryptography Conference, TCC 2008 …, 2008 | 232 | 2008 |
| Testing symmetric properties of distributions P Valiant Proceedings of the fortieth annual ACM symposium on Theory of computing, 383-392, 2008 | 213 | 2008 |
| Estimating the unseen: improved estimators for entropy and other properties G Valiant, P Valiant Journal of the ACM (JACM) 64 (6), 1-41, 2017 | 191 | 2017 |
| The power of linear estimators G Valiant, P Valiant 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 403-412, 2011 | 168 | 2011 |
| Implicit regularization for deep neural networks driven by an ornstein-uhlenbeck like process G Blanc, N Gupta, G Valiant, P Valiant Conference on learning theory, 483-513, 2020 | 145 | 2020 |
| A CLT and tight lower bounds for estimating entropy G Valiant, P Valiant Electronic Colloquium on Computational Complexity (ECCC) 17 (179), 9, 2010 | 98 | 2010 |
| On the complexity of two-player win-lose games T Abbott, D Kane, P Valiant 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 113-122, 2005 | 91 | 2005 |
| Testing k-Modal Distributions: Optimal Algorithms via Reductions C Daskalakis, I Diakonikolas, RA Servedio, G Valiant, P Valiant Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013 | 87 | 2013 |
| Size and treewidth bounds for conjunctive queries G Gottlob, ST Lee, G Valiant, P Valiant Journal of the ACM (JACM) 59 (3), 1-35, 2012 | 83 | 2012 |
| Instance optimal learning of discrete distributions G Valiant, P Valiant Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 66 | 2016 |
| How to construct a correct and scalable iBGP configuration M Vutukuru, P Valiant, S Kopparty, H Balakrishnan | 61 | 2005 |
| Quantifying unobserved protein-coding variants in human populations provides a roadmap for large-scale sequencing projects J Zou, G Valiant, P Valiant, K Karczewski, SO Chan, K Samocha, M Lek, ... Nature communications 7 (1), 13293, 2016 | 50 | 2016 |
| The tensor product of two codes is not necessarily robustly testable P Valiant International Workshop on Approximation Algorithms for Combinatorial …, 2005 | 45 | 2005 |
| The approximation complexity of win-lose games X Chen, SH Teng, P Valiant SODA 7, 159-168, 2007 | 41 | 2007 |
| Estimating the unseen: A sublinear-sample canonical estimator of distributions G Valiant, P Valiant Electronic Colloquium on Computational Complexity (ECCC) 17 (180), 9, 2010 | 40 | 2010 |
| Optimizing star-convex functions JCH Lee, P Valiant 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016 | 33 | 2016 |
| On the complexity of Nash equilibria of action-graph games C Daskalakis, G Schoenebeckt, G Valiant, P Valiant Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete …, 2009 | 32 | 2009 |
