Lijie Chen - RankMe

145 papers A* 37A 17B 1Journal 87Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A Theory for Probabilistic Polynomial-Time Reasoning. CoRR Lijie Chen, Jiatu Li, Igor C. Oliveira, Ryan Williams
2026	J	`jnl`	A Theory for Probabilistic Polynomial-Time Reasoning. Electron. Colloquium Comput. Complex. Lijie Chen, Jiatu Li, Igor C. Oliveira, Ryan Williams
2026	A	`conf`	New Algebrization Barriers to Circuit Lower Bounds via Communication Complexity of Missing-String. ITCS Lijie Chen, Yang Hu, Hanlin Ren
2026	J	`jnl`	Separating RAM and Multitape Turing Machines with Short Random Oracles. Electron. Colloquium Comput. Complex. Lijie Chen, Yichuan Wang
2026	J	`jnl`	Symmetric Exponential Time Requires Near-Maximum Circuit Size. J. ACM Lijie Chen, Shuichi Hirahara, Zeyong Li, Hanlin Ren
2025	J	`jnl`	Diffusion Language Models are Provably Optimal Parallel Samplers. CoRR Haozhe Jiang, Nika Haghtalab, Lijie Chen
2025	J	`jnl`	Efficient Construction of Rigid Matrices Using an NP Oracle. SIAM J. Comput. Josh Alman, Lijie Chen
2025	A*	`conf`	Fiat-Shamir in the Plain Model from Derandomization (Or: Do Efficient Algorithms Believe that NP = PSPACE?). STOC Lijie Chen, Ron D. Rothblum, Roei Tell
2025	A*	`conf`	Maximum Circuit Lower Bounds for Exponential-Time Arthur Merlin. STOC Lijie Chen, Jiatu Li, Jingxun Liang
2025	J	`jnl`	New Algebrization Barriers to Circuit Lower Bounds via Communication Complexity of Missing-String. CoRR Lijie Chen, Yang Hu, Hanlin Ren
2025	J	`jnl`	New Algebrization Barriers to Circuit Lower Bounds via Communication Complexity of Missing-String. Electron. Colloquium Comput. Complex. Lijie Chen, Yang Hu, Hanlin Ren
2025	J	`jnl`	Nondeterministic Quasi-Polynomial Time is Average-Case Hard for $\textsf{ACC}$ Circuits. SIAM J. Comput. Lijie Chen
2025	J	`jnl`	On the Unprovability of Circuit Size Bounds in Intuitionistic $\mathsf{S}^1_2$. Log. Methods Comput. Sci. Lijie Chen, Jiatu Li, Igor C. Oliveira
2025	J	`jnl`	Special Section on The Sixty-Third Annual IEEE Symposium on Foundations of Computer Science (2022). SIAM J. Comput. Lijie Chen, Alexander Golovnev, Huy Le Nguyen
2025	A*	`conf`	Theoretical limitations of multi-layer Transformer. FOCS Lijie Chen, Binghui Peng, Hongxun Wu
2025	A	`conf`	Towards Free Lunch Derandomization from Necessary Assumptions (And OWFs). CCC Marshall Ball, Lijie Chen, Roei Tell
2025	J	`jnl`	Towards Free Lunch Derandomization from Necessary Assumptions (and OWFs). Electron. Colloquium Comput. Complex. Marshall Ball, Lijie Chen, Roei Tell
2025	J	`jnl`	Understanding In-context Learning of Addition via Activation Subspaces. CoRR Xinyan Hu, Kayo Yin, Michael I. Jordan, Jacob Steinhardt, Lijie Chen
2025	J	`jnl`	Why and How LLMs Hallucinate: Connecting the Dots with Subsequence Associations. CoRR Yiyou Sun, Yu Gai, Lijie Chen, Abhilasha Ravichander, Yejin Choi, Dawn Song
2024	J	`jnl`	Constructive Separations and Their Consequences. TheoretiCS Lijie Chen, Ce Jin, Rahul Santhanam, Ryan Williams
2024	J	`jnl`	Fiat-Shamir in the Plain Model from Derandomization (Or: Do Efficient Algorithms Believe that NP = PSPACE?). Electron. Colloquium Comput. Complex. Lijie Chen, Ron D. Rothblum, Roei Tell
2024	J	`jnl`	LatentQA: Teaching LLMs to Decode Activations Into Natural Language. CoRR Alexander Pan, Lijie Chen, Jacob Steinhardt
2024	J	`jnl`	Maximum Circuit Lower Bounds for Exponential-time Arthur Merlin. Electron. Colloquium Comput. Complex. Lijie Chen, Jiatu Li, Jingxun Liang
2024	J	`jnl`	On the Unprovability of Circuit Size Bounds in Intuitionistic S CoRR Lijie Chen, Jiatu Li, Igor C. Oliveira
2024	J	`jnl`	On the Unprovability of Circuit Size Bounds in Intuitionistic S Electron. Colloquium Comput. Complex. Lijie Chen, Jiatu Li, Igor Carboni Oliveira
2024	J	`jnl`	Quantum Merkle Trees. Quantum Lijie Chen, Ramis Movassagh
2024	A*	`conf`	Reverse Mathematics of Complexity Lower Bounds. FOCS Lijie Chen, Jiatu Li, Igor C. Oliveira
2024	J	`jnl`	Reverse Mathematics of Complexity Lower Bounds. Electron. Colloquium Comput. Complex. Lijie Chen, Jiatu Li, Igor Carboni Oliveira
2024	A*	`conf`	Symmetric Exponential Time Requires Near-Maximum Circuit Size. STOC Lijie Chen, Shuichi Hirahara, Hanlin Ren
2024	J	`jnl`	Theoretical limitations of multi-layer Transformer. CoRR Lijie Chen, Binghui Peng, Hongxun Wu
2023	A	`conf`	Black-Box Constructive Proofs Are Unavoidable. ITCS Lijie Chen, Ryan Williams, Tianqi Yang
2023	A*	`conf`	Derandomization vs Refutation: A Unified Framework for Characterizing Derandomization. FOCS Lijie Chen, Roei Tell, Ryan Williams
2023	J	`jnl`	Derandomization vs Refutation: A Unified Framework for Characterizing Derandomization. Electron. Colloquium Comput. Complex. Lijie Chen, Roei Tell, Ryan Williams
2023	J	`jnl`	Guest Column: New ways of studying the BPP = P conjecture. SIGACT News Lijie Chen, Roei Tell
2023	J	`jnl`	Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity. Algorithmica Shyan Akmal, Lijie Chen, Ce Jin, Malvika Raj, R. Ryan Williams
2023	A	`conf`	New Lower Bounds and Derandomization for ACC, and a Derandomization-Centric View on the Algorithmic Method. ITCS Lijie Chen
2023	A*	`conf`	New PRGs for Unbounded-Width/Adaptive-Order Read-Once Branching Programs. ICALP Lijie Chen, Xin Lyu, Avishay Tal, Hongxun Wu
2023	J	`jnl`	New ways of studying the BPP = P conjecture. Electron. Colloquium Comput. Complex. Lijie Chen, Roei Tell
2023	J	`jnl`	On Exponential-time Hypotheses, Derandomization, and Circuit Lower Bounds. J. ACM Lijie Chen, Ron D. Rothblum, Roei Tell, Eylon Yogev
2023	A*	`conf`	Polynomial-Time Pseudodeterministic Construction of Primes. FOCS Lijie Chen, Zhenjian Lu, Igor C. Oliveira, Hanlin Ren, Rahul Santhanam
2023	J	`jnl`	Polynomial-Time Pseudodeterministic Construction of Primes. CoRR Lijie Chen, Zhenjian Lu, Igor C. Oliveira, Hanlin Ren, Rahul Santhanam
2023	J	`jnl`	Polynomial-Time Pseudodeterministic Construction of Primes. Electron. Colloquium Comput. Complex. Lijie Chen, Zhenjian Lu, Igor Carboni Oliveira, Hanlin Ren, Rahul Santhanam
2023	J	`jnl`	Symmetric Exponential Time Requires Near-Maximum Circuit Size. CoRR Lijie Chen, Shuichi Hirahara, Hanlin Ren
2023	J	`jnl`	Symmetric Exponential Time Requires Near-Maximum Circuit Size. Electron. Colloquium Comput. Complex. Lijie Chen, Shuichi Hirahara, Hanlin Ren
2023	A*	`conf`	Towards Multi-Pass Streaming Lower Bounds for Optimal Approximation of Max-Cut. SODA Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu
2023	A*	`conf`	Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting. FOCS Lijie Chen, William M. Hoza, Xin Lyu, Avishay Tal, Hongxun Wu
2023	J	`jnl`	Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting. Electron. Colloquium Comput. Complex. Lijie Chen, William Hoza, Xin Lyu, Avishay Tal, Hongxun Wu
2023	A*	`conf`	When Arthur Has Neither Random Coins Nor Time to Spare: Superfast Derandomization of Proof Systems. STOC Lijie Chen, Roei Tell
2022	A	`conf`	Average-Case Hardness of NP and PH from Worst-Case Fine-Grained Assumptions. ITCS Lijie Chen, Shuichi Hirahara, Neekon Vafa
2022	—	`—`	Better Hardness via Algorithms, and New Forms of Hardness versus Randomness Lijie Chen
2022	J	`jnl`	Beyond Natural Proofs: Hardness Magnification and Locality. J. ACM Lijie Chen, Shuichi Hirahara, Igor Carboni Oliveira, Ján Pich, Ninad Rajgopal, Rahul Santhanam
2022	J	`jnl`	Constructive Separations and Their Consequences. CoRR Lijie Chen, Ce Jin, Rahul Santhanam, R. Ryan Williams
2022	A	`conf`	Extremely Efficient Constructions of Hash Functions, with Applications to Hardness Magnification and PRFs. CCC Lijie Chen, Jiatu Li, Tianqi Yang
2022	J	`jnl`	Extremely Efficient Constructions of Hash Functions, with Applications to Hardness Magnification and PRFs. Electron. Colloquium Comput. Complex. Lijie Chen, Jiatu Li, Tianqi Yang
2022	A	`conf`	Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity. ITCS Shyan Akmal, Lijie Chen, Ce Jin, Malvika Raj, Ryan Williams
2022	J	`jnl`	New Lower Bounds and Derandomization for ACC, and a Derandomization-centric View on the Algorithmic Method. Electron. Colloquium Comput. Complex. Lijie Chen
2022	J	`jnl`	Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization. SIAM J. Comput. Lijie Chen, Hanlin Ren
2022	J	`jnl`	Towards Multi-Pass Streaming Lower Bounds for Optimal Approximation of Max-Cut. Electron. Colloquium Comput. Complex. Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena, Zhao Song, Huacheng Yu
2022	A*	`conf`	Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions. SODA Lijie Chen, Ce Jin, R. Ryan Williams, Hongxun Wu
2022	A*	`conf`	Unstructured Hardness to Average-Case Randomness. FOCS Lijie Chen, Ron D. Rothblum, Roei Tell
2022	J	`jnl`	Unstructured Hardness to Average-Case Randomness. Electron. Colloquium Comput. Complex. Lijie Chen, Ron D. Rothblum, Roei Tell
2022	J	`jnl`	When Arthur has Neither Random Coins nor Time to Spare: Superfast Derandomization of Proof Systems. Electron. Colloquium Comput. Complex. Lijie Chen, Roei Tell
2021	J	`jnl`	Almost Optimal Super-Constant-Pass Streaming Lower Bounds for Reachability. Electron. Colloquium Comput. Complex. Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena, Zhao Song, Huacheng Yu
2021	A*	`conf`	Almost optimal super-constant-pass streaming lower bounds for reachability. STOC Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu
2021	J	`jnl`	Average-case Hardness of NP and PH from Worst-case Fine-grained Assumptions. Electron. Colloquium Comput. Complex. Lijie Chen, Shuichi Hirahara, Neekon Vafa
2021	A*	`conf`	Constructive Separations and Their Consequences. FOCS Lijie Chen, Ce Jin, Rahul Santhanam, R. Ryan Williams
2021	J	`jnl`	Constructive Separations and Their Consequences. Electron. Colloquium Comput. Complex. Lijie Chen, Ce Jin, Rahul Santhanam, Ryan Williams
2021	A*	`conf`	Hardness vs Randomness, Revised: Uniform, Non-Black-Box, and Instance-Wise. FOCS Lijie Chen, Roei Tell
2021	J	`jnl`	Hardness vs Randomness, Revised: Uniform, Non-Black-Box, and Instance-Wise. Electron. Colloquium Comput. Complex. Lijie Chen, Roei Tell
2021	J	`jnl`	Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity. Electron. Colloquium Comput. Complex. Shyan Akmal, Lijie Chen, Ce Jin, Malvika Raj, Ryan Williams
2021	J	`jnl`	Inverse-Exponential Correlation Bounds and Extremely Rigid Matrices from a New Derandomized XOR Lemma. Electron. Colloquium Comput. Complex. Lijie Chen, Xin Lyu
2021	A*	`conf`	Inverse-exponential correlation bounds and extremely rigid matrices from a new derandomized XOR lemma. STOC Lijie Chen, Xin Lyu
2021	J	`jnl`	Majority vs. Approximate Linear Sum and Average-Case Complexity Below NC1. Electron. Colloquium Comput. Complex. Lijie Chen, Zhenjian Lu, Xin Lyu, Igor Carboni Oliveira
2021	A*	`conf`	Majority vs. Approximate Linear Sum and Average-Case Complexity Below NC¹. ICALP Lijie Chen, Zhenjian Lu, Xin Lyu, Igor C. Oliveira
2021	A*	`conf`	Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs. ICALP Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu
2021	J	`jnl`	Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs. CoRR Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena, Zhao Song, Huacheng Yu
2021	A	`conf`	On Distributed Differential Privacy and Counting Distinct Elements. ITCS Lijie Chen, Badih Ghazi, Ravi Kumar, Pasin Manurangsi
2021	J	`jnl`	Quantum Merkle Trees. CoRR Lijie Chen, Ramis Movassagh
2021	A*	`conf`	Simple and fast derandomization from very hard functions: eliminating randomness at almost no cost. STOC Lijie Chen, Roei Tell
2021	J	`jnl`	Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions. CoRR Lijie Chen, Ce Jin, R. Ryan Williams, Hongxun Wu
2020	A*	`conf`	Almost-Everywhere Circuit Lower Bounds from Non-Trivial Derandomization. FOCS Lijie Chen, Xin Lyu, R. Ryan Williams
2020	J	`jnl`	Almost-Everywhere Circuit Lower Bounds from Non-Trivial Derandomization. Electron. Colloquium Comput. Complex. Lijie Chen, Xin Lyu, Ryan Williams
2020	A	`conf`	Beyond Natural Proofs: Hardness Magnification and Locality. ITCS Lijie Chen, Shuichi Hirahara, Igor C. Oliveira, Ján Pich, Ninad Rajgopal, Rahul Santhanam
2020	J	`jnl`	On Distributed Differential Privacy and Counting Distinct Elements. CoRR Lijie Chen, Badih Ghazi, Ravi Kumar, Pasin Manurangsi
2020	A*	`conf`	On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds: Extended Abstract. FOCS Lijie Chen, Ron D. Rothblum, Roei Tell, Eylon Yogev
2020	J	`jnl`	On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product. Theory Comput. Lijie Chen
2020	J	`jnl`	On the Power of Statistical Zero Knowledge. SIAM J. Comput. Adam Bouland, Lijie Chen, Dhiraj Holden, Justin Thaler, Prashant Nalini Vasudevan
2020	J	`jnl`	Sharp Threshold Results for Computational Complexity. Electron. Colloquium Comput. Complex. Lijie Chen, Ce Jin, R. Ryan Williams
2020	A*	`conf`	Sharp threshold results for computational complexity. STOC Lijie Chen, Ce Jin, R. Ryan Williams
2020	J	`jnl`	Simple and fast derandomization from very hard functions: Eliminating randomness at almost no cost. Electron. Colloquium Comput. Complex. Lijie Chen, Roei Tell
2020	J	`jnl`	Strong Average-Case Circuit Lower Bounds from Non-trivial Derandomization. Electron. Colloquium Comput. Complex. Lijie Chen, Hanlin Ren
2020	A*	`conf`	Strong average-case lower bounds from non-trivial derandomization. STOC Lijie Chen, Hanlin Ren
2019	A*	`conf`	An Equivalence Class for Orthogonal Vectors. SODA Lijie Chen, Ryan Williams
2019	J	`jnl`	Beyond Natural Proofs: Hardness Magnification and Locality. CoRR Lijie Chen, Shuichi Hirahara, Igor C. Oliveira, Ján Pich, Ninad Rajgopal, Rahul Santhanam
2019	J	`jnl`	Beyond Natural Proofs: Hardness Magnification and Locality. Electron. Colloquium Comput. Complex. Igor Carboni Oliveira, Lijie Chen, Shuichi Hirahara, Ján Pich, Ninad Rajgopal, Rahul Santhanam
2019	A*	`conf`	Bootstrapping results for threshold circuits "just beyond" known lower bounds. STOC Lijie Chen, Roei Tell
2019	A*	`conf`	Broadcast Congested Clique: Planted Cliques and Pseudorandom Generators. PODC Lijie Chen, Ofer Grossman
2019	J	`jnl`	Broadcast Congested Clique: Planted Cliques and Pseudorandom Generators. CoRR Lijie Chen, Ofer Grossman
2019	J	`jnl`	Broadcast Congested Clique: Planted Cliques and Pseudorandom Generators. Electron. Colloquium Comput. Complex. Lijie Chen, Ofer Grossman
2019	A	`conf`	Classical Algorithms from Quantum and Arthur-Merlin Communication Protocols. ITCS Lijie Chen, Ruosong Wang
2019	A*	`conf`	Efficient Construction of Rigid Matrices Using an NP Oracle. FOCS Josh Alman, Lijie Chen
2019	A*	`conf`	Fine-grained Complexity Meets IP = PSPACE. SODA Lijie Chen, Shafi Goldwasser, Kaifeng Lyu, Guy N. Rothblum, Aviad Rubinstein
2019	A*	`conf`	Hardness Magnification for all Sparse NP Languages. FOCS Lijie Chen, Ce Jin, R. Ryan Williams
2019	J	`jnl`	Hardness Magnification for all Sparse NP Languages. Electron. Colloquium Comput. Complex. Lijie Chen, Ce Jin, Ryan Williams
2019	A*	`conf`	Non-deterministic Quasi-Polynomial Time is Average-Case Hard for ACC Circuits. FOCS Lijie Chen
2019	J	`jnl`	Non-deterministic Quasi-Polynomial Time is Average-case Hard for ACC Circuits. Electron. Colloquium Comput. Complex. Lijie Chen
2019	J	`jnl`	On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds. Electron. Colloquium Comput. Complex. Lijie Chen, Ron Rothblum, Roei Tell, Eylon Yogev
2019	A	`conf`	Relations and Equivalences Between Circuit Lower Bounds and Karp-Lipton Theorems. CCC Lijie Chen, Dylan M. McKay, Cody D. Murray, R. Ryan Williams
2019	J	`jnl`	Relations and Equivalences Between Circuit Lower Bounds and Karp-Lipton Theorems. Electron. Colloquium Comput. Complex. Lijie Chen, Dylan M. McKay, Cody Murray, R. Ryan Williams
2019	A	`conf`	Stronger Connections Between Circuit Analysis and Circuit Lower Bounds, via PCPs of Proximity. CCC Lijie Chen, R. Ryan Williams
2018	J	`jnl`	An Equivalence Class for Orthogonal Vectors. CoRR Lijie Chen, Ryan Williams
2018	—	`conf`	An Improved Algorithm for Incremental DFS Tree in Undirected Graphs. SWAT Lijie Chen, Ran Duan, Ruosong Wang, Hanrui Zhang, Tianyi Zhang
2018	J	`jnl`	Bootstrapping Results for Threshold Circuits "Just Beyond" Known Lower Bounds. Electron. Colloquium Comput. Complex. Lijie Chen, Roei Tell
2018	J	`jnl`	Classical Algorithms from Quantum and Arthur-Merlin Communication Protocols. CoRR Lijie Chen, Ruosong Wang
2018	J	`jnl`	Fine-grained Complexity Meets IP = PSPACE. CoRR Lijie Chen, Shafi Goldwasser, Kaifeng Lyu, Guy N. Rothblum, Aviad Rubinstein
2018	J	`jnl`	Nearly Optimal Separation Between Partially And Fully Retroactive Data Structures. CoRR Lijie Chen, Erik D. Demaine, Yuzhou Gu, Virginia Vassilevska Williams, Yinzhan Xu, Yuancheng Yu
2018	—	`conf`	Nearly Optimal Separation Between Partially and Fully Retroactive Data Structures. SWAT Lijie Chen, Erik D. Demaine, Yuzhou Gu, Virginia Vassilevska Williams, Yinzhan Xu, Yuancheng Yu
2018	A	`conf`	On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product. CCC Lijie Chen
2018	J	`jnl`	On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product. CoRR Lijie Chen
2018	J	`jnl`	On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product. Electron. Colloquium Comput. Complex. Lijie Chen
2018	J	`jnl`	Toward Super-Polynomial Size Lower Bounds for Depth-Two Threshold Circuits. CoRR Lijie Chen
2017	A*	`conf`	Bounded Rationality of Restricted Turing Machines. AAAI Lijie Chen, Pingzhong Tang, Ruosong Wang
2017	A	`conf`	Complexity-Theoretic Foundations of Quantum Supremacy Experiments. CCC Scott Aaronson, Lijie Chen
2017	A	`conf`	K-Memory Strategies in Repeated Games. AAMAS Lijie Chen, Fangzhen Lin, Pingzhong Tang, Kangning Wang, Ruosong Wang, Shiheng Wang
2017	A	`conf`	Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection. AISTATS Lijie Chen, Jian Li, Mingda Qiao
2017	J	`jnl`	Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection. CoRR Lijie Chen, Jian Li, Mingda Qiao
2017	A*	`conf`	Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration. COLT Lijie Chen, Anupam Gupta, Jian Li, Mingda Qiao, Ruosong Wang
2017	J	`jnl`	Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration. CoRR Lijie Chen, Anupam Gupta, Jian Li, Mingda Qiao, Ruosong Wang
2017	A*	`conf`	On the Power of Statistical Zero Knowledge. FOCS Adam Bouland, Lijie Chen, Dhiraj Holden, Justin Thaler, Prashant Nalini Vasudevan
2017	A*	`conf`	Towards Instance Optimal Bounds for Best Arm Identification. COLT Lijie Chen, Jian Li, Mingda Qiao
2016	J	`jnl`	A Note on Oracle Separations for BQP. CoRR Lijie Chen
2016	J	`jnl`	Adaptivity vs Postselection. CoRR Lijie Chen
2016	B	`conf`	Adaptivity vs. Postselection, and Hardness Amplification for Polynomial Approximation. ISAAC Lijie Chen
2016	J	`jnl`	Complexity-Theoretic Foundations of Quantum Supremacy Experiments. CoRR Scott Aaronson, Lijie Chen
2016	J	`jnl`	Complexity-Theoretic Foundations of Quantum Supremacy Experiments. Electron. Colloquium Comput. Complex. Scott Aaronson, Lijie Chen
2016	J	`jnl`	Improved Algorithms for Maintaining DFS Tree in Undirected Graphs. CoRR Lijie Chen, Ran Duan, Ruosong Wang, Hanrui Zhang
2016	J	`jnl`	On SZK and PP. CoRR Adam Bouland, Lijie Chen, Dhiraj Holden, Justin Thaler, Prashant Nalini Vasudevan
2016	J	`jnl`	On SZK and PP. Electron. Colloquium Comput. Complex. Adam Bouland, Lijie Chen, Dhiraj Holden, Justin Thaler, Prashant Nalini Vasudevan
2016	A*	`conf`	Open Problem: Best Arm Identification: Almost Instance-Wise Optimality and the Gap Entropy Conjecture. COLT Lijie Chen, Jian Li
2016	J	`jnl`	Open Problem: Best Arm Identification: Almost Instance-Wise Optimality and the Gap Entropy Conjecture. CoRR Lijie Chen, Jian Li
2016	A*	`conf`	Pure Exploration of Multi-armed Bandit Under Matroid Constraints. COLT Lijie Chen, Anupam Gupta, Jian Li
2016	J	`jnl`	Pure Exploration of Multi-armed Bandit Under Matroid Constraints. CoRR Lijie Chen, Anupam Gupta, Jian Li
2016	J	`jnl`	Towards Instance Optimal Bounds for Best Arm Identification. CoRR Lijie Chen, Jian Li, Mingda Qiao
2015	A	`conf`	Bounded Rationality of Restricted Turing Machines. AAMAS Lijie Chen, Pingzhong Tang
2015	J	`jnl`	On the Optimal Sample Complexity for Best Arm Identification. CoRR Lijie Chen, Jian Li