| 2020 | ICLR | Quantum Algorithms for Deep Convolutional Neural Networks. | Iordanis Kerenidis, Jonas Landman, Anupam Prakash |
| 2020 | ICML | Quantum Expectation-Maximization for Gaussian mixture models. | Iordanis Kerenidis, Alessandro Luongo, Anupam Prakash |
| 2019 | AFT | Quantum Algorithms for Portfolio Optimization. | Iordanis Kerenidis, Anupam Prakash, Dniel Szilgyi |
| 2017 | ICALP | Streaming Communication Protocols. | Lucas Boczkowski, Iordanis Kerenidis, Frdric Magniez |
| 2016 | MFCS | Pointer Quantum PCPs and Multi-Prover Games. | Alex Bredariol Grilo, Iordanis Kerenidis, Attila Pereszlnyi |
| 2016 | MFCS | Multi-Party Protocols, Information Complexity and Privacy. | Iordanis Kerenidis, Adi Rosn, Florent Urrutia |
| 2015 | CRYPTO | Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption. | Romain Gay, Iordanis Kerenidis, Hoeteck Wee |
| 2015 | ICALP | Relative Discrepancy Does not Separate Information and Communication Complexity. | Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurire, Jrmie Roland |
| 2015 | MFCS | QMA with Subset State Witnesses. | Alex Bredariol Grilo, Iordanis Kerenidis, Jamie Sikora |
| 2012 | FOCS | Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications. | Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jrmie Roland, David Xiao |
| 2011 | FOCS | Optimal Bounds for Quantum Bit Commitment. | Andr Chailloux, Iordanis Kerenidis |
| 2011 | ICALP | Quantum Commitments from Complexity Assumptions. | Andr Chailloux, Iordanis Kerenidis, Bill Rosgen |
| 2009 | FOCS | Optimal Quantum Strong Coin Flipping. | Andr Chailloux, Iordanis Kerenidis |
| 2008 | TCC | Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model. | Andr Chailloux, Dragos Florin Ciocan, Iordanis Kerenidis, Salil P. Vadhan |
| 2007 | STOC | Exponential separations for one-way quantum communication complexity, with applications to cryptography. | Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald de Wolf |
| 2007 | TAMC | Quantum Multiparty Communication Complexity and Circuit Lower Bounds. | Iordanis Kerenidis |
| 2004 | STOC | Exponential separation of quantum and classical one-way communication complexity. | Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis |
| 2003 | STOC | Exponential lower bound for 2-query locally decodable codes via a quantum argument. | Iordanis Kerenidis, Ronald de Wolf |
| 2002 | STOC | Competitive recommendation systems. | Petros Drineas, Iordanis Kerenidis, Prabhakar Raghavan |