How Information-Mapping Patterns Determine Foraging Behaviour of a Honey Bee Colony. - Valery Tereshko; Troy Lee (Open Syst. Inf. Dyn., 2002)

Arithmetical definability over finite structures. - Troy Lee (Math. Log. Q., 2003)

On Polynomially Time Bounded Symmetry of Information - Troy Lee; Andrei E. Romashchenko (Electron. Colloquium Comput. Complex., 2004)

Kolmogorov Complexity with Error - Lance Fortnow; Troy Lee; Nikolai K. Vereshchagin (Electron. Colloquium Comput. Complex., 2004)

Language compression and pseudorandom generators. - Harry Buhrman; Troy Lee; Dieter van Melkebeek (Comput. Complex., 2005)

Resource bounded symmetry of information revisited. - Troy Lee; Andrei E. Romashchenko (Theor. Comput. Sci., 2005)

The Quantum Adversary Method and Classical Formula Size Lower Bounds. - Sophie Laplante; Troy Lee; Mario Szegedy (Comput. Complex., 2006)

A New Rank Technique for Formula Size Lower Bounds. - Troy Lee (STACS, 2007)

Negative weights make adversaries stronger. - Peter Høyer; Troy Lee; Robert Spalek (STOC, 2007)

A Direct Product Theorem for Discrepancy. - Troy Lee; Adi Shraibman; Robert Spalek (CCC, 2008)

Approximation norms and duality for communication complexity lower bounds. - Troy Lee; Adi Shraibman (Computational Complexity of Discrete Problems, 2008)

Optimal Quantum Adversary Lower Bounds for Ordered Search. - Andrew M. Childs; Troy Lee (ICALP (1), 2008)

Product Theorems Via Semidefinite Programming. - Troy Lee; Rajat Mittal 001 (ICALP (1), 2008)

Disjointness is hard in the multi-party number-on-the-forehead model. - Troy Lee; Adi Shraibman (Electron. Colloquium Comput. Complex., 2008)

An Approximation Algorithm for Approximation Rank. - Troy Lee; Adi Shraibman (CCC, 2009)

Lower Bounds on Quantum Multiparty Communication Complexity. - Troy Lee; Gideon Schechtman; Adi Shraibman (CCC, 2009)

Disjointness is Hard in the Multiparty Number-on-the-Forehead Model. - Troy Lee; Adi Shraibman (Comput. Complex., 2009)

A note on the sign degree of formulas - Troy Lee (CoRR, 2009)

Lower Bounds in Communication Complexity. - Troy Lee; Adi Shraibman (Found. Trends Theor. Comput. Sci., 2009)

Composition Theorems in Communication Complexity. - Troy Lee; Shengyu Zhang 002 (ICALP (1), 2010)

Quantum Query Complexity of State Conversion. - Troy Lee; Rajat Mittal 001; Ben W. Reichardt; Robert Spalek; Mario Szegedy (FOCS, 2011)

A learning graph based quantum query algorithm for finding constant-size subgraphs - Troy Lee; Frédéric Magniez; Miklos Santha (CoRR, 2011)

Lower Bounds for Sizes of Semidefinite Formulations for Some Combinatorial Optimization Problems. - Troy Lee; Dirk Oliver Theis (CTW, 2012)

New bounds on the classical and quantum communication complexity of some graph properties. - Gábor Ivanyos; Hartmut Klauck; Troy Lee; Miklos Santha; Ronald de Wolf (FSTTCS, 2012)

Learning graph based quantum query algorithms for finding constant-size subgraphs. - Troy Lee; Frédéric Magniez; Miklos Santha (Chic. J. Theor. Comput. Sci., 2012)

Matrix Completion From any Given Set of Observations. - Troy Lee; Adi Shraibman (NIPS, 2013)

Improved quantum query algorithms for triangle finding and associativity testing. - Troy Lee; Frédéric Magniez; Miklos Santha (SODA, 2013)

The approximate rank of a matrix and its algorithmic applications: approximate rank. - Noga Alon; Troy Lee; Adi Shraibman; Santosh S. Vempala (STOC, 2013)

A strong direct product theorem for quantum query complexity. - Troy Lee; Jérémie Roland (Comput. Complex., 2013)

Rank and fooling set size. - Aya Hamed; Troy Lee (CoRR, 2013)

Dagstuhl Report 13082: Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices - LeRoy Beasely; Troy Lee; Hartmut Klauck; Dirk Oliver Theis (CoRR, 2013)

Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices (Dagstuhl Seminar 13082). - LeRoy B. Beasley; Hartmut Klauck; Troy Lee; Dirk Oliver Theis (Dagstuhl Reports, 2013)

Multipartite entanglement in XOR games. - Jop Briët; Harry Buhrman; Troy Lee; Thomas Vidick (Quantum Inf. Comput., 2013)

The Cover Number of a Matrix and its Algorithmic Applications. - Noga Alon; Troy Lee; Adi Shraibman (APPROX-RANDOM, 2014)

A quadratically tight partition bound for classical communication complexity and query complexity. - Rahul Jain 001; Troy Lee; Nisheeth K. Vishnoi (CoRR, 2014)

The square root rank of the correlation polytope is exponential. - Troy Lee; Zhaohui Wei (CoRR, 2014)

Query Complexity in Expectation. - Jedrzej Kaniewski; Troy Lee; Ronald de Wolf (ICALP (1), 2015)

Limitations of convex programming: lower bounds on extended formulations and factorization ranks (Dagstuhl Seminar 15082). - Hartmut Klauck; Troy Lee; Dirk Oliver Theis; Rekha R. Thomas (Dagstuhl Reports, 2015)

