Li-Yang Tan

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6147354	2024-01-15	Paper
The query complexity of certification	2023-12-08	Paper
Deterministic Approximate Counting of Polynomial Threshold Functions via a Derandomized Regularity Lemma.	2023-11-20	Paper
Decision Tree Heuristics Can Fail, Even in the Smoothed Setting	2023-11-20	Paper
On the power and limitations of branch and cut	2023-07-12	Paper
https://portal.mardi4nfdi.de/entity/Q5875501	2023-02-03	Paper
https://portal.mardi4nfdi.de/entity/Q5875745	2023-02-03	Paper
Non-malleability against polynomial tampering	2022-12-07	Paper
https://portal.mardi4nfdi.de/entity/Q5077146	2022-05-18	Paper
Fooling Polytopes	2022-03-31	Paper
https://portal.mardi4nfdi.de/entity/Q5009555	2021-08-04	Paper
Adaptivity Is Exponentially Powerful for Testing Monotonicity of Halfspaces	2021-07-28	Paper
Fooling Gaussian PTFs via local hyperconcentration	2021-01-19	Paper
https://portal.mardi4nfdi.de/entity/Q5111156	2020-05-26	Paper
Fooling polytopes	2020-01-30	Paper
Pseudorandomness for read-k DNF formulas	2019-10-15	Paper
Hypercontractive inequalities via SOS, and the Frankl–Rödl graph	2019-06-20	Paper
Settling the Query Complexity of Non-adaptive Junta Testing	2019-02-25	Paper
An Average-Case Depth Hierarchy Theorem for Boolean Circuits	2018-05-17	Paper
What Circuit Classes Can Be Learned with Non-Trivial Savings?	2018-05-03	Paper
Approximate resilience, monotonicity, and the complexity of agnostic learning	2017-10-05	Paper
Near-optimal small-depth lower bounds for small distance connectivity	2017-09-29	Paper
Poly-logarithmic Frege depth lower bounds via an expander switching lemma	2017-09-29	Paper
Learning circuits with few negations	2017-08-31	Paper
Hypercontractive inequalities via SOS, and the Frankl--Rödl graph	2016-10-10	Paper
Convergence, unanimity and disagreement in majority dynamics on unimodular graphs and random graphs	2016-08-08	Paper
https://portal.mardi4nfdi.de/entity/Q3466401	2016-02-01	Paper
Approximating Boolean Functions with Depth-2 Circuits	2015-11-18	Paper
Algorithmic Signaling of Features in Auction Design	2015-11-04	Paper
Boolean Function Monotonicity Testing Requires (Almost) n 1/2 Non-adaptive Queries	2015-08-21	Paper
https://portal.mardi4nfdi.de/entity/Q3191599	2014-10-06	Paper
https://portal.mardi4nfdi.de/entity/Q3191611	2014-10-06	Paper
Bounding the average sensitivity and noise sensitivity of polynomial threshold functions	2014-08-13	Paper
On DNF Approximators for Monotone Boolean Functions	2014-07-01	Paper
Average Sensitivity and Noise Sensitivity of Polynomial Threshold Functions	2014-06-04	Paper
On the Average Sensitivity and Density of k-CNF Formulas	2013-10-04	Paper
A Composition Theorem for the Fourier Entropy-Influence Conjecture	2013-08-06	Paper
On the Distribution of the Fourier Spectrum of Halfspaces	2012-02-29	Paper
https://portal.mardi4nfdi.de/entity/Q3445728	2007-06-06	Paper
Term Rewriting and Applications	2005-11-11	Paper
Design of a robust estimator for nonlinear kinetic modelling	1995-12-13	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Li-Yang Tan