Zhenjian Lu

University of Warwick — United Kingdom

Computer Science · Physical Sciences

4h-index40citations22works0.02yr 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(13), Computability, Logic, AI Algorithms(9), Cryptography and Data Security(8), Machine Learning and Algorithms(8), Algorithms and Data Compression(4)

Publications22 total

One-Way Functions and pKt Complexity
Lecture notes in computer science·2024
Optimal Coding for Randomized Kolmogorov Complexity and Its Applications
2024
On the Complexity of Avoiding Heavy Elements
2024
Optimal Coding for Randomized Kolmogorov Complexity and Its Applications
arXiv (Cornell University)·2024Open Access
Polynomial-Time Pseudodeterministic Construction of Primes
2023· 6 cited
Polynomial-Time Pseudodeterministic Construction of Primes
arXiv (Cornell University)·2023· 1 citedOpen Access
A Duality between One-Way Functions and Average-Case Symmetry of Information
2023· 9 cited
Algorithms and Lower Bounds for Comparator Circuits from Shrinkage
Algorithmica·2023Open Access
Theory and Applications of Probabilistic Kolmogorov Complexity
arXiv (Cornell University)·2022· 1 citedOpen Access
Optimal Coding Theorems in Time-Bounded Kolmogorov Complexity
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2022· 2 citedOpen Access
Algorithms and Lower Bounds for Comparator Circuits from Shrinkage
arXiv (Cornell University)·2021Open Access
Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates
ACM Transactions on Computation Theory·2021· 1 citedOpen Access
Pseudodeterministic algorithms and the structure of probabilistic time
2021· 1 citedOpen Access
Majority vs. Approximate Linear Sum and Average-Case Complexity Below NC¹
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2021· 1 citedOpen Access
An Efficient Coding Theorem via Probabilistic Representations and Its Applications
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2021· 2 citedOpen Access
Pseudodeterministic algorithms and the structure of probabilistic time
Warwick Research Archive Portal (University of Warwick)·2021· 9 cited
Algorithms and Lower Bounds in Circuit Complexity
Summit (Simon Fraser University)·2020Open Access
Circuit Lower Bounds for MCSP from Local Pseudorandom Generators
ACM Transactions on Computation Theory·2020· 2 cited
Algorithms and Lower Bounds for de Morgan Formulas of Low-Communication\n Leaf Gates
arXiv (Cornell University)·2020Open Access
Satisfiability and Derandomization for Small Polynomial Threshold Circuits
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2018· 4 citedOpen Access
page 1 of 2Next →

Frequent Co-authors

Igor Carboni Oliveira(9), Valentine Kabanets(6), Rahul Santhanam(5), Shuichi Hirahara(4), Mikito Nanashima(3), Lijie Chen(3), Hanlin Ren(3), Dimitrios Myrisiotis(3), Igor C. Oliveira(2), Sajin Koroth(2), Igor Oliveira(2), Bruno Pasqualotto Cavalar(2), Rahul Ilango(1), Marius Zimand(1), Mahdi Cheraghchi(1), Daniel M. Kane(1), Xin Lyu(1)