Publication

Preprint:

Shuo Wang, Guangxu Yang and Jiapeng Zhang. Communication Complexity of Set-Intersection Problems and Its Applications. (ECCC).

2024:

Noam Mazor and Jiapeng Zhang. Simple constructions from (almost) regular one-way functions. (the Journal of Cryptology 2024; TCC 2021 best young researcher paper). 

Guangxu Yang and Jiapeng Zhang. Communication Lower Bounds for Collision Problems via Density Increment Arguments. (STOC 2024).

Mark Braverman, Sumegha Garg, Qian Li, Shuo Wang, David Woodruff and Jiapeng Zhang. A New Information Complexity Measure for Multi-Pass Streaming. (STOC 2024).

Kai-Min Chung, Mi-Ying Huang, Er-Cheng Tang and Jiapeng Zhang. Best-of-Both-Worlds Multiparty Quantum Computation with Public Verifiable Indentifiable Abort. (Eurocrypto 2024)

Chandra Sekhar Mukherjee and Jiapeng Zhang. Detecting Hidden Communities by Power Iterations with Connections to Vanilla Spectral Algorithms. (SODA 2024)

2023:

Xinyu Mao and Jiapeng Zhang. On the Power of SVD in the Stochastic Block Model. (NeurIPS 2023).

Chandra Sekhar Mukherjee, Pan Peng and Jiapeng Zhang. Recovering Unbalanced Communities in the SBM with Application to Clustering with a Faulty Oracle. (NeurIPS 2023).

Mi-Ying Huang, Xinyu Mao, Guangxu Yang and Jiapeng Zhang. Communication Lower Bounds of Key-Agreement Protocols via Density Increment Arguments. (TCC 2023).

Shachar Lovett and Jiapeng Zhang. Streaming Lower Bounds and Asymmetric Set-Disjointness. (FOCS 2023)

Xinyu Mao, Noam Mazor and Jiapeng Zhang. Non-Adaptive Universal One-Way Hash Functions from Arbitrary One-Way Functions. (Eurocrypt 2023)

Shachar Lovett and Jiapeng Zhang. Fractional certificates for bounded functions. (ITCS 2023)

2022:

Xin Li, Shachar Lovett and Jiapeng Zhang. Sunflower and Quasi-sunflowers from Randomness Extractors. (Theory of Computing 2022; RANDOM 2018)

Shachar Lovett, Raghu Meka, Ian Mertz, Toniann Pitassi and Jiapeng Zhang. Lifting with Sunflowers. (ITCS 2022)

2021:

Siyao Guo, Qian Li, Qipeng Liu and Jiapeng Zhang. Unifying Presampling via Concentration Bounds. (TCC 2021)

Pan Peng and Jiapeng Zhang. Towards a Query-Optimal and Time-Efficient Algorithm for Clustering with a Faulty Oracle. (COLT 2021)

2020:

Ryan Alweiss, Shachar Lovett, Kewen Wu and Jiapeng Zhang. Improved bounds for the sunflower lemma. (STOC 2020 best paper; the Annals of Mathematics 2021)

Shachar Lovett, Kewen Wu and Jiapeng Zhang. Decision list compression by mild random restrictions. (STOC 2020; the Journal of ACM 2021)

2019:

Shachar Lovett, Noam Solomon and Jiapeng Zhang. From DNF compression to sunflower theorems via regularity. (CCC 2019)

Shachar Lovett and Jiapeng Zhang. DNF sparsification beyond sunflowers. (STOC 2019)

Kun He, Qian Li, Xiaoming Sun and Jiapeng Zhang. Quantum Lovász Local Lemma: Shearer's Bound is Tight. (STOC 2019)

2018:

Yi-Hsiu Chen, Mika Göös, Salil Vadhan and Jiapeng Zhang. A Tight Lower Bound for Entropy Flattening. (CCC 2018)

Shachar Lovett, Avishay Tal and Jiapeng Zhang. The Robust Sensitivity of Boolean Functions. (SODA 2018)

2017:

Shachar Lovett and Jiapeng Zhang. On the impossibility of entropy reversal, and its application to zero-knowledge proofs. (TCC 2017)

Bo Tang and Jiapeng Zhang. Barriers to Black-Box Constructions of Traitor Tracing Systems. (TCC 2017)

Daniel Kane, Shachar Lovett, Shay Moran and Jiapeng Zhang. Active classification with comparison queries. (FOCS 2017)

Shachar Lovett and Jiapeng Zhang. Noisy Population Recovery from Unknown Noise. (COLT 2017)

2015:

Shachar Lovett and Jiapeng Zhang. Improved noisy population recovery, and reverse Bonami-Becker inequality for sparse functions. (STOC 2015)

2011:

Jiapeng Zhang. On the query complexity for Showing Dense Model. (ECCC 2011)