- Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli, 271, Integer Programming, 2014, 321
- Fabian Kuhn, Rotem Oshman, 6950, Distributed Computing, 2011, 416
- Yi Li, David P. Woodruff, Proceedings of the forty-eighth annual ACM symposium on Theory of Computing, 2016, 726
- Sophie Laplante, Mathieu Laurière, Alexandre Nolin, Jérémie Roland, Gabriel Senno, “Robust Bell inequalities from communication complexity”, Quantum, 2, 2018, 72
- Anat Ganor, Gillat Kol, Ran Raz, Proceedings of the forty-eighth annual ACM symposium on Theory of Computing, 2016, 977
- Dror Chawin, Iftach Haitner, Noam Mazor, 12552, Theory of Cryptography, 2020, 305
- Karthik C. S., Bundit Laekhanukit, Pasin Manurangsi, Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018, 1283
- Yuval Filmus, Hamed Hatami, Yaqiao Li, Suzin You, “Information Complexity of the AND Function in the Two-Party and Multi-party Settings”, Algorithmica, 81, no. 11-12, 2019, 4200
- Paul Beame, T. S. Jayram, Atri Rudra, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, 2007, 689
- Juraj Hromkovič, Georg Schnitger, 1295, Mathematical Foundations of Computer Science 1997, 1997, 71