Li-Yang Tan
Title
Cited by
Cited by
Year
New algorithms and lower bounds for monotonicity testing
X Chen, RA Servedio, LY Tan
FOCS 2014, 2014
642014
Boolean function monotonicity testing requires (almost) n^{1/2} non-adaptive queries
X Chen, A De, RA Servedio, LY Tan
STOC 2015, 2015
512015
Learning sums of independent integer random variables
C Daskalakis, I Diakonikolas, R ODonnell, RA Servedio, LY Tan
FOCS 2013, 2013
462013
An average-case depth hierarchy theorem for boolean circuits
B Rossman, RA Servedio, LY Tan
FOCS 2015, 2015
432015
Bounding the average sensitivity and noise sensitivity of polynomial threshold functions
I Diakonikolas, P Harsha, A Klivans, R Meka, P Raghavendra, ...
STOC 2010, 2010
412010
A regularity lemma, and low-weight approximators, for low-degree polynomial threshold functions
I Diakonikolas, RA Servedio, LY Tan, A Wan
CCC 2010, 2010
392010
Average sensitivity and noise sensitivity of polynomial threshold functions
I Diakonikolas, P Raghavendra, RA Servedio, LY Tan
SIAM Journal on Computing, 2014
32*2014
Learning circuits with few negations
E Blais, CL Canonne, IC Oliveira, RA Servedio, LY Tan
RANDOM 2015, 2014
302014
Non-malleable codes for small-depth circuits
M Ball, D Dachman-Soled, S Guo, T Malkin, LY Tan
FOCS 2018, 2018
242018
Attribute-efficient learning andweight-degree tradeoffs for polynomial threshold functions
R Servedio, LY Tan, J Thaler
COLT 2012, 2012
242012
The algebra of equality proofs
A Stump, LY Tan
International Conference on Rewriting Techniques and Applications, 469-483, 2005
242005
Analysis of Boolean Functions
LY Tan
arXiv preprint arXiv:1205.0314, 2012
232012
Settling the query complexity of non-adaptive junta testing
X Chen, RA Servedio, LY Tan, E Waingarten, J Xie
Journal of the ACM, 2018
222018
Convergence, unanimity and disagreement in majority dynamics on unimodular graphs and random graphs
I Benjamini, SO Chan, R O’Donnell, O Tamuz, LY Tan
Stochastic Processes and their Applications, 2016
222016
Adaptivity Helps for Testing Juntas
RA Servedio, LY Tan, J Wright
CCC 2015, 2015
192015
Poly-logarithmic frege depth lower bounds via an expander switching lemma
T Pitassi, B Rossman, RA Servedio, LY Tan
STOC 2016, 2016
182016
Hypercontractive inequalities via SOS, and the Frankl–Rödl graph
M Kauers, R O'Donnell, LY Tan, Y Zhou
SODA 2014, 2014
17*2014
Near-optimal small-depth lower bounds for small distance connectivity
X Chen, IC Oliveira, RA Servedio, LY Tan
STOC 2016, 2016
162016
Approximate resilience, monotonicity, and the complexity of agnostic learning
D Dachman-Soled, V Feldman, LY Tan, A Wan, K Wimmer
SODA 2015, 2014
152014
Approximating Boolean functions with depth-2 circuits
E Blais, LY Tan
SIAM Journal on Computing, 2015
142015
The system can't perform the operation now. Try again later.
Articles 1–20