关注
Kewen Wu
Kewen Wu
在 berkeley.edu 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
Improved bounds for the sunflower lemma
R Alweiss, S Lovett, K Wu, J Zhang
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
1152020
Optimal space-depth trade-off of CNOT circuits in quantum logic synthesis
J Jiang, X Sun, SH Teng, B Wu, K Wu, J Zhang
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
312020
Perfect sampling for (atomic) lov\'asz local lemma
K He, X Sun, K Wu
arXiv preprint arXiv:2107.03932, 2021
152021
Fourier growth of parity decision trees
U Girish, A Tal, K Wu
arXiv preprint arXiv:2103.11604, 2021
152021
Improved bounds for sampling solutions of random CNF formulas
K He, K Wu, K Yang
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
112023
An improved sketching algorithm for edit distance
C Jin, J Nelson, K Wu
arXiv preprint arXiv:2010.13170, 2020
82020
On the relationship between energy complexity and other boolean function measures
X Sun, Y Sun, K Wu, Z Xia
International Computing and Combinatorics Conference, 516-528, 2019
52019
Decision list compression by mild random restrictions
S Lovett, K Wu, J Zhang
Journal of the ACM (JACM) 68 (6), 1-17, 2021
42021
On differentially private counting on trees
B Ghazi, P Kamath, R Kumar, P Manurangsi, K Wu
arXiv preprint arXiv:2212.11967, 2022
32022
Structured decomposition for reversible Boolean functions
J Jiang, X Sun, Y Sun, K Wu, Z Xia
IEEE Transactions on Computer-Aided Design of Integrated Circuits and …, 2019
32019
Parameterized Inapproximability Hypothesis under ETH
V Guruswami, B Lin, X Ren, Y Sun, K Wu
arXiv preprint arXiv:2311.16587, 2023
22023
Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH
V Guruswami, B Lin, X Ren, Y Sun, K Wu
arXiv preprint arXiv:2404.08870, 2024
12024
Fourier Growth of Communication Protocols for XOR Functions
U Girish, M Sinha, A Tal, K Wu
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023
12023
A Note on Lower Digits Extraction Polynomial for Bootstrapping
M Huo, K Wu, Q Ye
arXiv preprint arXiv:1906.02867, 2019
12019
Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis
V Guruswami, B Lin, X Ren, Y Sun, K Wu
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 24-35, 2024
2024
Locality Bounds for Sampling Hamming Slices
DM Kane, A Ostuni, K Wu
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 1279-1286, 2024
2024
Tight Characterizations for Preprocessing against Cryptographic Salting
F Dong, Q Liu, K Wu
arXiv preprint arXiv:2405.20281, 2024
2024
The Power of Adaptivity in Quantum Query Algorithms
U Girish, M Sinha, A Tal, K Wu
arXiv preprint arXiv:2311.16057, 2023
2023
On the generalized shuffle-exchange problem
X Sun, Y Sun, K Wu, Z Xia
Pure and Applied Mathematics Quarterly 18 (6), 2619-2645, 2022
2022
On the Degree of Boolean Functions as Polynomials over ℤ_m
X Sun, Y Sun, J Wang, K Wu, Z Xia, Y Zheng
47th International Colloquium on Automata, Languages, and Programming (ICALP …, 2020
2020
系统目前无法执行此操作,请稍后再试。
文章 1–20