Journal Articles
- Alexander Sherstov, Andrey Storozhenko and Pei Wu, 2023, "An Optimal Separation of Randomized and Quantum Query Complexity", SIAM Journal on Computing, 52, (2)
- Alexander Sherstov and Pei Wu, 2023, "Near-Optimal Lower Bounds on the Threshold Degree and Sign-rank of AC0", SIAM Journal of Computing, 52, (2)
- Alexander Sherstov and Pei Wu, 2019, "Optimal Interactive Coding for Insertions, Deletions, and Substitutions", IEEE Transactions on Information Theory, 65, (10)
Conference Proceedings
- Fernando Granha Jeronimo and Pei Wu, 2024, "Dimension Independent Disentanglers from Unentanglement and Applications", CCC
- Ronen Eldan, Avi Wigderson and Pei Wu, 2023, "An Optimal “It Ain’t Over till It’s Over” Theorem", Proceedings of the 55th Symposium on Theory of Computing
- Fernando Granha Jeronimo and Pei Wu, 2023, "The Power of Unentangled Proofs with Non-negative Amplitudes", STOC
- Alexander Sherstov, Andrey Storozhenko and Pei Wu, 2021, "An Optimal Separation of Randomized and Quantum Query Complexity", Proceedings of the 53rd Annual ACM Symposium on Theory of Computing
- Alexander Sherstov and Pei Wu, 2019, "Near-Optimal Lower Bounds on the Threshold Degree and Sign-rank of AC0", Proceedings of the 51st Annual ACM Symposium on Theory of Computing
- Alexander Sherstov and Pei Wu, 2017, "Optimal Interactive Coding for Insertions, Deletions, and Substitutions", Proceedings of the IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
