| Log-rank and lifting for AND-functions A Knop, S Lovett, S McGuire, W Yuan Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 18 | 2021 |
| The exact bipartite matching polytope has exponential extension complexity X Jia, O Svensson, W Yuan Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 6 | 2023 |
| Lower Bounds for Unambiguous Automata via Communication Complexity M Göös, S Kiefer, W Yuan arXiv preprint arXiv:2109.09155, 2021 | 6 | 2021 |
| Guest column: Models of computation between decision trees and communication A Knop, S Lovett, S McGuire, W Yuan ACM SIGACT News 52 (2), 46-70, 2021 | 5 | 2021 |
| One-Way Functions vs. TFNP: Simpler and Improved L Folwarczný, M Göös, P Hubáček, G Maystre, W Yuan Cryptology ePrint Archive, 2023 | | 2023 |
Shachar LovettAssociate Professor of Computer Science, University of California San DiegoVerified email at eng.ucsd.edu
