- Gábor Braun, Samuel Fiorini, Sebastian Pokutta, “Average case polyhedral complexity of the maximum stable set problem”, Math. Program., 160, no. 1-2, 2016, 407
- Arkadev Chattopadhyay, Nikhil S. Mande, Suhail Sherif, “The Log-Approximate-Rank Conjecture Is False”, J. ACM, 67, no. 4, 2020, 1
- JOZEF GRUSKA, DAOWEN QIU, SHENGGEN ZHENG, “Generalizations of the distributed Deutsch–Jozsa promise problem”, Math. Struct. Comp. Sci., 27, no. 3, 2017, 311
- Gabor Braun, Samuel Fiorini, Sebastian Pokutta, David Steurer, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 2012, 480
- Dana Moshkovitz, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 2014, 414
- Sayantan Chakraborty, Upendra Kapshikar, 2023 IEEE International Symposium on Information Theory (ISIT), 2023, 761
- Elad Verbin, Wei Yu, 7922, Combinatorial Pattern Matching, 2013, 247
- Ryan ODonnell, John Wright, Yu Zhao, Xiaorui Sun, Li-Yang Tan, 2014 IEEE 29th Conference on Computational Complexity (CCC), 2014, 144
- Aleksandrs Belovs, Eric Blais, Proceedings of the forty-eighth annual ACM symposium on Theory of Computing, 2016, 1021
- Alexander A. Razborov, Alexander A. Sherstov, “The Sign-Rank of AC$^0$”, SIAM J. Comput., 39, no. 5, 2010, 1833