A Polynomial Restriction Lemma with Applications. - Valentine Kabanets; Daniel M. Kane; Zhenjian Lu (Electron. Colloquium Comput. Complex., 2017)

Nisan-Wigderson Pseudorandom Generators for Circuits with Polynomial Threshold Gates. - Valentine Kabanets; Zhenjian Lu (Electron. Colloquium Comput. Complex., 2018)

Satisfiability and Derandomization for Small Polynomial Threshold Circuits. - Valentine Kabanets; Zhenjian Lu (Electron. Colloquium Comput. Complex., 2018)

Circuit Lower Bounds for MCSP from Local Pseudorandom Generators. - Mahdi Cheraghchi; Valentine Kabanets; Zhenjian Lu; Dimitrios Myrisiotis (Electron. Colloquium Comput. Complex., 2019)

Algorithms and Lower Bounds for de Morgan Formulas of Low-Communication Leaf Gates. - Valentine Kabanets; Sajin Koroth; Zhenjian Lu; Dimitrios Myrisiotis; Igor C. Oliveira 001 (Electron. Colloquium Comput. Complex., 2020)

Majority vs. Approximate Linear Sum and Average-Case Complexity Below NC¹. - Lijie Chen 001; Zhenjian Lu; Xin Lyu 002; Igor C. Oliveira 001 (ICALP, 2021)

Algorithms and Lower Bounds for Comparator Circuits from Shrinkage. - Bruno Pasqualotto Cavalar; Zhenjian Lu (Electron. Colloquium Comput. Complex., 2021)

Majority vs. Approximate Linear Sum and Average-Case Complexity Below NC1. - Lijie Chen 001; Zhenjian Lu; Xin Lyu 002; Igor Carboni Oliveira (Electron. Colloquium Comput. Complex., 2021)

An Efficient Coding Theorem via Probabilistic Representations and its Applications. - Zhenjian Lu; Igor Carboni Oliveira (Electron. Colloquium Comput. Complex., 2021)

Pseudodeterministic Algorithms and the Structure of Probabilistic Time. - Zhenjian Lu; Igor Carboni Oliveira; Rahul Santhanam (Electron. Colloquium Comput. Complex., 2021)

Probabilistic Kolmogorov Complexity with Applications to Average-Case Complexity. - Halley Goldberg; Valentine Kabanets; Zhenjian Lu; Igor C. Oliveira 001 (Electron. Colloquium Comput. Complex., 2022)

Theory and Applications of Probabilistic Kolmogorov Complexity. - Zhenjian Lu; Igor C. Oliveira 001 (Electron. Colloquium Comput. Complex., 2022)

Optimal Coding Theorems in Time-Bounded Kolmogorov Complexity. - Zhenjian Lu; Igor Carboni Oliveira; Marius Zimand (Electron. Colloquium Comput. Complex., 2022)

Polynomial-Time Pseudodeterministic Construction of Primes. - Lijie Chen 001; Zhenjian Lu; Igor Carboni Oliveira; Hanlin Ren; Rahul Santhanam (Electron. Colloquium Comput. Complex., 2023)

A Duality Between One-Way Functions and Average-Case Symmetry of Information. - Shuichi Hirahara; Rahul Ilango; Zhenjian Lu; Mikito Nanashima; Igor Carboni Oliveira (Electron. Colloquium Comput. Complex., 2023)

Bounded Relativization. - Shuichi Hirahara; Zhenjian Lu; Hanlin Ren (Electron. Colloquium Comput. Complex., 2023)

Exact Search-to-Decision Reductions for Time-Bounded Kolmogorov Complexity. - Shuichi Hirahara; Valentine Kabanets; Zhenjian Lu; Igor C. Oliveira 001 (Electron. Colloquium Comput. Complex., 2024)

Optimal Coding for Randomized Kolmogorov Complexity and Its Applications. - Shuichi Hirahara; Zhenjian Lu; Mikito Nanashima (Electron. Colloquium Comput. Complex., 2024)

One-Way Functions and pKt Complexity. - Shuichi Hirahara; Zhenjian Lu; Igor C. Oliveira 001 (Electron. Colloquium Comput. Complex., 2024)

Lower Bounds on the Overhead of Indistinguishability Obfuscation. - Zhenjian Lu; Noam Mazor; Igor C. Oliveira 001; Rafael Pass (Electron. Colloquium Comput. Complex., 2024)

On the Complexity of Avoiding Heavy Elements. - Zhenjian Lu; Igor C. Oliveira 001; Hanlin Ren; Rahul Santhanam (Electron. Colloquium Comput. Complex., 2024)

Impagliazzo's Worlds Through the Lens of Conditional Kolmogorov Complexity. - Zhenjian Lu; Rahul Santhanam (Electron. Colloquium Comput. Complex., 2024)