| 2026 | STOC | A Theory for Probabilistic Polynomial-Time Reasoning. | Lijie Chen, Jiatu Li, Igor C. Oliveira, Ryan Williams |
| 2026 | STOC | Superquadratic Lower Bounds for Depth-2 Linear Threshold Circuits. | Lijie Chen, Avishay Tal, Yichuan Wang |
| 2025 | FOCS | Theoretical limitations of multi-layer Transformer. | Lijie Chen, Binghui Peng, Hongxun Wu |
| 2025 | STOC | Maximum Circuit Lower Bounds for Exponential-Time Arthur Merlin. | Lijie Chen, Jiatu Li, Jingxun Liang |
| 2025 | STOC | Fiat-Shamir in the Plain Model from Derandomization (Or: Do Efficient Algorithms Believe that NP = PSPACE?). | Lijie Chen, Ron D. Rothblum, Roei Tell |
| 2024 | FOCS | Reverse Mathematics of Complexity Lower Bounds. | Lijie Chen, Jiatu Li, Igor C. Oliveira |
| 2024 | STOC | Symmetric Exponential Time Requires Near-Maximum Circuit Size. | Lijie Chen, Shuichi Hirahara, Hanlin Ren |
| 2023 | FOCS | Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting. | Lijie Chen, William M. Hoza, Xin Lyu, Avishay Tal, Hongxun Wu |
| 2023 | FOCS | Polynomial-Time Pseudodeterministic Construction of Primes. | Lijie Chen, Zhenjian Lu, Igor C. Oliveira, Hanlin Ren, Rahul Santhanam |
| 2023 | FOCS | Derandomization vs Refutation: A Unified Framework for Characterizing Derandomization. | Lijie Chen, Roei Tell, Ryan Williams |
| 2023 | ICALP | New PRGs for Unbounded-Width/Adaptive-Order Read-Once Branching Programs. | Lijie Chen, Xin Lyu, Avishay Tal, Hongxun Wu |
| 2023 | SODA | Towards Multi-Pass Streaming Lower Bounds for Optimal Approximation of Max-Cut. | Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu |
| 2023 | STOC | When Arthur Has Neither Random Coins Nor Time to Spare: Superfast Derandomization of Proof Systems. | Lijie Chen, Roei Tell |
| 2022 | FOCS | Unstructured Hardness to Average-Case Randomness. | Lijie Chen, Ron D. Rothblum, Roei Tell |
| 2022 | SODA | Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions. | Lijie Chen, Ce Jin, R. Ryan Williams, Hongxun Wu |
| 2021 | FOCS | Constructive Separations and Their Consequences. | Lijie Chen, Ce Jin, Rahul Santhanam, R. Ryan Williams |
| 2021 | FOCS | Hardness vs Randomness, Revised: Uniform, Non-Black-Box, and Instance-Wise. | Lijie Chen, Roei Tell |
| 2021 | ICA3PP | Privacy-Preserving Swarm Learning Based on Homomorphic Encryption. | Lijie Chen, Shaojing Fu, Lin Liu, Yuchuan Luo, Wentao Zhao |
| 2021 | ICALP | Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs. | Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu |
| 2021 | ICALP | Majority vs. Approximate Linear Sum and Average-Case Complexity Below NC¹. | Lijie Chen, Zhenjian Lu, Xin Lyu, Igor C. Oliveira |
| 2021 | STOC | Almost optimal super-constant-pass streaming lower bounds for reachability. | Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu |
| 2021 | STOC | Inverse-exponential correlation bounds and extremely rigid matrices from a new derandomized XOR lemma. | Lijie Chen, Xin Lyu |
| 2021 | STOC | Simple and fast derandomization from very hard functions: eliminating randomness at almost no cost. | Lijie Chen, Roei Tell |
| 2020 | FOCS | Almost-Everywhere Circuit Lower Bounds from Non-Trivial Derandomization. | Lijie Chen, Xin Lyu, R. Ryan Williams |
| 2020 | FOCS | On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds: Extended Abstract. | Lijie Chen, Ron D. Rothblum, Roei Tell, Eylon Yogev |
| 2020 | STOC | Sharp threshold results for computational complexity. | Lijie Chen, Ce Jin, R. Ryan Williams |
| 2020 | STOC | Strong average-case lower bounds from non-trivial derandomization. | Lijie Chen, Hanlin Ren |
| 2019 | FOCS | Efficient Construction of Rigid Matrices Using an NP Oracle. | Josh Alman, Lijie Chen |
| 2019 | FOCS | Non-deterministic Quasi-Polynomial Time is Average-Case Hard for ACC Circuits. | Lijie Chen |
| 2019 | FOCS | Hardness Magnification for all Sparse NP Languages. | Lijie Chen, Ce Jin, R. Ryan Williams |
| 2019 | PODC | Broadcast Congested Clique: Planted Cliques and Pseudorandom Generators. | Lijie Chen, Ofer Grossman |
| 2019 | SODA | Fine-grained Complexity Meets IP = PSPACE. | Lijie Chen, Shafi Goldwasser, Kaifeng Lyu, Guy N. Rothblum, Aviad Rubinstein |
| 2019 | SODA | An Equivalence Class for Orthogonal Vectors. | Lijie Chen, Ryan Williams |
| 2019 | STOC | Bootstrapping results for threshold circuits "just beyond" known lower bounds. | Lijie Chen, Roei Tell |
| 2017 | AAAI | Bounded Rationality of Restricted Turing Machines. | Lijie Chen, Pingzhong Tang, Ruosong Wang |
| 2017 | AISTATS | Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection. | Lijie Chen, Jian Li, Mingda Qiao |
| 2017 | COLT | Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration. | Lijie Chen, Anupam Gupta, Jian Li, Mingda Qiao, Ruosong Wang |
| 2017 | COLT | Towards Instance Optimal Bounds for Best Arm Identification. | Lijie Chen, Jian Li, Mingda Qiao |
| 2017 | FOCS | On the Power of Statistical Zero Knowledge. | Adam Bouland, Lijie Chen, Dhiraj Holden, Justin Thaler, Prashant Nalini Vasudevan |
| 2016 | COLT | Pure Exploration of Multi-armed Bandit Under Matroid Constraints. | Lijie Chen, Anupam Gupta, Jian Li |
| 2016 | COLT | Open Problem: Best Arm Identification: Almost Instance-Wise Optimality and the Gap Entropy Conjecture. | Lijie Chen, Jian Li |
| 2016 | ISAAC | Adaptivity vs. Postselection, and Hardness Amplification for Polynomial Approximation. | Lijie Chen |