Li-Yang Tan

721 total citations
37 papers, 174 citations indexed

About

Li-Yang Tan is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Li-Yang Tan has authored 37 papers receiving a total of 174 indexed citations (citations by other indexed papers that have themselves been cited), including 30 papers in Computational Theory and Mathematics, 20 papers in Artificial Intelligence and 4 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Li-Yang Tan's work include Complexity and Algorithms in Graphs (27 papers), Machine Learning and Algorithms (19 papers) and Algorithms and Data Compression (8 papers). Li-Yang Tan is often cited by papers focused on Complexity and Algorithms in Graphs (27 papers), Machine Learning and Algorithms (19 papers) and Algorithms and Data Compression (8 papers). Li-Yang Tan collaborates with scholars based in United States, Canada and Japan. Li-Yang Tan's co-authors include Rocco A. Servedio, Ryan O’Donnell, Ilias Diakonikolas, Prasad Raghavendra, Xi Chen, Anindya De, Adam R. Klivans, Raghu Meka, Benjamin Rossman and Omer Tamuz and has published in prestigious journals such as SHILAP Revista de lepidopterología, Journal of the ACM and SIAM Journal on Computing.

In The Last Decade

Li-Yang Tan

29 papers receiving 157 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Li-Yang Tan United States	7	119	102	24	23	14	37	174
Kevin Matulef United States	6	146 1.2×	122 1.2×	48 2.0×	12 0.5×	6 0.4×	11	196
Madhur Tulsiani United States	7	130 1.1×	67 0.7×	58 2.4×	10 0.4×	5 0.4×	28	174
John Abbott Italy	7	107 0.9×	47 0.5×	8 0.3×	7 0.3×	4 0.3×	23	152
Omri Weinstein United States	8	136 1.1×	111 1.1×	40 1.7×	12 0.5×	2 0.1×	32	196
Enrico Carlini Italy	10	147 1.2×	38 0.4×	5 0.2×	10 0.4×	18 1.3×	39	317
Gábor Kun Hungary	9	124 1.0×	21 0.2×	52 2.2×	6 0.3×	11 0.8×	23	181
Tselil Schramm United States	7	38 0.3×	69 0.7×	20 0.8×	41 1.8×	28 2.0×	20	143
Hervé Fournier France	8	107 0.9×	48 0.5×	19 0.8×	4 0.2×	4 0.3×	19	153
Miloš Stojaković Serbia	9	143 1.2×	44 0.4×	28 1.2×	8 0.3×	5 0.4×	33	214
Hervé Daudé France	9	98 0.8×	48 0.5×	106 4.4×	11 0.5×	4 0.3×	13	172

Countries citing papers authored by Li-Yang Tan

Since Specialization

Citations

This map shows the geographic impact of Li-Yang Tan's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Li-Yang Tan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Li-Yang Tan more than expected).

Fields of papers citing papers by Li-Yang Tan

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Li-Yang Tan. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Li-Yang Tan. The network helps show where Li-Yang Tan may publish in the future.

Co-authorship network of co-authors of Li-Yang Tan

This figure shows the co-authorship network connecting the top 25 collaborators of Li-Yang Tan. A scholar is included among the top collaborators of Li-Yang Tan based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Li-Yang Tan. Li-Yang Tan is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Tan, Li-Yang, et al.. (2024). The Sample Complexity of Smooth Boosting and the Tightness of the Hardcore Theorem. 1431–1450. 1 indexed citations

2.

Tan, Li-Yang, et al.. (2023). Properly learning decision trees with queries is NP-hard. 1 indexed citations

3.

Sullivan, Colin E., et al.. (2023). Harnessing the power of choices in decision tree learning. 80220–80232.

4.

Tan, Li-Yang, et al.. (2022). Properly Learning Decision Trees in almost Polynomial Time. Journal of the ACM. 69(6). 1–19. 3 indexed citations

5.

Pitassi, Toniann, et al.. (2022). Tradeoffs for small-depth Frege proofs. 145. 445–456. 1 indexed citations

6.

O’Donnell, Ryan, Rocco A. Servedio, & Li-Yang Tan. (2022). Fooling Polytopes. Journal of the ACM. 69(2). 1–37.

7.

O’Donnell, Ryan, Rocco A. Servedio, & Li-Yang Tan. (2020). Fooling Gaussian PTFs via local hyperconcentration. 1170–1183. 1 indexed citations

8.

Charikar, Moses, et al.. (2020). Unconditional Lower Bounds for Adaptive Massively Parallel Computation. 141–151. 1 indexed citations

9.

O’Donnell, Ryan, Rocco A. Servedio, & Li-Yang Tan. (2019). Fooling polytopes. 614–625. 5 indexed citations

10.

Håstad, Johan, Benjamin Rossman, Rocco A. Servedio, & Li-Yang Tan. (2017). An Average-Case Depth Hierarchy Theorem for Boolean Circuits. Journal of the ACM. 64(5). 1–27. 5 indexed citations

11.

Benjamini, Itaï, et al.. (2016). Convergence, unanimity and disagreement in majority dynamics on unimodular graphs and random graphs. Stochastic Processes and their Applications. 126(9). 2719–2733. 21 indexed citations

12.

Chen, Xi, et al.. (2016). Near-optimal small-depth lower bounds for small distance connectivity. Warwick Research Archive Portal (University of Warwick). 612–625. 5 indexed citations

13.

Rossman, Benjamin, Rocco A. Servedio, & Li-Yang Tan. (2015). Complexity Theory Column 89. ACM SIGACT News. 46(4). 50–68. 1 indexed citations

14.

Blais, Eric, et al.. (2015). Learning Circuits with few Negations. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 21. 144.

15.

Kauers, Manuel, Ryan O’Donnell, Li-Yang Tan, & Yuan Zhou. (2014). Hypercontractive inequalities via SOS, and the Frankl-Rödl graph. Symposium on Discrete Algorithms. 1644–1658. 5 indexed citations

16.

Diakonikolas, Ilias, Rocco A. Servedio, Li-Yang Tan, & Andrew Wan. (2014). . Theory of Computing. 10(1). 27–53. 4 indexed citations

17.

O’Donnell, Ryan, John C. Wright, Yu Zhao, Xiaorui Sun, & Li-Yang Tan. (2014). A Composition Theorem for Parity Kill Number. 144–154. 5 indexed citations

18.

Blais, Eric & Li-Yang Tan. (2013). Approximating Boolean functions with depth-2 circuits.. Electronic colloquium on computational complexity. 20. 51. 1 indexed citations

19.

Blais, Eric & Li-Yang Tan. (2013). . Theory of Computing. 9(1). 889–896. 2 indexed citations

20.

Servedio, Rocco A., Li-Yang Tan, & Justin Thaler. (2012). Attribute-Efficient Learning and Weight-Degree Tradeoffs for Polynomial Threshold Functions. Electronic colloquium on computational complexity. 19. 56. 3 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact