☰

Li-Yang Tan, Ph.D. - Publications

Affiliations: 
2014 Computer Science Columbia University, New York, NY 
Area:
Computer Science
Tree Info Similar researchers PubMed Report error

9 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2018 Chen X, Servedio RA, Tan L, Waingarten E, Xie J. Settling the Query Complexity of Non-adaptive Junta Testing Journal of the Acm. 65: 1-18. DOI: 10.1145/3213772  0.599
2017 Chen X, Servedio RA, Tan L, Waingarten E, Xie J. Settling the Query Complexity of Non-Adaptive Junta Testing Electronic Colloquium On Computational Complexity. 24: 19. DOI: 10.4230/Lipics.Ccc.2017.26  0.597
2017 Håstad J, Rossman B, Servedio RA, Tan L. An Average-Case Depth Hierarchy Theorem for Boolean Circuits Journal of the Acm. 64: 35. DOI: 10.1145/3095799  0.61
2015 Diakonikolas I, Jaiswal R, Servedio RA, Tan L, Wan A. Noise Stable Halfspaces are Close to Very Small Juntas Chicago Journal of Theoretical Computer Science. 2015: 1-13. DOI: 10.4086/Cjtcs.2015.004  0.584
2015 Rossman B, Servedio RA, Tan L. Complexity Theory Column 89: The Polynomial Hierarchy, Random Oracles, and Boolean Circuits Sigact News. 46: 50-68. DOI: 10.1145/2852040.2852052  0.596
2014 Diakonikolas I, Servedio RA, Tan L, Wan A. A Regularity Lemma and Low-Weight Approximators for Low-Degree Polynomial Threshold Functions Theory of Computing. 10: 27-53. DOI: 10.4086/Toc.2014.V010A002  0.579
2014 Diakonikolas I, Raghavendra P, Servedio RA, Tan LY. Average sensitivity and noise sensitivity of polynomial threshold functions Siam Journal On Computing. 43: 231-253. DOI: 10.1137/110855223  0.611
2013 Blais E, Tan L. Hypercontractivity Via the Entropy Method. Theory of Computing. 9: 889-896. DOI: 10.4086/Toc.2013.V009A029  0.322
2013 Blais E, Tan LY. Approximating boolean functions with depth-2 circuits Proceedings of the Annual Ieee Conference On Computational Complexity. 74-85. DOI: 10.1137/14097402X  0.336
Show low-probability matches.