Almost-Everywhere Circuit Lower Bounds from Non-Trivial Derandomization. - Lijie Chen 001; Xin Lyu 002; Ryan Williams 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)

Inverse-Exponential Correlation Bounds and Extremely Rigid Matrices from a New Derandomized XOR Lemma. - Lijie Chen 001; Xin Lyu 002 (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)

Improved Pseudorandom Generators for AC⁰ Circuits. - Xin Lyu 002 (CCC, 2022)

On the Robustness of CountSketch to Adaptive Inputs. - Edith Cohen; Xin Lyu 002; Jelani Nelson; Tamás Sarlós; Moshe Shechner; Uri Stemmer (ICML, 2022)

Improved Pseudorandom Generators for AC0 Circuits. - Xin Lyu 002 (Electron. Colloquium Comput. Complex., 2022)

Tight Time-Space Lower Bounds for Constant-Pass Learning. - Xin Lyu 002; Avishay Tal; Hongxun Wu; Junzhao Yang (FOCS, 2023)

New PRGs for Unbounded-Width/Adaptive-Order Read-Once Branching Programs. - Lijie Chen 001; Xin Lyu 002; Avishay Tal; Hongxun Wu (ICALP, 2023)

Generalized Private Selection and Testing with High Confidence. - Edith Cohen; Xin Lyu 002; Jelani Nelson; Tamás Sarlós; Uri Stemmer (ITCS, 2023)

The Target-Charging Technique for Privacy Analysis across Interactive Computations. - Edith Cohen; Xin Lyu 002 (NeurIPS, 2023)

Optimal Differentially Private Learning of Thresholds and Quasi-Concave Optimization. - Edith Cohen; Xin Lyu 002; Jelani Nelson; Tamás Sarlós; Uri Stemmer (STOC, 2023)

The Target-Charging Technique for Privacy Accounting across Interactive Computations. - Edith Cohen; Xin Lyu 002 (CoRR, 2023)

Hot PATE: Private Aggregation of Distributions for Diverse Task. - Edith Cohen; Xin Lyu 002; Jelani Nelson; Tamás Sarlós; Uri Stemmer (CoRR, 2023)

Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting. - Lijie Chen 001; William Hoza; Xin Lyu 002; Avishay Tal; Hongxun Wu (Electron. Colloquium Comput. Complex., 2023)

The Cost of Parallelizing Boosting. - Xin Lyu 002; Hongxun Wu; Junzhao Yang (SODA, 2024)

Lower Bounds for Differential Privacy Under Continual Observation and Online Threshold Queries. - Edith Cohen; Xin Lyu 002; Jelani Nelson; Tamás Sarlós; Uri Stemmer (IACR Cryptol. ePrint Arch., 2024)