Segueix
Troy Lee
Títol
Citada per
Citada per
Any
Negative weights make adversaries stronger
P Hoyer, T Lee, R Spalek
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007
2312007
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
2272017
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
1812011
Lower bounds in communication complexity
T Lee, A Shraibman
Now Publishers Inc 3 (4), 2009
1502009
How information-mapping patterns determine foraging behaviour of a honey bee colony
V Tereshko, T Lee
Open Systems & Information Dynamics 9 (2), 181-193, 2002
1162002
A direct product theorem for discrepancy
T Lee, A Shraibman, R Špalek
2008 23rd Annual IEEE Conference on Computational Complexity, 71-80, 2008
1122008
Disjointness is hard in the multiparty number-on-the-forehead model
T Lee, A Shraibman
Computational Complexity 18 (2), 309-336, 2009
1102009
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
1012017
The quantum adversary method and classical formula size lower bounds
S Laplante, T Lee, M Szegedy
computational complexity 15, 163-196, 2006
862006
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
832013
Improved quantum query algorithms for triangle detection and associativity testing
T Lee, F Magniez, M Santha
Algorithmica 77, 459-486, 2017
64*2017
An approximation algorithm for approximation rank
T Lee, A Shraibman
2009 24th Annual IEEE Conference on Computational Complexity, 351-357, 2009
462009
Multipartite entanglement in XOR games.
J Briët, H Buhrman, T Lee, T Vidick
Quantum Inf. Comput. 13 (3-4), 334-360, 2013
44*2013
Composition theorems in communication complexity
T Lee, S Zhang
Automata, Languages and Programming, 475-489, 2010
422010
Matrix completion from any given set of observations
T Lee, A Shraibman
Advances in Neural Information Processing Systems 26, 2013
362013
A learning graph based quantum query algorithm for finding constant-size subgraphs
T Lee, F Magniez, M Santha
arXiv preprint arXiv:1109.5135, 2011
342011
Two new results about quantum exact learning
S Arunachalam, S Chakraborty, T Lee, M Paraashar, R De Wolf
Quantum 5, 587, 2021
332021
A strong direct product theorem for quantum query complexity
T Lee, J Roland
computational complexity 22, 429-462, 2013
312013
Some upper and lower bounds on PSD-rank
T Lee, Z Wei, R de Wolf
Mathematical programming 162 (1), 495-521, 2017
292017
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
272016
En aquests moments el sistema no pot dur a terme l'operació. Torneu-ho a provar més tard.
Articles 1–20