| Experimental microdissection enables functional harmonisation of pancreatic cancer subtypes C Maurer, SR Holmstrom, J He, P Laise, T Su, A Ahmed, H Hibshoosh, ... Gut 68 (6), 1034-1043, 2019 | 191 | 2019 |
| 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 | 118 | 2020 |
| Active classification with comparison queries DM Kane, S Lovett, S Moran, J Zhang 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017 | 76 | 2017 |
| Lifting with sunflowers S Lovett, R Meka, I Mertz, T Pitassi, J Zhang Leibniz international proceedings in informatics 215, 2022 | 25 | 2022 |
| On the impossibility of entropy reversal, and its application to zero-knowledge proofs S Lovett, J Zhang Theory of Cryptography: 15th International Conference, TCC 2017, Baltimore …, 2017 | 18 | 2017 |
| Improved noisy population recovery, and reverse Bonami-Beckner inequality for sparse functions S Lovett, J Zhang Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015 | 16 | 2015 |
| Unifying presampling via concentration bounds S Guo, Q Li, Q Liu, J Zhang Theory of Cryptography Conference, 177-208, 2021 | 14 | 2021 |
| On the query complexity for showing dense model J Zhang Electronic Colloquium on Computational Complexity (ECCC) 18, 38, 2011 | 13 | 2011 |
| DNF sparsification beyond sunflowers S Lovett, J Zhang Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 12 | 2019 |
| Sunflowers and Robust Sunflowers from Randomness Extractors X Li, S Lovett, J Zhang Theory of computing 18, 2022 | 11* | 2022 |
| Recovering unbalanced communities in the stochastic block model with application to clustering with a faulty oracle CS Mukherjee, P Peng, J Zhang Advances in Neural Information Processing Systems 36, 2024 | 8 | 2024 |
| Quantum Lovász local lemma: Shearer’s bound is tight K He, Q Li, X Sun, J Zhang Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 8 | 2019 |
| From dnf compression to sunflower theorems via regularity S Lovett, N Solomon, J Zhang arXiv preprint arXiv:1903.00580, 2019 | 8 | 2019 |
| Towards a query-optimal and time-efficient algorithm for clustering with a faulty oracle P Peng, J Zhang Conference on Learning Theory, 3662-3680, 2021 | 7 | 2021 |
| The Robust Sensitivity of Boolean Functions S Lovett, A Tal, J Zhang Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 6* | 2018 |
| Compressibility: Power of pca in clustering problems beyond dimensionality reduction CS Mukherjee, J Zhang arXiv preprint arXiv:2204.10888, 2022 | 5 | 2022 |
| Transcriptional deconvolution reveals consistent functional subtypes of pancreatic cancer epithelium and stroma J He, HC Maurer, SR Holmstrom, T Su, A Ahmed, H Hibshoosh, ... bioRxiv, 288779, 2018 | 5 | 2018 |
| Barriers to black-box constructions of traitor tracing systems B Tang, J Zhang Theory of Cryptography Conference, 3-30, 2017 | 5 | 2017 |
| Decision list compression by mild random restrictions S Lovett, K Wu, J Zhang Journal of the ACM (JACM) 68 (6), 1-17, 2021 | 4 | 2021 |
| Noisy population recovery from unknown noise S Lovett, J Zhang Conference on Learning Theory, 1417-1431, 2017 | 4 | 2017 |
Shachar LovettAssociate Professor of Computer Science, University of California San Diego在 eng.ucsd.edu 的电子邮件经过验证
