| 2021 | SODA | Analytic quantum weak coin flipping protocols with arbitrarily small bias. | Atul Singh Arora, Jrmie Roland, Chrysoula Vlachou |
| 2019 | STOC | Quantum weak coin flipping. | Atul Singh Arora, Jrmie Roland, Stephan Weis |
| 2015 | ICALP | Relative Discrepancy Does not Separate Information and Communication Complexity. | Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurire, Jrmie Roland |
| 2013 | STACS | Explicit relation between all lower bound techniques for quantum query complexity. | Lock Magnin, Jrmie Roland |
| 2012 | FOCS | Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications. | Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jrmie Roland, David Xiao |
| 2012 | ICALP | Classical and Quantum Partition Bound and Detector Inefficiency. | Sophie Laplante, Virginie Lerays, Jrmie Roland |
| 2011 | COCOON | Quantum Algorithm for the Boolean Hidden Shift Problem. | Dmitry Gavinsky, Martin Roetteler, Jrmie Roland |
| 2010 | ICALP | Finding Is as Easy as Detecting for Quantum Walks. | Hari Krovi, Frdric Magniez, Maris Ozols, Jrmie Roland |
| 2009 | ICALP | Amortized Communication Complexity of Distributions. | Jrmie Roland, Mario Szegedy |
| 2009 | MFCS | The Communication Complexity of Non-signaling Distributions. | Julien Degorre, Marc Kaplan, Sophie Laplante, Jrmie Roland |
| 2007 | STOC | Search via quantum walk. | Frdric Magniez, Ashwin Nayak, Jrmie Roland, Miklos Santha |