Lijie Chen

State Key Laboratory of Cryptology — China

Computer Science · Physical Sciences

14h-index600citations105works1.52yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Complexity and Algorithms in Graphs(56), Cryptography and Data Security(30), Optimization and Search Problems(20), Machine Learning and Algorithms(18), Advanced Graph Theory Research(15)

Publications105 total

Symmetric Exponential Time Requires Near-Maximum Circuit Size
Journal of the ACM·2025Open Access
On the Unprovability of Circuit Size Bounds in Intuitionistic $\mathsf{S}^1_2$
Logical Methods in Computer Science·2025Open Access
Discrete ILQG method based on high-order exponential Runge–Kutta discretization
Results in Applied Mathematics·2025Open Access
Grouped Byzantine fault tolerant consensus algorithm based on aggregated signatures
Cybersecurity·2025· 1 citedOpen Access
Fiat-Shamir in the Plain Model from Derandomization (Or: Do Efficient Algorithms Believe that NP = PSPACE?)
2025· 2 cited
Maximum Circuit Lower Bounds for Exponential-Time Arthur Merlin
2025· 1 cited
Holographic pseudoentanglement and the complexity of the AdS/CFT dictionary
arXiv (Cornell University)·2024· 2 citedOpen Access
Reverse Mathematics of Complexity Lower Bounds
2024· 2 cited
Test Case Generation Approach Relying on Colored Petri Nets and Its Application in The R Handover Process of The Train Control System
2024
Symmetric Exponential Time Requires Near-Maximum Circuit Size
2024· 8 citedOpen Access
On the Unprovability of Circuit Size Bounds in Intuitionistic $\mathsf{S}^1_2$
arXiv (Cornell University)·2024Open Access
Almost Optimal SuperConstant-Pass Streaming Lower Bounds for Reachability
SIAM Journal on Computing·2024· 4 cited
Nondeterministic Quasi-Polynomial Time is Average-Case Hard for \(\textsf{ACC}\) Circuits
SIAM Journal on Computing·2024· 1 cited
Constructive Separations and Their Consequences
TheoretiCS·2024Open Access
Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting
2023· 1 cited
Derandomization vs Refutation: A Unified Framework for Characterizing Derandomization
2023· 8 cited
Polynomial-Time Pseudodeterministic Construction of Primes
2023· 6 cited
Symmetric Exponential Time Requires Near-Maximum Circuit Size
arXiv (Cornell University)·2023Open Access
Guest Column: New ways of studying the BPP = P conjecture
ACM SIGACT News·2023· 5 cited
Polynomial-Time Pseudodeterministic Construction of Primes
arXiv (Cornell University)·2023· 1 citedOpen Access
page 1 of 6Next →

Frequent Co-authors

Ryan Williams(7), Roei Tell(7), Ruosong Wang(6), Mingda Qiao(5), Rahul Santhanam(5), Shuichi Hirahara(4), Gillat Kol(4), Dmitry Paramonov(4), Raghuvansh R. Saxena(4), Huacheng Yu(4), Hanlin Ren(4), Jian Li(3), Ce Jin(3), Ján Pich(3), Ninad Rajgopal(3), Zhao Song(3), Ron D. Rothblum(3), Ran Duan(3), Hanrui Zhang(3), Josh Alman(2)