Li-Yang Tan, Ph.D.
Affiliations: | 2014 | Computer Science | Columbia University, New York, NY |
Area:
Computer ScienceGoogle:
"Li-Yang Tan"Parents
Sign in to add mentor| Rocco A. Servedio | grad student | 2014 | Columbia | |
| (Analytic Methods in Concrete Complexity.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Chen X, Servedio RA, Tan L, et al. (2018) Settling the Query Complexity of Non-adaptive Junta Testing Journal of the Acm. 65: 1-18 |
| Chen X, Servedio RA, Tan L, et al. (2017) Settling the Query Complexity of Non-Adaptive Junta Testing Electronic Colloquium On Computational Complexity. 24: 19 |
| Håstad J, Rossman B, Servedio RA, et al. (2017) An Average-Case Depth Hierarchy Theorem for Boolean Circuits Journal of the Acm. 64: 35 |
| Diakonikolas I, Jaiswal R, Servedio RA, et al. (2015) Noise Stable Halfspaces are Close to Very Small Juntas Chicago Journal of Theoretical Computer Science. 2015: 1-13 |
| Rossman B, Servedio RA, Tan L. (2015) Complexity Theory Column 89: The Polynomial Hierarchy, Random Oracles, and Boolean Circuits Sigact News. 46: 50-68 |
| Diakonikolas I, Servedio RA, Tan L, et al. (2014) A Regularity Lemma and Low-Weight Approximators for Low-Degree Polynomial Threshold Functions Theory of Computing. 10: 27-53 |
| Diakonikolas I, Raghavendra P, Servedio RA, et al. (2014) Average sensitivity and noise sensitivity of polynomial threshold functions Siam Journal On Computing. 43: 231-253 |
| Blais E, Tan L. (2013) Hypercontractivity Via the Entropy Method. Theory of Computing. 9: 889-896 |
| Blais E, Tan LY. (2013) Approximating boolean functions with depth-2 circuits Proceedings of the Annual Ieee Conference On Computational Complexity. 74-85 |