default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKewen Wu 0001
Person information
- affiliation: University of California at Berkeley, CA, USA
- affiliation (former): Peking University, Beijing, China
- unicode name: 吴克文
Other persons with the same name
- Kewen Wu 0002 — University of Saskatchewan, Canada (and 1 more)
- Kewen Wu 0003 — Alibaba Group, China
- Kewen Wu 0004 — Tsinghua University, China
- Kewen Wu 0005 — Carnegie Mellon University, Pittsburgh, PA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c14]Fangqi Dong, Qipeng Liu
, Kewen Wu:
Tight Characterizations for Preprocessing Against Cryptographic Salting. CRYPTO (4) 2024: 377-411- [c13]Venkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun, Kewen Wu:
Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis. STOC 2024: 24-35 - [c12]Daniel M. Kane, Anthony Ostuni, Kewen Wu:
Locality Bounds for Sampling Hamming Slices. STOC 2024: 1279-1286 - [c11]Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu:
The Power of Adaptivity in Quantum Query Algorithms. STOC 2024: 1488-1497 - [i27]Daniel M. Kane, Anthony Ostuni, Kewen Wu:
Locality Bounds for Sampling Hamming Slices. CoRR abs/2402.14278 (2024) - [i26]Venkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun, Kewen Wu:
Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH. CoRR abs/2404.08870 (2024) - [i25]Fangqi Dong, Qipeng Liu, Kewen Wu:
Tight Characterizations for Preprocessing against Cryptographic Salting. CoRR abs/2405.20281 (2024) - [i24]Daniel Kane, Anthony Ostuni, Kewen Wu:
Locally Sampleable Uniform Symmetric Distributions. Electron. Colloquium Comput. Complex. TR24 (2024) - [i23]Venkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun, Kewen Wu:
Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH. Electron. Colloquium Comput. Complex. TR24 (2024) - [i22]Daniel M. Kane, Anthony Ostuni, Kewen Wu:
Locality Bounds for Sampling Hamming Slices. Electron. Colloquium Comput. Complex. TR24 (2024) - [i21]Fangqi Dong, Qipeng Liu, Kewen Wu:
Tight Characterizations for Preprocessing against Cryptographic Salting. IACR Cryptol. ePrint Arch. 2024: 831 (2024) - 2023
- [c10]Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu:
Fourier Growth of Communication Protocols for XOR Functions. FOCS 2023: 721-732 - [c9]Badih Ghazi, Pritish Kamath, Ravi Kumar, Pasin Manurangsi, Kewen Wu:
On Differentially Private Counting on Trees. ICALP 2023: 66:1-66:18 - [c8]Kun He, Kewen Wu, Kuan Yang:
Improved Bounds for Sampling Solutions of Random CNF Formulas. SODA 2023: 3330-3361 - [i20]Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu:
Fourier Growth of Communication Protocols for XOR Functions. CoRR abs/2307.13926 (2023) - [i19]Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu:
The Power of Adaptivity in Quantum Query Algorithms. CoRR abs/2311.16057 (2023) - [i18]Venkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun, Kewen Wu:
Parameterized Inapproximability Hypothesis under ETH. CoRR abs/2311.16587 (2023) - [i17]Venkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun, Kewen Wu:
Parameterized Inapproximability Hypothesis under ETH. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j3]Xiaoming Sun, Yuan Sun, Kewen Wu, Zhiyu Xia:
On the relationship between energy complexity and other boolean function measures. J. Comb. Optim. 43(5): 1470-1492 (2022) - [i16]Kun He, Kewen Wu, Kuan Yang:
Improved Bounds for Sampling Solutions of Random CNF Formulas. CoRR abs/2207.11892 (2022) - [i15]Badih Ghazi, Pritish Kamath, Ravi Kumar, Pasin Manurangsi, Kewen Wu:
On Differentially Private Counting on Trees. CoRR abs/2212.11967 (2022) - 2021
- [j2]Shachar Lovett, Kewen Wu, Jiapeng Zhang:
Decision List Compression by Mild Random Restrictions. J. ACM 68(6): 45:1-45:17 (2021) - [c7]Uma Girish, Avishay Tal, Kewen Wu:
Fourier Growth of Parity Decision Trees. CCC 2021: 39:1-39:36 - [c6]Ce Jin, Jelani Nelson, Kewen Wu:
An Improved Sketching Algorithm for Edit Distance. STACS 2021: 45:1-45:16 - [i14]Uma Girish, Avishay Tal, Kewen Wu:
Fourier Growth of Parity Decision Trees. CoRR abs/2103.11604 (2021) - [i13]Kun He, Xiaoming Sun, Kewen Wu:
Perfect Sampling for (Atomic) Lovász Local Lemma. CoRR abs/2107.03932 (2021) - [i12]Uma Girish, Avishay Tal, Kewen Wu:
Fourier Growth of Parity Decision Trees. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j1]Jiaqing Jiang, Xiaoming Sun, Yuan Sun, Kewen Wu, Zhiyu Xia:
Structured Decomposition for Reversible Boolean Functions. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 39(10): 2410-2421 (2020) - [c5]Xiaoming Sun, Yuan Sun, Jiaheng Wang, Kewen Wu, Zhiyu Xia, Yufan Zheng:
On the Degree of Boolean Functions as Polynomials over ℤm. ICALP 2020: 100:1-100:19 - [c4]Jiaqing Jiang, Xiaoming Sun, Shang-Hua Teng, Bujiao Wu, Kewen Wu, Jialin Zhang:
Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic Synthesis. SODA 2020: 213-229 - [c3]Shachar Lovett, Kewen Wu, Jiapeng Zhang:
Decision list compression by mild random restrictions. STOC 2020: 247-254 - [c2]Ryan Alweiss, Shachar Lovett, Kewen Wu, Jiapeng Zhang:
Improved bounds for the sunflower lemma. STOC 2020: 624-630 - [i11]Ce Jin, Jelani Nelson, Kewen Wu:
An Improved Sketching Bound for Edit Distance. CoRR abs/2010.13170 (2020)
2010 – 2019
- 2019
- [c1]Xiaoming Sun, Yuan Sun, Kewen Wu, Zhiyu Xia:
On the Relationship Between Energy Complexity and Other Boolean Function Measures. COCOON 2019: 516-528 - [i10]Mingjia Huo, Kewen Wu, Qi Ye:
A Note on Lower Digits Extraction Polynomial for Bootstrapping. CoRR abs/1906.02867 (2019) - [i9]Jiaqing Jiang, Xiaoming Sun, Shang-Hua Teng, Bujiao Wu, Kewen Wu, Jialin Zhang:
Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic Synthesis. CoRR abs/1907.05087 (2019) - [i8]Ryan Alweiss, Shachar Lovett, Kewen Wu, Jiapeng Zhang:
Improved bounds for the sunflower lemma. CoRR abs/1908.08483 (2019) - [i7]Shachar Lovett, Kewen Wu, Jiapeng Zhang:
Decision list compression by mild random restrictions. CoRR abs/1909.10658 (2019) - [i6]Xiaoming Sun, Yuan Sun, Jiaheng Wang, Kewen Wu, Zhiyu Xia, Yufan Zheng:
On the Degree of Boolean Functions as Polynomials over Zm. CoRR abs/1910.12458 (2019) - [i5]Ryan Alweiss, Shachar Lovett, Kewen Wu, Jiapeng Zhang:
Improved bounds for the sunflower lemma. Electron. Colloquium Comput. Complex. TR19 (2019) - [i4]Shachar Lovett, Kewen Wu, Jiapeng Zhang:
Decision list compression by mild random restrictions. Electron. Colloquium Comput. Complex. TR19 (2019) - [i3]Mingjia Huo, Kewen Wu, Qi Ye:
A Note on Lower Digits Extraction Polynomial for Bootstrapping. IACR Cryptol. ePrint Arch. 2019: 677 (2019) - 2018
- [i2]Xiaoming Sun, Yuan Sun, Kewen Wu, Zhiyu Xia:
On the Relationship between Energy Complexity and Other Boolean Function Measures. CoRR abs/1810.03811 (2018) - [i1]Jiaqing Jiang, Xiaoming Sun, Yuan Sun, Kewen Wu, Zhiyu Xia:
Structured decomposition for reversible Boolean functions. CoRR abs/1810.04279 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-18 19:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
