Li-Yang Tan - RankMe

159 papers A* 45A 13B 2Journal 87Unranked 11

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	Samplability Makes Learning Easier. ITCS Guy Blanc, Caleb Koch, Jane Lange, Carmen Strassle, Li-Yang Tan
2025	A*	`conf`	A Distributional-Lifting Theorem for PAC Learning. COLT Guy Blanc, Jane Lange, Carmen Strassle, Li-Yang Tan
2025	J	`jnl`	A Distributional-Lifting Theorem for PAC Learning. CoRR Guy Blanc, Jane Lange, Carmen Strassle, Li-Yang Tan
2025	A*	`conf`	Computational-Statistical Tradeoffs from NP-hardness. FOCS Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan
2025	J	`jnl`	Computational-Statistical Tradeoffs from NP-hardness. CoRR Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan
2025	J	`jnl`	Samplability makes learning easier. CoRR Guy Blanc, Caleb Koch, Jane Lange, Carmen Strassle, Li-Yang Tan
2025	J	`jnl`	The power of quantum circuits in sampling. CoRR Guy Blanc, Caleb Koch, Jane Lange, Carmen Strassle, Li-Yang Tan
2024	A	`conf`	A Strong Direct Sum Theorem for Distributional Query Complexity. CCC Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan
2024	J	`jnl`	A Strong Direct Sum Theorem for Distributional Query Complexity. CoRR Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan
2024	A*	`conf`	Fast Decision Tree Learning Solves Hard Coding-Theoretic Problems. FOCS Caleb Koch, Carmen Strassle, Li-Yang Tan
2024	J	`jnl`	Fast decision tree learning solves hard coding-theoretic problems. CoRR Caleb Koch, Carmen Strassle, Li-Yang Tan
2024	A*	`conf`	Superconstant Inapproximability of Decision Tree Learning. COLT Caleb Koch, Carmen Strassle, Li-Yang Tan
2024	J	`jnl`	Superconstant Inapproximability of Decision Tree Learning. CoRR Caleb Koch, Carmen Strassle, Li-Yang Tan
2024	A*	`conf`	The Sample Complexity of Smooth Boosting and the Tightness of the Hardcore Theorem. FOCS Guy Blanc, Alexandre Hayderi, Caleb Koch, Li-Yang Tan
2024	J	`jnl`	The Sample Complexity of Smooth Boosting and the Tightness of the Hardcore Theorem. CoRR Guy Blanc, Alexandre Hayderi, Caleb Koch, Li-Yang Tan
2023	J	`jnl`	A Strong Composition Theorem for Junta Complexity and the Boosting of Property Testers. CoRR Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan
2023	A*	`conf`	A strong composition theorem for junta complexity and the boosting of property testers. FOCS Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan
2023	A	`conf`	Certification with an NP Oracle. ITCS Guy Blanc, Caleb Koch, Jane Lange, Carmen Strassle, Li-Yang Tan
2023	J	`jnl`	Harnessing the Power of Choices in Decision Tree Learning. CoRR Guy Blanc, Jane Lange, Chirag Pabbaraju, Colin Sullivan, Li-Yang Tan, Mo Tiwari
2023	A*	`conf`	Harnessing the power of choices in decision tree learning. NeurIPS Guy Blanc, Jane Lange, Chirag Pabbaraju, Colin Sullivan, Li-Yang Tan, Mo Tiwari
2023	A*	`conf`	Lifting Uniform Learners via Distributional Decomposition. STOC Guy Blanc, Jane Lange, Ali Malik, Li-Yang Tan
2023	J	`jnl`	Lifting uniform learners via distributional decomposition. CoRR Guy Blanc, Jane Lange, Ali Malik, Li-Yang Tan
2023	A*	`conf`	Multitask Learning via Shared Features: Algorithms and Hardness. COLT Konstantina Bairaktari, Guy Blanc, Li-Yang Tan, Jonathan R. Ullman, Lydia Zakynthinou
2023	J	`jnl`	Properly Learning Decision Trees with Queries Is NP-Hard. CoRR Caleb Koch, Carmen Strassle, Li-Yang Tan
2023	A*	`conf`	Properly learning decision trees with queries is NP-hard. FOCS Caleb Koch, Carmen Strassle, Li-Yang Tan
2023	A*	`conf`	Single-Pass Streaming Algorithms for Correlation Clustering. SODA Soheil Behnezhad, Moses Charikar, Weiyun Ma, Li-Yang Tan
2023	A*	`conf`	Superpolynomial lower bounds for decision tree learning and testing. SODA Caleb Koch, Carmen Strassle, Li-Yang Tan
2022	A	`conf`	A Generalization of the Satisfiability Coding Lemma and Its Applications. SAT Milan Mossé, Harry Sha, Li-Yang Tan
2022	J	`jnl`	A Query-Optimal Algorithm for Finding Counterfactuals. CoRR Guy Blanc, Caleb Koch, Jane Lange, Li-Yang Tan
2022	A*	`conf`	A query-optimal algorithm for finding counterfactuals. ICML Guy Blanc, Caleb Koch, Jane Lange, Li-Yang Tan
2022	A*	`conf`	Almost 3-Approximate Correlation Clustering in Constant Rounds. FOCS Soheil Behnezhad, Moses Charikar, Weiyun Ma, Li-Yang Tan
2022	J	`jnl`	Almost 3-Approximate Correlation Clustering in Constant Rounds. CoRR Soheil Behnezhad, Moses Charikar, Weiyun Ma, Li-Yang Tan
2022	J	`jnl`	Certification with an NP Oracle. CoRR Guy Blanc, Caleb Koch, Jane Lange, Carmen Strassle, Li-Yang Tan
2022	J	`jnl`	Fooling Polytopes. J. ACM Ryan O'Donnell, Rocco A. Servedio, Li-Yang Tan
2022	J	`jnl`	Improved Pseudorandom Generators from Pseudorandom Multi-switching Lemmas. Theory Comput. Rocco A. Servedio, Li-Yang Tan
2022	J	`jnl`	Multitask Learning via Shared Features: Algorithms and Hardness. CoRR Konstantina Bairaktari, Guy Blanc, Li-Yang Tan, Jonathan R. Ullman, Lydia Zakynthinou
2022	A*	`conf`	On the power of adaptivity in statistical adversaries. COLT Guy Blanc, Jane Lange, Ali Malik, Li-Yang Tan
2022	J	`jnl`	Open Problem: Properly learning decision trees in polynomial time? CoRR Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan
2022	A*	`conf`	Popular decision tree algorithms are provably noise tolerant. ICML Guy Blanc, Jane Lange, Ali Malik, Li-Yang Tan
2022	J	`jnl`	Popular decision tree algorithms are provably noise tolerant. CoRR Guy Blanc, Jane Lange, Ali Malik, Li-Yang Tan
2022	J	`jnl`	Properly Learning Decision Trees in almost Polynomial Time. J. ACM Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan
2022	A*	`conf`	Reconstructing Decision Trees. ICALP Guy Blanc, Jane Lange, Li-Yang Tan
2022	J	`jnl`	Superpolynomial Lower Bounds for Decision Tree Learning and Testing. CoRR Caleb Koch, Carmen Strassle, Li-Yang Tan
2022	A	`conf`	The Composition Complexity of Majority. CCC Victor Lecomte, Prasanna Ramakrishnan, Li-Yang Tan
2022	J	`jnl`	The Query Complexity of Certification. CoRR Guy Blanc, Caleb Koch, Jane Lange, Li-Yang Tan
2022	J	`jnl`	The composition complexity of majority. CoRR Victor Lecomte, Prasanna Ramakrishnan, Li-Yang Tan
2022	A*	`conf`	The query complexity of certification. STOC Guy Blanc, Caleb Koch, Jane Lange, Li-Yang Tan
2021	A*	`conf`	Brief Announcement: A Randomness-efficient Massively Parallel Algorithm for Connectivity. PODC Moses Charikar, Weiyun Ma, Li-Yang Tan
2021	—	`conf`	Decision Tree Heuristics Can Fail, Even in the Smoothed Setting. APPROX-RANDOM Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan
2021	J	`jnl`	Decision tree heuristics can fail, even in the smoothed setting. CoRR Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan
2021	—	`conf`	Deterministic Approximate Counting of Polynomial Threshold Functions via a Derandomized Regularity Lemma. APPROX-RANDOM Rocco A. Servedio, Li-Yang Tan
2021	J	`jnl`	Fooling Gaussian PTFs via Local Hyperconcentration. CoRR Ryan O'Donnell, Rocco A. Servedio, Li-Yang Tan, Daniel Kane
2021	A*	`conf`	Learning Stochastic Decision Trees. ICALP Guy Blanc, Jane Lange, Li-Yang Tan
2021	J	`jnl`	Learning stochastic decision trees. CoRR Guy Blanc, Jane Lange, Li-Yang Tan
2021	A	`conf`	On the Power and Limitations of Branch and Cut. CCC Noah Fleming, Mika Göös, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, Avi Wigderson
2021	J	`jnl`	On the Power and Limitations of Branch and Cut. CoRR Noah Fleming, Mika Göös, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, Avi Wigderson
2021	J	`jnl`	On the Power and Limitations of Branch and Cut. Electron. Colloquium Comput. Complex. Noah Fleming, Mika Göös, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, Avi Wigderson
2021	J	`jnl`	On the power of adaptivity in statistical adversaries. CoRR Guy Blanc, Jane Lange, Ali Malik, Li-Yang Tan
2021	A*	`conf`	Properly learning decision trees in almost polynomial time. FOCS Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan
2021	J	`jnl`	Properly learning decision trees in almost polynomial time. CoRR Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan
2021	A*	`conf`	Provably efficient, succinct, and precise explanations. NeurIPS Guy Blanc, Jane Lange, Li-Yang Tan
2021	J	`jnl`	Provably efficient, succinct, and precise explanations. CoRR Guy Blanc, Jane Lange, Li-Yang Tan
2021	A*	`conf`	Query strategies for priced information, revisited. SODA Guy Blanc, Jane Lange, Li-Yang Tan
2021	A*	`conf`	Sharper bounds on the Fourier concentration of DNFs. FOCS Victor Lecomte, Li-Yang Tan
2021	J	`jnl`	Sharper bounds on the Fourier concentration of DNFs. CoRR Victor Lecomte, Li-Yang Tan
2021	A*	`conf`	Tradeoffs for small-depth Frege proofs. FOCS Toniann Pitassi, Prasanna Ramakrishnan, Li-Yang Tan
2021	J	`jnl`	Tradeoffs for small-depth Frege proofs. CoRR Toniann Pitassi, Prasanna Ramakrishnan, Li-Yang Tan
2020	A*	`conf`	Estimating decision tree learnability with polylogarithmic sample complexity. NeurIPS Guy Blanc, Neha Gupta, Jane Lange, Li-Yang Tan
2020	J	`jnl`	Estimating decision tree learnability with polylogarithmic sample complexity. CoRR Guy Blanc, Neha Gupta, Jane Lange, Li-Yang Tan
2020	A*	`conf`	Fooling Gaussian PTFs via local hyperconcentration. STOC Ryan O'Donnell, Rocco A. Servedio, Li-Yang Tan
2020	J	`jnl`	New lower bounds for Massively Parallel Computation from query complexity. CoRR Moses Charikar, Weiyun Ma, Li-Yang Tan
2020	J	`jnl`	Non-Malleability against Polynomial Tampering. Electron. Colloquium Comput. Complex. Marshall Ball, Eshan Chattopadhyay, Jyun-Jie Liao, Tal Malkin, Li-Yang Tan
2020	J	`jnl`	Non-Malleability against Polynomial Tampering. IACR Cryptol. ePrint Arch. Marshall Ball, Eshan Chattopadhyay, Jyun-Jie Liao, Tal Malkin, Li-Yang Tan
2020	—	`conf`	Non-malleability Against Polynomial Tampering. CRYPTO (3) Marshall Ball, Eshan Chattopadhyay, Jyun-Jie Liao, Tal Malkin, Li-Yang Tan
2020	A*	`conf`	Provable guarantees for decision tree induction: the agnostic setting. ICML Guy Blanc, Jane Lange, Li-Yang Tan
2020	J	`jnl`	Provable guarantees for decision tree induction: the agnostic setting. CoRR Guy Blanc, Jane Lange, Li-Yang Tan
2020	J	`jnl`	Query strategies for priced information, revisited. CoRR Guy Blanc, Jane Lange, Li-Yang Tan
2020	J	`jnl`	Testing and reconstruction via decision trees. CoRR Guy Blanc, Jane Lange, Li-Yang Tan
2020	A*	`conf`	The Power of Many Samples in Query Complexity. ICALP Andrew Bassilakis, Andrew Drucker, Mika Göös, Lunjia Hu, Weiyun Ma, Li-Yang Tan
2020	J	`jnl`	The Power of Many Samples in Query Complexity. CoRR Andrew Bassilakis, Andrew Drucker, Mika Göös, Lunjia Hu, Weiyun Ma, Li-Yang Tan
2020	J	`jnl`	The Power of Many Samples in Query Complexity. Electron. Colloquium Comput. Complex. Andrew Bassilakis, Andrew Drucker, Mika Göös, Lunjia Hu, Weiyun Ma, Li-Yang Tan
2020	A	`conf`	Top-Down Induction of Decision Trees: Rigorous Guarantees and Inherent Limitations. ITCS Guy Blanc, Jane Lange, Li-Yang Tan
2020	B	`conf`	Unconditional Lower Bounds for Adaptive Massively Parallel Computation. SPAA Moses Charikar, Weiyun Ma, Li-Yang Tan
2020	A*	`conf`	Universal guarantees for decision tree induction via a higher-order splitting criterion. NeurIPS Guy Blanc, Neha Gupta, Jane Lange, Li-Yang Tan
2020	J	`jnl`	Universal guarantees for decision tree induction via a higher-order splitting criterion. CoRR Guy Blanc, Neha Gupta, Jane Lange, Li-Yang Tan
2019	J	`jnl`	Constructive derandomization of query algorithms. CoRR Guy Blanc, Jane Lange, Li-Yang Tan
2019	A*	`conf`	Fooling polytopes. STOC Ryan O'Donnell, Rocco A. Servedio, Li-Yang Tan
2019	—	`conf`	Improved Pseudorandom Generators from Pseudorandom Multi-Switching Lemmas. APPROX-RANDOM Rocco A. Servedio, Li-Yang Tan
2019	A*	`conf`	Pseudorandomness for read-k DNF formulas. SODA Rocco A. Servedio, Li-Yang Tan
2019	J	`jnl`	Top-down induction of decision trees: rigorous guarantees and inherent limitations. CoRR Guy Blanc, Jane Lange, Li-Yang Tan
2019	J	`jnl`	Top-down induction of decision trees: rigorous guarantees and inherent limitations. Electron. Colloquium Comput. Complex. Guy Blanc, Jane Lange, Li-Yang Tan
2018	J	`jnl`	Deterministic search for CNF satisfying assignments in almost polynomial time. CoRR Rocco A. Servedio, Li-Yang Tan
2018	J	`jnl`	Fooling Polytopes. CoRR Ryan O'Donnell, Rocco A. Servedio, Li-Yang Tan
2018	J	`jnl`	Fooling Polytopes. Electron. Colloquium Comput. Complex. Ryan O'Donnell, Rocco A. Servedio, Li-Yang Tan
2018	J	`jnl`	Improved pseudorandom generators from pseudorandom multi-switching lemmas. CoRR Rocco A. Servedio, Li-Yang Tan
2018	—	`conf`	Luby-Velickovic-Wigderson Revisited: Improved Correlation Bounds and Pseudorandom Generators for Depth-Two Circuits. APPROX-RANDOM Rocco A. Servedio, Li-Yang Tan
2018	J	`jnl`	Luby-Veličković-Wigderson revisited: Improved correlation bounds and pseudorandom generators for depth-two circuits. CoRR Rocco A. Servedio, Li-Yang Tan
2018	A*	`conf`	Non-Malleable Codes for Small-Depth Circuits. FOCS Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan
2018	J	`jnl`	Non-Malleable Codes for Small-Depth Circuits. CoRR Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan
2018	J	`jnl`	Non-Malleable Codes for Small-Depth Circuits. Electron. Colloquium Comput. Complex. Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan
2018	J	`jnl`	Non-Malleable Codes for Small-Depth Circuits. IACR Cryptol. ePrint Arch. Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan
2018	J	`jnl`	Settling the Query Complexity of Non-adaptive Junta Testing. J. ACM Xi Chen, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten, Jinyu Xie
2017	—	`conf`	Adaptivity Is Exponentially Powerful for Testing Monotonicity of Halfspaces. APPROX-RANDOM Xi Chen, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten
2017	J	`jnl`	Adaptivity is exponentially powerful for testing monotonicity of halfspaces. CoRR Xi Chen, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten
2017	J	`jnl`	An Average-Case Depth Hierarchy Theorem for Boolean Circuits. J. ACM Johan Håstad, Benjamin Rossman, Rocco A. Servedio, Li-Yang Tan
2017	A*	`conf`	Deterministic Search for CNF Satisfying Assignments in Almost Polynomial Time. FOCS Rocco A. Servedio, Li-Yang Tan
2017	A*	`conf`	Fooling Intersections of Low-Weight Halfspaces. FOCS Rocco A. Servedio, Li-Yang Tan
2017	J	`jnl`	Fooling intersections of low-weight halfspaces. CoRR Rocco A. Servedio, Li-Yang Tan
2017	A	`conf`	Settling the Query Complexity of Non-Adaptive Junta Testing. CCC Xi Chen, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten, Jinyu Xie
2017	J	`jnl`	Settling the query complexity of non-adaptive junta testing. CoRR Xi Chen, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten, Jinyu Xie
2017	J	`jnl`	Settling the query complexity of non-adaptive junta testing. Electron. Colloquium Comput. Complex. Xi Chen, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten, Jinyu Xie
2017	A	`conf`	What Circuit Classes Can Be Learned with Non-Trivial Savings?. ITCS Rocco A. Servedio, Li-Yang Tan
2016	A*	`conf`	Near-optimal small-depth lower bounds for small distance connectivity. STOC Xi Chen, Igor C. Oliveira, Rocco A. Servedio, Li-Yang Tan
2016	A*	`conf`	Poly-logarithmic Frege depth lower bounds via an expander switching lemma. STOC Toniann Pitassi, Benjamin Rossman, Rocco A. Servedio, Li-Yang Tan
2015	A	`conf`	Adaptivity Helps for Testing Juntas. CCC Rocco A. Servedio, Li-Yang Tan, John Wright
2015	B	`conf`	Algorithmic Signaling of Features in Auction Design. SAGT Shaddin Dughmi, Nicole Immorlica, Ryan O'Donnell, Li-Yang Tan
2015	A*	`conf`	An Average-Case Depth Hierarchy Theorem for Boolean Circuits. FOCS Benjamin Rossman, Rocco A. Servedio, Li-Yang Tan
2015	J	`jnl`	An average-case depth hierarchy theorem for Boolean circuits. CoRR Benjamin Rossman, Rocco A. Servedio, Li-Yang Tan
2015	J	`jnl`	An average-case depth hierarchy theorem for Boolean circuits. Electron. Colloquium Comput. Complex. Benjamin Rossman, Rocco A. Servedio, Li-Yang Tan
2015	J	`jnl`	An inequality for the Fourier spectrum of parity decision trees. CoRR Eric Blais, Li-Yang Tan, Andrew Wan
2015	A*	`conf`	Approximate resilience, monotonicity, and the complexity of agnostic learning. SODA Dana Dachman-Soled, Vitaly Feldman, Li-Yang Tan, Andrew Wan, Karl Wimmer
2015	J	`jnl`	Approximating Boolean Functions with Depth-2 Circuits. SIAM J. Comput. Eric Blais, Li-Yang Tan
2015	A*	`conf`	Boolean Function Monotonicity Testing Requires (Almost) n STOC Xi Chen, Anindya De, Rocco A. Servedio, Li-Yang Tan
2015	J	`jnl`	Complexity Theory Column 89: The Polynomial Hierarchy, Random Oracles, and Boolean Circuits. SIGACT News Benjamin Rossman, Rocco A. Servedio, Li-Yang Tan
2015	—	`conf`	Learning Circuits with few Negations. APPROX-RANDOM Eric Blais, Clément L. Canonne, Igor C. Oliveira, Rocco A. Servedio, Li-Yang Tan
2015	J	`jnl`	Near-optimal small-depth lower bounds for small distance connectivity. CoRR Xi Chen, Igor C. Oliveira, Rocco A. Servedio, Li-Yang Tan
2015	J	`jnl`	Noise Stable Halfspaces are Close to Very Small Juntas. Chic. J. Theor. Comput. Sci. Ilias Diakonikolas, Ragesh Jaiswal, Rocco A. Servedio, Li-Yang Tan, Andrew Wan
2014	A	`conf`	A Composition Theorem for Parity Kill Number. CCC Ryan O'Donnell, John Wright, Yu Zhao, Xiaorui Sun, Li-Yang Tan
2014	J	`jnl`	A Regularity Lemma and Low-Weight Approximators for Low-Degree Polynomial Threshold Functions. Theory Comput. Ilias Diakonikolas, Rocco A. Servedio, Li-Yang Tan, Andrew Wan
2014	—	`—`	Analytic Methods in Concrete Complexity. Li-Yang Tan
2014	J	`jnl`	Approximate resilience, monotonicity, and the complexity of agnostic learning. CoRR Dana Dachman-Soled, Vitaly Feldman, Li-Yang Tan, Andrew Wan, Karl Wimmer
2014	J	`jnl`	Average Sensitivity and Noise Sensitivity of Polynomial Threshold Functions. SIAM J. Comput. Ilias Diakonikolas, Prasad Raghavendra, Rocco A. Servedio, Li-Yang Tan
2014	J	`jnl`	Boolean function monotonicity testing requires (almost) n CoRR Xi Chen, Anindya De, Rocco A. Servedio, Li-Yang Tan
2014	A*	`conf`	Hypercontractive inequalities via SOS, and the Frankl-Rödl graph. SODA Manuel Kauers, Ryan O'Donnell, Li-Yang Tan, Yuan Zhou
2014	J	`jnl`	Learning circuits with few negations. CoRR Eric Blais, Clément L. Canonne, Igor C. Oliveira, Rocco A. Servedio, Li-Yang Tan
2014	J	`jnl`	Learning circuits with few negations. Electron. Colloquium Comput. Complex. Eric Blais, Clément L. Canonne, Igor Carboni Oliveira, Rocco A. Servedio, Li-Yang Tan
2014	A*	`conf`	New Algorithms and Lower Bounds for Monotonicity Testing. FOCS Xi Chen, Rocco A. Servedio, Li-Yang Tan
2014	J	`jnl`	New NP-Hardness Results for 3-Coloring and 2-to-1 Label Cover. ACM Trans. Comput. Theory Per Austrin, Ryan O'Donnell, Li-Yang Tan, John Wright
2014	J	`jnl`	New algorithms and lower bounds for monotonicity testing. CoRR Xi Chen, Rocco A. Servedio, Li-Yang Tan
2014	—	`conf`	On DNF Approximators for Monotone Boolean Functions. ICALP (1) Eric Blais, Johan Håstad, Rocco A. Servedio, Li-Yang Tan
2013	—	`conf`	A Composition Theorem for the Fourier Entropy-Influence Conjecture. ICALP (1) Ryan O'Donnell, Li-Yang Tan
2013	J	`jnl`	A composition theorem for parity kill number. CoRR Ryan O'Donnell, Xiaorui Sun, Li-Yang Tan, John Wright, Yu Zhao
2013	J	`jnl`	A composition theorem for the Fourier Entropy-Influence conjecture CoRR Ryan O'Donnell, Li-Yang Tan
2013	A	`conf`	Approximating Boolean Functions with Depth-2 Circuits. CCC Eric Blais, Li-Yang Tan
2013	J	`jnl`	Approximating Boolean functions with depth-2 circuits. Electron. Colloquium Comput. Complex. Eric Blais, Li-Yang Tan
2013	J	`jnl`	Hypercontractivity Via the Entropy Method. Theory Comput. Eric Blais, Li-Yang Tan
2013	A*	`conf`	Learning Sums of Independent Integer Random Variables. FOCS Constantinos Daskalakis, Ilias Diakonikolas, Ryan O'Donnell, Rocco A. Servedio, Li-Yang Tan
2013	—	`conf`	On the Average Sensitivity and Density of k-CNF Formulas. APPROX-RANDOM Dominik Scheder, Li-Yang Tan
2012	J	`jnl`	Analysis of Boolean Functions CoRR Li-Yang Tan
2012	J	`jnl`	Attribute-Efficient Learning and Weight-Degree Tradeoffs for Polynomial Threshold Functions. Electron. Colloquium Comput. Complex. Rocco A. Servedio, Li-Yang Tan, Justin Thaler
2012	A*	`conf`	Attribute-Efficient Learning and Weight-Degree Tradeoffs for Polynomial Threshold Functions. COLT Rocco A. Servedio, Li-Yang Tan, Justin Thaler
2012	J	`jnl`	Hypercontractive inequalities via SOS, with an application to Vertex-Cover CoRR Manuel Kauers, Ryan O'Donnell, Li-Yang Tan, Yuan Zhou
2012	J	`jnl`	New NP-hardness results for 3-Coloring and 2-to-1 Label Cover CoRR Per Austrin, Ryan O'Donnell, Li-Yang Tan, John Wright
2012	J	`jnl`	On the Distribution of the Fourier Spectrum of Halfspaces CoRR Ilias Diakonikolas, Ragesh Jaiswal, Rocco A. Servedio, Li-Yang Tan, Andrew Wan
2010	A	`conf`	A Regularity Lemma, and Low-Weight Approximators, for Low-Degree Polynomial Threshold Functions. CCC Ilias Diakonikolas, Rocco A. Servedio, Li-Yang Tan, Andrew Wan
2010	A*	`conf`	Bounding the average sensitivity and noise sensitivity of polynomial threshold functions. STOC Ilias Diakonikolas, Prahladh Harsha, Adam R. Klivans, Raghu Meka, Prasad Raghavendra, Rocco A. Servedio, Li-Yang Tan
2009	J	`jnl`	A regularity lemma, and low-weight approximators, for low-degree polynomial threshold functions CoRR Ilias Diakonikolas, Rocco A. Servedio, Li-Yang Tan, Andrew Wan
2009	J	`jnl`	Average sensitivity and noise sensitivity of polynomial threshold functions CoRR Ilias Diakonikolas, Prasad Raghavendra, Rocco A. Servedio, Li-Yang Tan
2005	—	`conf`	The Algebra of Equality Proofs. RTA Aaron Stump, Li-Yang Tan