Andrew Wan

Available identifiers

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q4591372	2017-11-14	Paper
Approximate resilience, monotonicity, and the complexity of agnostic learning	2017-10-05	Paper
Faster private release of marginals on small databases	2017-05-19	Paper
https://portal.mardi4nfdi.de/entity/Q2969669	2017-03-22	Paper
https://portal.mardi4nfdi.de/entity/Q3466401	2016-02-01	Paper
https://portal.mardi4nfdi.de/entity/Q3191611	2014-10-06	Paper
Pseudorandomness for Read-Once Formulas	2014-07-30	Paper
Pseudorandomness for Linear Length Branching Programs and Stack Machines	2012-11-02	Paper
On the Distribution of the Fourier Spectrum of Halfspaces	2012-02-29	Paper
Efficiently testing sparse \(\text{GF}(2)\) polynomials	2011-11-07	Paper
https://portal.mardi4nfdi.de/entity/Q3174077	2011-10-12	Paper
https://portal.mardi4nfdi.de/entity/Q3002813	2011-05-24	Paper
Learning random monotone DNF	2011-03-10	Paper
Computing sparse permanents faster	2009-12-18	Paper
DNF are teachable in the average case	2009-03-31	Paper
Learning Random Monotone DNF	2008-11-27	Paper
Efficiently Testing Sparse GF(2) Polynomials	2008-08-28	Paper
Optimal Cryptographic Hardness of Learning Monotone Functions	2008-08-28	Paper
DNF Are Teachable in the Average Case	2007-09-14	Paper
Learning Theory	2006-06-22	Paper

This page was built for person: Andrew Wan