Troy Lee
Title
Cited by
Cited by
Year
Negative weights make adversaries stronger
P Hoyer, T Lee, R Spalek
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007
1682007
Quantum query complexity of state conversion
T Lee, R Mittal, BW Reichardt, R Špalek, M Szegedy
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 344-353, 2011
1222011
Lower bounds in communication complexity
T Lee, A Shraibman
Now Publishers Inc 3 (4), 2009
1142009
Disjointness is hard in the multiparty number-on-the-forehead model
T Lee, A Shraibman
Computational Complexity 18 (2), 309-336, 2009
992009
How information-mapping patterns determine foraging behaviour of a honey bee colony
V Tereshko, T Lee
Open Systems & Information Dynamics 9 (02), 181-193, 2002
882002
A direct product theorem for discrepancy
T Lee, A Shraibman, R Špalek
2008 23rd Annual IEEE Conference on Computational Complexity, 71-80, 2008
812008
The quantum adversary method and classical formula size lower bounds
S Laplante, T Lee, M Szegedy
Computational Complexity 15 (2), 163-196, 2006
722006
The approximate rank of a matrix and its algorithmic applications: approximate rank
N Alon, T Lee, A Shraibman, S Vempala
Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013
632013
Quantum attacks on Bitcoin, and how to protect against them
D Aggarwal, GK Brennen, T Lee, M Santha, M Tomamichel
arXiv preprint arXiv:1710.10377, 2017
592017
Separations in query complexity based on pointer functions
A Ambainis, K Balodis, A Belovs, T Lee, M Santha, J Smotrovs
Journal of the ACM (JACM) 64 (5), 1-24, 2017
582017
Improved quantum query algorithms for triangle finding and associativity testing
T Lee, F Magniez, M Santha
Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013
392013
Composition theorems in communication complexity
T Lee, S Zhang
Automata, Languages and Programming, 475-489, 2010
302010
An approximation algorithm for approximation rank
T Lee, A Shraibman
2009 24th Annual IEEE Conference on Computational Complexity, 351-357, 2009
292009
A learning graph based quantum query algorithm for finding constant-size subgraphs
T Lee, F Magniez, M Santha
arXiv preprint arXiv:1109.5135, 2011
262011
Matrix completion from any given set of observations
T Lee, A Shraibman
Advances in Neural Information Processing Systems, 1781-1787, 2013
252013
Separations in communication complexity using cheat sheets and information complexity
A Anshu, A Belovs, S Ben-David, M Göös, R Jain, R Kothari, T Lee, ...
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016
212016
Quantum algorithm for k-distinctness with prior knowledge on the input
A Belovs, T Lee
arXiv preprint arXiv:1108.3022, 2011
212011
Optimal quantum adversary lower bounds for ordered search
AM Childs, T Lee
International Colloquium on Automata, Languages, and Programming, 869-880, 2008
192008
Arithmetical definability over finite structures
T Lee
Mathematical Logic Quarterly: Mathematical Logic Quarterly 49 (4), 385-392, 2003
192003
Some upper and lower bounds on PSD-rank
T Lee, Z Wei, R de Wolf
Mathematical programming 162 (1-2), 495-521, 2017
172017
The system can't perform the operation now. Try again later.
Articles 1–20