![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Andrew Wan
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j10]Thomas Steinke, Salil P. Vadhan, Andrew Wan:
Pseudorandomness and Fourier-Growth Bounds for Width-3 Branching Programs. Theory Comput. 13(1): 1-50 (2017) - 2015
- [j9]Ilias Diakonikolas, Ragesh Jaiswal, Rocco A. Servedio, Li-Yang Tan, Andrew Wan:
Noise Stable Halfspaces are Close to Very Small Juntas. Chic. J. Theor. Comput. Sci. 2015 (2015) - [c20]Arun S. Maiya, Dale Visser, Andrew Wan:
Mining Measured Information from Text. SIGIR 2015: 899-902 - [c19]Dana Dachman-Soled, Vitaly Feldman, Li-Yang Tan, Andrew Wan, Karl Wimmer:
Approximate resilience, monotonicity, and the complexity of agnostic learning. SODA 2015: 498-511 - [i14]Arun S. Maiya, Dale Visser, Andrew Wan:
Mining Measured Information from Text. CoRR abs/1505.01072 (2015) - [i13]Eric Blais, Li-Yang Tan, Andrew Wan:
An inequality for the Fourier spectrum of parity decision trees. CoRR abs/1506.01055 (2015) - 2014
- [j8]Ilias Diakonikolas, Rocco A. Servedio
, Li-Yang Tan, Andrew Wan:
A Regularity Lemma and Low-Weight Approximators for Low-Degree Polynomial Threshold Functions. Theory Comput. 10: 27-53 (2014) - [c18]Thomas Steinke, Salil P. Vadhan, Andrew Wan:
Pseudorandomness and Fourier Growth Bounds for Width-3 Branching Programs. APPROX-RANDOM 2014: 885-899 - [c17]Adi Livnat, Christos H. Papadimitriou, Aviad Rubinstein, Gregory Valiant, Andrew Wan:
Satisfiability and Evolution. FOCS 2014: 524-530 - [c16]Andrew Wan, John Wright, Chenggang Wu:
Decision trees, protocols and the entropy-influence conjecture. ITCS 2014: 67-80 - [c15]Karthekeyan Chandrasekaran, Justin Thaler, Jonathan R. Ullman, Andrew Wan:
Faster private release of marginals on small databases. ITCS 2014: 387-402 - [i12]Dana Dachman-Soled, Vitaly Feldman, Li-Yang Tan, Andrew Wan, Karl Wimmer:
Approximate resilience, monotonicity, and the complexity of agnostic learning. CoRR abs/1405.5268 (2014) - [i11]Thomas Steinke, Salil P. Vadhan, Andrew Wan:
Pseudorandomness and Fourier Growth Bounds for Width 3 Branching Programs. CoRR abs/1405.7028 (2014) - 2013
- [i10]Karthekeyan Chandrasekaran, Justin Thaler, Jonathan R. Ullman, Andrew Wan:
Faster Private Release of Marginals on Small Databases. CoRR abs/1304.3754 (2013) - [i9]Adi Livnat, Christos H. Papadimitriou, Aviad Rubinstein, Andrew Wan:
Satisfiability and Evolution. CoRR abs/1312.1983 (2013) - [i8]Andrew Wan, John Wright, Chenggang Wu:
Decision Trees, Protocols, and the Fourier Entropy-Influence Conjecture. CoRR abs/1312.3003 (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. Discret. Appl. Math. 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. Electron. Colloquium Comput. Complex. TR11 (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. CCC 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. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 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 Comput. 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. J. Mach. Learn. Res. 8: 277-290 (2007) - [j3]Homin K. Lee, Rocco A. Servedio, Andrew Wan:
DNF are teachable in the average case. Mach. Learn. 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. Electron. Colloquium Comput. Complex. TR07 (2007) - [i1]Jeffrey C. Jackson, Homin K. Lee, Rocco A. Servedio, Andrew Wan:
Learning Random Monotone DNF. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j2]Yixin Chen, Andrew Wan, Wei Liu:
A fast parallel algorithm for finding the longest common sequence of multiple biosequences. BMC Bioinform. 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
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint