Andrew Wan

According to our database1, Andrew Wan authored at least 28 papers between 2005 and 2015.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2015
An inequality for the Fourier spectrum of parity decision trees.
CoRR, 2015

Noise Stable Halfspaces are Close to Very Small Juntas.
Chic. J. Theor. Comput. Sci., 2015

Approximate resilience, monotonicity, and the complexity of agnostic learning.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Mining Measured Information from Text.
Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2015

2014
Decision trees, protocols and the entropy-influence conjecture.
Proceedings of the Innovations in Theoretical Computer Science, 2014

Faster private release of marginals on small databases.
Proceedings of the Innovations in Theoretical Computer Science, 2014

Satisfiability and Evolution.
Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

Pseudorandomness and Fourier Growth Bounds for Width-3 Branching Programs.
Proceedings of the Approximation, 2014

2013
Decision Trees, Protocols, and the Fourier Entropy-Influence Conjecture.
CoRR, 2013

Satisfiability and Evolution.
CoRR, 2013

2012
On the Distribution of the Fourier Spectrum of Halfspaces
CoRR, 2012

Pseudorandomness for Linear Length Branching Programs and Stack Machines.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2011
Efficiently Testing Sparse <i>GF</i>(2) Polynomials.
Algorithmica, 2011

Pseudorandomness for Read-Once Formulas.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010
Hard Instances for Satisfiability and Quasi-one-way Functions.
Proceedings of the Innovations in Computer Science, 2010

Superhuman performance of surgical tasks by robots using iterative learning from human-guided demonstrations.
Proceedings of the IEEE International Conference on Robotics and Automation, 2010

Mansour's Conjecture is True for Random DNF Formulas.
Proceedings of the COLT 2010, 2010

A Regularity Lemma, and Low-Weight Approximators, for Low-Degree Polynomial Threshold Functions.
Proceedings of the 25th Annual IEEE Conference on Computational Complexity, 2010

2008
Efficiently Testing Sparse GF(2) Polynomials.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Optimal Cryptographic Hardness of Learning Monotone Functions.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Learning Random Monotone DNF.
Proceedings of the Approximation, 2008

2007
Testing for Concise Representations.
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, 2007

2006
A fast parallel algorithm for finding the longest common sequence of multiple biosequences.
BMC Bioinform., 2006

Constrained Global Optimization by Constraint Partitioning and Simulated Annealing.
Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2006), 2006

Profile Based Routing and Billing Multimedia Content Delivery Network.
Proceedings of the Fifth International Conference on Networking and the International Conference on Systems (ICN / ICONS / MCL 2006), 2006

DNF Are Teachable in the Average Case.
Proceedings of the Learning Theory, 19th Annual Conference on Learning Theory, 2006

2005
Computing sparse permanents faster.
Inf. Process. Lett., 2005

Separating Models of Learning from Correlated and Uncorrelated Data.
Proceedings of the Learning Theory, 18th Annual Conference on Learning Theory, 2005


  Loading...