| 2013 | ||
|---|---|---|
| i8 | Karthekeyan Chandrasekaran, Justin Thaler, Jonathan Ullman, Andrew Wan: Faster Private Release of Marginals on Small Databases. CoRR abs/1304.3754 (2013) | |
| 2012 | ||
| c14 | Andrej Bogdanov, Periklis A. Papakonstantinou, Andrew Wan: Pseudorandomness for Linear Length Branching Programs and Stack Machines. APPROX-RANDOM 2012: 447-458 | |
| i7 | Ilias Diakonikolas, Ragesh Jaiswal, Rocco A. Servedio, Li-Yang Tan, Andrew Wan: On the Distribution of the Fourier Spectrum of Halfspaces. CoRR abs/1202.6680 (2012) | |
| 2011 | ||
| j7 | Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Rocco A. Servedio, Andrew Wan: Efficiently Testing Sparse GF(2) Polynomials. Algorithmica 61(3): 580-605 (2011) | |
| j6 | Jeffrey C. Jackson, Homin K. Lee, Rocco A. Servedio, Andrew Wan: Learning random monotone DNF. Discrete Applied Mathematics 159(5): 259-271 (2011) | |
| c13 | Andrej Bogdanov, Periklis A. Papakonstantinou, Andrew Wan: Pseudorandomness for Read-Once Formulas. FOCS 2011: 240-246 | |
| i6 | Andrej Bogdanov, Periklis A. Papakonstantinou, Andrew Wan: Pseudorandomness for read-once formulas. Electronic Colloquium on Computational Complexity (ECCC) 18: 117 (2011) | |
| 2010 | ||
| c12 | Ilias Diakonikolas, Rocco A. Servedio, Li-Yang Tan, Andrew Wan: A Regularity Lemma, and Low-Weight Approximators, for Low-Degree Polynomial Threshold Functions. IEEE Conference on Computational Complexity 2010: 211-222 | |
| c11 | Adam R. Klivans, Homin K. Lee, Andrew Wan: Mansour's Conjecture is True for Random DNF Formulas. COLT 2010: 368-380 | |
| c10 | Jur van den Berg, Stephen Miller, Daniel Duckworth, Humphrey Hu, Andrew Wan, Xiao-Yu Fu, Kenneth Y. Goldberg, Pieter Abbeel: Superhuman performance of surgical tasks by robots using iterative learning from human-guided demonstrations. ICRA 2010: 2074-2081 | |
| c9 | Andrej Bogdanov, Kunal Talwar, Andrew Wan: Hard Instances for Satisfiability and Quasi-one-way Functions. ICS 2010: 290-300 | |
| i5 | Adam R. Klivans, Homin K. Lee, Andrew Wan: Mansour's Conjecture is True for Random DNF Formulas. Electronic Colloquium on Computational Complexity (ECCC) 17: 23 (2010) | |
| 2009 | ||
| j5 | Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, Hoeteck Wee: Optimal Cryptographic Hardness of Learning Monotone Functions. Theory of Computing 5(1): 257-282 (2009) | |
| i4 | Ilias Diakonikolas, Rocco A. Servedio, Li-Yang Tan, Andrew Wan: A regularity lemma, and low-weight approximators, for low-degree polynomial threshold functions. CoRR abs/0909.4727 (2009) | |
| 2008 | ||
| c8 | Jeffrey C. Jackson, Homin K. Lee, Rocco A. Servedio, Andrew Wan: Learning Random Monotone DNF. APPROX-RANDOM 2008: 483-497 | |
| c7 | Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, Hoeteck Wee: Optimal Cryptographic Hardness of Learning Monotone Functions. ICALP (1) 2008: 36-47 | |
| c6 | Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Rocco A. Servedio, Andrew Wan: Efficiently Testing Sparse GF(2) Polynomials. ICALP (1) 2008: 502-514 | |
| i3 | Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Rocco A. Servedio, Andrew Wan: Efficiently Testing Sparse GF(2) Polynomials. CoRR abs/0805.1765 (2008) | |
| 2007 | ||
| j4 | Ariel Elbaz, Homin K. Lee, Rocco A. Servedio, Andrew Wan: Separating Models of Learning from Correlated and Uncorrelated Data. Journal of Machine Learning Research 8: 277-290 (2007) | |
| j3 | Homin K. Lee, Rocco A. Servedio, Andrew Wan: DNF are teachable in the average case. Machine Learning 69(2-3): 79-96 (2007) | |
| c5 | Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Krzysztof Onak, Ronitt Rubinfeld, Rocco A. Servedio, Andrew Wan: Testing for Concise Representations. FOCS 2007: 549-558 | |
| i2 | Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Krzysztof Onak, Ronitt Rubinfeld, Rocco A. Servedio, Andrew Wan: Testing for Concise Representations. Electronic Colloquium on Computational Complexity (ECCC) 14(077) (2007) | |
| i1 | Jeffrey C. Jackson, Homin K. Lee, Rocco A. Servedio, Andrew Wan: Learning Random Monotone DNF. Electronic Colloquium on Computational Complexity (ECCC) 14(129) (2007) | |
| 2006 | ||
| j2 | Yixin Chen, Andrew Wan, Wei Liu: A fast parallel algorithm for finding the longest common sequence of multiple biosequences. BMC Bioinformatics 7(S-4) (2006) | |
| c4 | Homin K. Lee, Rocco A. Servedio, Andrew Wan: DNF Are Teachable in the Average Case. COLT 2006: 214-228 | |
| c3 | Andrew Wan, Abdel Rigumye, Phillip Jones: Profile Based Routing and Billing Multimedia Content Delivery Network. ICN/ICONS/MCL 2006: 172 | |
| c2 | Benjamin W. Wah, Yixin Chen, Andrew Wan: Constrained Global Optimization by Constraint Partitioning and Simulated Annealing. ICTAI 2006: 265-274 | |
| 2005 | ||
| j1 | Rocco A. Servedio, Andrew Wan: Computing sparse permanents faster. Inf. Process. Lett. 96(3): 89-92 (2005) | |
| c1 | Ariel Elbaz, Homin K. Lee, Rocco A. Servedio, Andrew Wan: Separating Models of Learning from Correlated and Uncorrelated Data. COLT 2005: 637-651 | |
Colors in the list of coauthors
Last update Tue May 21 13:24:28 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page