| Testing for concise representations I Diakonikolas, HK Lee, K Matulef, K Onak, R Rubinfeld, RA Servedio, ... 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 549-558, 2007 | 102 | 2007 |
| Testing for concise representations I Diakonikolas, HK Lee, K Matulef, K Onak, R Rubinfeld, RA Servedio, ... 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 549-558, 2007 | 102 | 2007 |
| A regularity lemma, and low-weight approximators, for low-degree polynomial threshold functions I Diakonikolas, RA Servedio, LY Tan, A Wan 2010 IEEE 25th Annual Conference on Computational Complexity, 211-222, 2010 | 42 | 2010 |
| A regularity lemma, and low-weight approximators, for low-degree polynomial threshold functions I Diakonikolas, RA Servedio, LY Tan, A Wan 2010 IEEE 25th Annual Conference on Computational Complexity, 211-222, 2010 | 42 | 2010 |
| A regularity lemma, and low-weight approximators, for low-degree polynomial threshold functions I Diakonikolas, RA Servedio, LY Tan, A Wan 2010 IEEE 25th Annual Conference on Computational Complexity, 211-222, 2010 | 42 | 2010 |
| Faster private release of marginals on small databases K Chandrasekaran, J Thaler, J Ullman, A Wan Proceedings of the 5th conference on Innovations in theoretical computer …, 2014 | 36 | 2014 |
| Pseudorandomness for read-once formulas A Bogdanov, PA Papakonstaninou, A Wan 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 240-246, 2011 | 30 | 2011 |
| Mansour's Conjecture is True for Random DNF Formulas. AR Klivans, HK Lee, A Wan COLT, 368-380, 2010 | 27 | 2010 |
| Pseudorandomness and fourier growth bounds for width 3 branching programs T Steinke, S Vadhan, A Wan arXiv preprint arXiv:1405.7028, 2014 | 19 | 2014 |
| Computing sparse permanents faster RA Servedio, A Wan Information processing letters 96 (3), 89-92, 2005 | 19 | 2005 |
| Satisfiability and evolution A Livnat, C Papadimitriou, A Rubinstein, G Valiant, A Wan 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 524-530, 2014 | 18 | 2014 |
| Approximate resilience, monotonicity, and the complexity of agnostic learning D Dachman-Soled, V Feldman, LY Tan, A Wan, K Wimmer Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014 | 17 | 2014 |
| Efficiently testing sparse GF (2) polynomials I Diakonikolas, HK Lee, K Matulef, RA Servedio, A Wan International Colloquium on Automata, Languages, and Programming, 502-514, 2008 | 16 | 2008 |
| Learning random monotone DNF JC Jackson, HK Lee, RA Servedio, A Wan Approximation, Randomization and Combinatorial Optimization. Algorithms and …, 2008 | 11 | 2008 |
| Real analysis in computer science: A collection of open problems Y Filmus, H Hatami, S Heilman, E Mossel, R O’Donnell, S Sachdeva, ... Preprint available at https://simons. berkeley. edu/sites/default/files …, 2014 | 10 | 2014 |
| Optimal cryptographic hardness of learning monotone functions D Dachman-Soled, HK Lee, T Malkin, RA Servedio, A Wan, H Wee International Colloquium on Automata, Languages, and Programming, 36-47, 2008 | 10 | 2008 |
| Learning, cryptography, and the average case A Wan Columbia University, 2010 | 9 | 2010 |
| Hard Instances for Satisfiability and Quasi-one-way Functions. A Bogdanov, K Talwar, A Wan ICS, 290-300, 2010 | 9 | 2010 |
| Decision trees, protocols and the entropy-influence conjecture A Wan, J Wright, C Wu Proceedings of the 5th conference on Innovations in theoretical computer …, 2014 | 8 | 2014 |
| Decision Trees, Protocols, and the Fourier Entropy-Influence Conjecture A Wan, J Wright, C Wu arXiv preprint arXiv:1312.3003, 2013 | 8* | 2013 |
