- Boaz Barak, Mark Braverman, Xi Chen, Anup Rao, Proceedings of the forty-second ACM symposium on Theory of computing, 2010, 67
- Michael Saks, Xiaodong Sun, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, 2002, 360
- Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli, 271, Integer Programming, 2014, 1
- Amir Abboud, Keren Censor-Hillel, Seri Khoury, Ami Paz, “Smaller Cuts, Higher Lower Bounds”, ACM Trans. Algorithms, 17, no. 4, 2021, 1
- Taisuke IZUMI, “A Concise Tour of Communication Complexity Theory”, Fundamentals Review, 10, no. 1, 2016, 46
- T.S. Jayram, Swastik Kopparty, Prasad Raghavendra, 2009 24th Annual IEEE Conference on Computational Complexity, 2009, 329
- Lijie Chen, Roei Tell, Ryan Williams, 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2023, 1008
- Alexander A. Sherstov, 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 2008, 384
- Mika Goos, Toniann Pitassi, Thomas Watson, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), 2017, 132
- Eyal Kushilevitz, 44, 1997, 331