- Timothy Y. Chow, 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 2008, 86
- Benoît Libert, Damien Stehlé, Radu Titiu, 11240, Theory of Cryptography, 2018, 391
- Moni Naor, Omer Reingold, “Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions”, Journal of Computer and System Sciences, 58, no. 2, 1999, 336
- Arjun Kar, “Non-isometric quantum error correction in gravity”, J. High Energ. Phys., 2023, no. 2, 2023, 195
- Pooya Hatami, William M. Hoza, Avishay Tal, Roei Tell, 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), 2022, 104
- Eric Allender, 2245, FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001, 1
- Lijie Chen, Hanlin Ren, Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, 1327
- Russell Impagliazzo, Avi Wigderson, “Randomness vs Time: Derandomization under a Uniform Assumption”, Journal of Computer and System Sciences, 63, no. 4, 2001, 672
- Yael Tauman Kalai, Guy N. Rothblum, Ron D. Rothblum, 10402, Advances in Cryptology – CRYPTO 2017, 2017, 224
- Ronen Shaltiel, Emanuele Viola, “Hardness Amplification Proofs Require Majority”, SIAM J. Comput., 39, no. 7, 2010, 3122