- Rahul Santhanam, Iddo Tzameret, Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021, 234
- S. Aaronson, 21st Annual IEEE Conference on Computational Complexity (CCC'06), 2006, 340
- Matthias Krause, Stefan Lucks, 2010, STACS 2001, 2001, 419
- Sang-Un Lee, “A 2kβ Algorithm for Euler function 𝜙(n) Decryption of RSA”, Journal of the Korea Society of Computer and Information, 19, № 7, 2014, 71
- Johan Håstad, “On the Correlation of Parity and Small-Depth Circuits”, SIAM J. Comput., 43, № 5, 2014, 1699
- Md. Helal Ahmed, Jagmohan Tanti, Sumant Pushp, Coding Theory - Recent Advances, New Perspectives and Applications, 2022
- Ketan D. Mulmuley, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 2012, 629
- Eyal Kushilevitz, Enav Weinreb, Proceedings of the forty-first annual ACM symposium on Theory of computing, 2009, 465
- Tom Gur, Mohammad Mahdi Jahanara, Mohammad Mahdi Khodabandeh, Ninad Rajgopal, Bahar Salamatian, Igor Shinkar, Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024, 1063
- Yilei Chen, Jiatu Li, Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024, 620