| 2025 | ICALP | On the Quantum Time Complexity of Divide and Conquer. | Jonathan Allcock, Jinge Bao, Aleksandrs Belovs, Troy Lee, Miklos Santha |
| 2022 | FOCS | Cut Query Algorithms with Star Contraction. | Simon Apers, Yuval Efron, Pawel Gawrychowski, Troy Lee, Sagnik Mukhopadhyay, Danupon Nanongkai |
| 2021 | SODA | Quantum algorithms for graph problems with cut queries. | Troy Lee, Miklos Santha, Shengyu Zhang |
| 2019 | ICALP | Two New Results About Quantum Exact Learning. | Srinivasan Arunachalam, Sourav Chakraborty, Troy Lee, Manaswi Paraashar, Ronald de Wolf |
| 2019 | ICALP | A Composition Theorem for Randomized Query Complexity via Max-Conflict Complexity. | Dmitry Gavinsky, Troy Lee, Miklos Santha, Swagato Sanyal |
| 2019 | STACS | Bounding Quantum-Classical Separations for Classes of Nonlocal Games. | Tom Bannink, Jop Brit, Harry Buhrman, Farrokh Labib, Troy Lee |
| 2018 | CSR | Quadratically Tight Relations for Randomized Query Complexity. | Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs |
| 2016 | FOCS | Separations in Communication Complexity Using Cheat Sheets and Information Complexity. | Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Gs, Rahul Jain, Robin Kothari, Troy Lee, Miklos Santha |
| 2016 | STOC | Separations in query complexity based on pointer functions. | Andris Ambainis, Kaspars Balodis, Aleksandrs Belovs, Troy Lee, Miklos Santha, Juris Smotrovs |
| 2015 | ICALP | Query Complexity in Expectation. | Jedrzej Kaniewski, Troy Lee, Ronald de Wolf |
| 2013 | SODA | Improved quantum query algorithms for triangle finding and associativity testing. | Troy Lee, Frdric Magniez, Miklos Santha |
| 2013 | STOC | The approximate rank of a matrix and its algorithmic applications: approximate rank. | Noga Alon, Troy Lee, Adi Shraibman, Santosh S. Vempala |
| 2011 | FOCS | Quantum Query Complexity of State Conversion. | Troy Lee, Rajat Mittal, Ben W. Reichardt, Robert Spalek, Mario Szegedy |
| 2010 | ICALP | Composition Theorems in Communication Complexity. | Troy Lee, Shengyu Zhang |
| 2008 | ICALP | Optimal Quantum Adversary Lower Bounds for Ordered Search. | Andrew M. Childs, Troy Lee |
| 2008 | ICALP | Product Theorems Via Semidefinite Programming. | Troy Lee, Rajat Mittal |
| 2007 | STOC | Negative weights make adversaries stronger. | Peter Hyer, Troy Lee, Robert Spalek |
| 2007 | STACS | A New Rank Technique for Formula Size Lower Bounds. | Troy Lee |
| 2006 | STACS | Kolmogorov Complexity with Error. | Lance Fortnow, Troy Lee, Nikolai K. Vereshchagin |
| 2004 | MFCS | On Polynomially Time Bounded Symmetry of Information. | Troy Lee, Andrei Romashchenko |