Improved bounds for the sunflower lemma. - Ryan Alweiss; Shachar Lovett; Kewen Wu 001; Jiapeng Zhang (Electron. Colloquium Comput. Complex., 2019)

Decision list compression by mild random restrictions. - Shachar Lovett; Kewen Wu 001; Jiapeng Zhang (Electron. Colloquium Comput. Complex., 2019)

A Note on Lower Digits Extraction Polynomial for Bootstrapping. - Mingjia Huo; Kewen Wu 001; Qi Ye (IACR Cryptol. ePrint Arch., 2019)

On the Degree of Boolean Functions as Polynomials over ℤm. - Xiaoming Sun 001; Yuan Sun 007; Jiaheng Wang 002; Kewen Wu 001; Zhiyu Xia; Yufan Zheng (ICALP, 2020)

Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic Synthesis. - Jiaqing Jiang; Xiaoming Sun 001; Shang-Hua Teng; Bujiao Wu; Kewen Wu 001; Jialin Zhang 001 (SODA, 2020)

An Improved Sketching Bound for Edit Distance. - Ce Jin 001; Jelani Nelson; Kewen Wu 001 (CoRR, 2020)

Structured Decomposition for Reversible Boolean Functions. - Jiaqing Jiang; Xiaoming Sun 001; Yuan Sun 007; Kewen Wu 001; Zhiyu Xia (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2020)

An Improved Sketching Algorithm for Edit Distance. - Ce Jin 001; Jelani Nelson; Kewen Wu 001 (STACS, 2021)

Perfect Sampling for (Atomic) Lovász Local Lemma. - Kun He 011; Xiaoming Sun 001; Kewen Wu 001 (CoRR, 2021)

Fourier Growth of Parity Decision Trees. - Uma Girish; Avishay Tal; Kewen Wu 001 (Electron. Colloquium Comput. Complex., 2021)

On the relationship between energy complexity and other boolean function measures. - Xiaoming Sun 001; Yuan Sun 007; Kewen Wu 001; Zhiyu Xia (J. Comb. Optim., 2022)

Fourier Growth of Communication Protocols for XOR Functions. - Uma Girish; Makrand Sinha; Avishay Tal; Kewen Wu 001 (FOCS, 2023)

On Differentially Private Counting on Trees. - Badih Ghazi; Pritish Kamath; Ravi Kumar 001; Pasin Manurangsi; Kewen Wu 001 (ICALP, 2023)

Improved Bounds for Sampling Solutions of Random CNF Formulas. - Kun He 011; Kewen Wu 001; Kuan Yang 001 (SODA, 2023)

Parameterized Inapproximability Hypothesis under ETH. - Venkatesan Guruswami; Bingkai Lin; Xuandi Ren; Yican Sun; Kewen Wu 001 (Electron. Colloquium Comput. Complex., 2023)

The Power of Adaptivity in Quantum Query Algorithms. - Uma Girish; Makrand Sinha; Avishay Tal; Kewen Wu 001 (STOC, 2024)

Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis. - Venkatesan Guruswami; Bingkai Lin; Xuandi Ren; Yican Sun; Kewen Wu 001 (STOC, 2024)

Locally Sampleable Uniform Symmetric Distributions. - Daniel Kane 001; Anthony Ostuni; Kewen Wu 001 (Electron. Colloquium Comput. Complex., 2024)

Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH. - Venkatesan Guruswami; Bingkai Lin; Xuandi Ren; Yican Sun; Kewen Wu 001 (Electron. Colloquium Comput. Complex., 2024)

Locality Bounds for Sampling Hamming Slices. - Daniel M. Kane; Anthony Ostuni; Kewen Wu 001 (Electron. Colloquium Comput. Complex., 2024)

Tight Characterizations for Preprocessing against Cryptographic Salting. - Fangqi Dong; Qipeng Liu 001; Kewen Wu 001 (IACR Cryptol. ePrint Arch., 2024)

(Sub)Exponential Quantum Speedup for Optimization. - Jiaqi Leng; Kewen Wu 001; Xiaodi Wu 001; Yufan Zheng (CoRR, 2025)

Sunflowers and Ramsey problems for restricted intersections. - Barnabás Janzer; Zhihan Jin; Benny Sudakov; Kewen Wu 001 (CoRR, 2025)

PCPP-Based Reconfiguration Inapproximability: Query Complexity vs. Soundness Gap Trade-offs. - Venkatesan Guruswami; Xuandi Ren; Kewen Wu 001 (CoRR, 2025)