Kewen Wu

Orcid: 0000-0002-5894-822X

Affiliations:
  • University of California at Berkeley, CA, USA
  • Peking University, Beijing, China (former)


According to our database1, Kewen Wu authored at least 21 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Tight Characterizations for Preprocessing against Cryptographic Salting.
IACR Cryptol. ePrint Arch., 2024

Locality Bounds for Sampling Hamming Slices.
Electron. Colloquium Comput. Complex., 2024

Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH.
Electron. Colloquium Comput. Complex., 2024

Locally Sampleable Uniform Symmetric Distributions.
Electron. Colloquium Comput. Complex., 2024

Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

The Power of Adaptivity in Quantum Query Algorithms.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2023
Parameterized Inapproximability Hypothesis under ETH.
Electron. Colloquium Comput. Complex., 2023

Improved Bounds for Sampling Solutions of Random CNF Formulas.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

On Differentially Private Counting on Trees.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Fourier Growth of Communication Protocols for XOR Functions.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022
On the relationship between energy complexity and other boolean function measures.
J. Comb. Optim., 2022

2021
Fourier Growth of Parity Decision Trees.
Electron. Colloquium Comput. Complex., 2021

Perfect Sampling for (Atomic) Lovász Local Lemma.
CoRR, 2021

An Improved Sketching Algorithm for Edit Distance.
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

2020
Structured Decomposition for Reversible Boolean Functions.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2020

An Improved Sketching Bound for Edit Distance.
CoRR, 2020

Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic Synthesis.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

On the Degree of Boolean Functions as Polynomials over ℤ<sub>m</sub>.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019
A Note on Lower Digits Extraction Polynomial for Bootstrapping.
IACR Cryptol. ePrint Arch., 2019

Decision list compression by mild random restrictions.
Electron. Colloquium Comput. Complex., 2019

Improved bounds for the sunflower lemma.
Electron. Colloquium Comput. Complex., 2019


  Loading...