Andrew Wan

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Pseudorandomness and Fourier-growth bounds for width-3 branching programs Theory of Computing	2017-11-14	Paper
Approximate resilience, monotonicity, and the complexity of agnostic learning Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms	2017-10-05	Paper
Faster private release of marginals on small databases Proceedings of the 5th conference on Innovations in theoretical computer science	2017-05-19	Paper
Pseudorandomness and Fourier growth bounds for width-3 branching programs	2017-03-22	Paper
scientific article; zbMATH DE number 6537946 (Why is no real title available?) Chicago Journal of Theoretical Computer Science	2016-02-01	Paper
A regularity lemma and low-weight approximators for low-degree polynomial threshold functions Theory of Computing	2014-10-06	Paper
Pseudorandomness for Read-Once Formulas 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science	2014-07-30	Paper
Pseudorandomness for Linear Length Branching Programs and Stack Machines Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques	2012-11-02	Paper
On the Distribution of the Fourier Spectrum of Halfspaces	2012-02-29	Paper
Efficiently testing sparse \(\text{GF}(2)\) polynomials Algorithmica	2011-11-07	Paper
scientific article; zbMATH DE number 5957428 (Why is no real title available?)	2011-10-12	Paper
Optimal cryptographic hardness of learning monotone functions Theory of Computing	2011-05-24	Paper
Learning random monotone DNF Discrete Applied Mathematics	2011-03-10	Paper
Computing sparse permanents faster Information Processing Letters	2009-12-18	Paper
DNF are teachable in the average case Machine Learning	2009-03-31	Paper
Learning Random Monotone DNF Lecture Notes in Computer Science	2008-11-27	Paper
Efficiently Testing Sparse GF(2) Polynomials Automata, Languages and Programming	2008-08-28	Paper
Optimal Cryptographic Hardness of Learning Monotone Functions Automata, Languages and Programming	2008-08-28	Paper
DNF Are Teachable in the Average Case Learning Theory	2007-09-14	Paper
Learning Theory Lecture Notes in Computer Science	2006-06-22	Paper

Research outcomes over time

This page was built for person: Andrew Wan