Separations in Query Complexity Based on Pointer Functions. - Andris Ambainis; Kaspars Balodis; Aleksandrs Belovs; Troy Lee; Miklos Santha; Juris Smotrovs (Electron. Colloquium Comput. Complex., 2015)

Fooling-sets and rank. - Mirjam Friesen; Aya Hamed; Troy Lee; Dirk Oliver Theis (Eur. J. Comb., 2015)

On the Sum-of-Squares Degree of Symmetric Quadratic Functions. - Troy Lee; Anupam Prakash; Ronald de Wolf; Henry Yuen (CCC, 2016)

Separations in communication complexity using cheat sheets and information complexity. - Anurag Anshu; Aleksandrs Belovs; Shalev Ben-David; Mika Göös; Rahul Jain 001; Robin Kothari; Troy Lee; Miklos Santha (Electron. Colloquium Comput. Complex., 2016)

Hellinger volume and number-on-the-forehead communication complexity. - Troy Lee; Nikos Leonardos; Michael E. Saks; Fengming Wang (J. Comput. Syst. Sci., 2016)

Separating Quantum Communication and Approximate Rank. - Anurag Anshu; Shalev Ben-David; Ankit Garg; Rahul Jain 001; Robin Kothari; Troy Lee (CCC, 2017)

Improved Quantum Query Algorithms for Triangle Detection and Associativity Testing. - Troy Lee; Frédéric Magniez; Miklos Santha (Algorithmica, 2017)

Information-theoretic approximations of the nonnegative rank. - Gábor Braun; Rahul Jain 001; Troy Lee; Sebastian Pokutta (Comput. Complex., 2017)

A Composition Theorem for Randomized Query complexity. - Anurag Anshu; Dmitry Gavinsky; Rahul Jain 001; Srijita Kundu; Troy Lee; Priyanka Mukhopadhyay; Miklos Santha; Swagato Sanyal (Electron. Colloquium Comput. Complex., 2017)

Quadratically Tight Relations for Randomized Query Complexity. - Dmitry Gavinsky; Rahul Jain 001; Hartmut Klauck; Srijita Kundu; Troy Lee; Miklos Santha; Swagato Sanyal; Jevgenijs Vihrovs (Electron. Colloquium Comput. Complex., 2017)

Some upper and lower bounds on PSD-rank. - Troy Lee; Zhaohui Wei; Ronald de Wolf (Math. Program., 2017)

On the randomised query complexity of composition. - Dmitry Gavinsky; Troy Lee; Miklos Santha (CoRR, 2018)

Two new results about quantum exact learning. - Srinivasan Arunachalam; Sourav Chakraborty 001; Troy Lee; Ronald de Wolf (CoRR, 2018)

Quantum Attacks on Bitcoin, and How to Protect Against Them. - Divesh Aggarwal; Gavin K. Brennen; Troy Lee; Miklos Santha; Marco Tomamichel (Ledger, 2018)

A Composition Theorem for Randomized Query Complexity via Max-Conflict Complexity. - Dmitry Gavinsky; Troy Lee; Miklos Santha; Swagato Sanyal (ICALP, 2019)

Strategies for Quantum Races. - Troy Lee; Maharshi Ray; Miklos Santha (ITCS, 2019)

Bounding Quantum-Classical Separations for Classes of Nonlocal Games. - Tom Bannink; Jop Briët; Harry Buhrman; Farrokh Labib; Troy Lee (STACS, 2019)

The quantum query complexity of composition with a relation. - Aleksandrs Belovs; Troy Lee (CoRR, 2020)

Quantum query complexity of edge connectivity. - Simon Apers; Troy Lee (CoRR, 2020)

Quadratically Tight Relations for Randomized Query Complexity. - Rahul Jain 001; Hartmut Klauck; Srijita Kundu; Troy Lee; Miklos Santha; Swagato Sanyal; Jevgenijs Vihrovs (Theory Comput. Syst., 2020)

Quantum Complexity of Minimum Cut. - Simon Apers; Troy Lee (CCC, 2021)

On the Cut Dimension of a Graph. - Troy Lee; Tongyang Li; Miklos Santha; Shengyu Zhang 002 (CCC, 2021)

Quantum algorithms for graph problems with cut queries. - Troy Lee; Miklos Santha; Shengyu Zhang 002 (SODA, 2021)

On the query complexity of connectivity with global queries. - Arinta Auza; Troy Lee (CoRR, 2021)

A sublinear time quantum algorithm for s-t minimum cut on dense simple graphs. - Simon Apers; Arinta Auza; Troy Lee (CoRR, 2021)

Two new results about quantum exact learning. - Srinivasan Arunachalam; Sourav Chakraborty 001; Troy Lee; Manaswi Paraashar; Ronald de Wolf (Quantum, 2021)

Query Complexity - Mario Szegedy; Ilan Newman; Troy Lee (WorldScientific, 2022)

Finding the KT Partition of a Weighted Graph in Near-Linear Time. - Simon Apers; Pawel Gawrychowski; Troy Lee (APPROX/RANDOM, 2022)

Cut Query Algorithms with Star Contraction. - Simon Apers; Yuval Efron; Pawel Gawrychowski; Troy Lee; Sagnik Mukhopadhyay; Danupon Nanongkai (FOCS, 2022)

Optimal Composition Theorem for Randomized Query Complexity. - Dmytro Gavinsky; Troy Lee; Miklos Santha; Swagato Sanyal (Theory Comput., 2023)

On the Quantum Time Complexity of Divide and Conquer. - Jonathan Allcock; Jinge Bao; Aleksandrs Belovs; Troy Lee; Miklos Santha (ICALP, 2025)

Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2021 Special Issue. - Alina Ene; Troy Lee; Piotr Micek; Sushant Sachdeva (ACM Trans. Algorithms, 2025)