Troy Lee

Cited by

	All	Since 2016
Citations	1642	766
h-index	20	14
i10-index	39	22

180

135

20042005200620072008200920102011201220132014201520162017201820192020202110 22 8 33 45 67 69 90 112 116 135 134 137 127 144 177 176 5

Co-authors

Miklos SanthaSenior researcher in Computer Science, CNRS Paris and CQT SingaporeVerified email at liafa.univ-paris-diderot.fr
Robert SpalekundisclosedVerified email at ucw.cz
Rahul JainProfessor, Computer Science, NUSVerified email at comp.nus.edu.sg
Harry BuhrmanGroup leader CWI & Distinguished Research Professor University of Amsterdam & Director QuSoftVerified email at cwi.nl
Ronald de WolfCWI and University of AmsterdamVerified email at cwi.nl
Aleksandrs Belovsassistant professor, University of LatviaVerified email at inbox.lv
Ben ReichardtUniversity of Southern CaliforniaVerified email at usc.edu
Jop BriëtCWIVerified email at cwi.nl
Frédéric MagniezCNRSVerified email at irif.fr
Thomas VidickProfessor, CMS, CaltechVerified email at caltech.edu
Sophie LaplanteLIAFA, Université Paris Diderot - Paris 7Verified email at liafa.univ-paris-diderot.fr
Noga AlonPrinceton University and Tel Aviv UniversityVerified email at tau.ac.il
Shengyu Zhang（张胜誉）TencentVerified email at cse.cuhk.edu.hk
Anurag AnshuUniversity of California, BerkeleyVerified email at berkeley.edu
Andrei RomashchenkoLIRMM, CNRS, University of Montpellier & IITP of MoscowVerified email at lirmm.fr
Santosh S. VempalaGeorgia TechVerified email at gatech.edu
Robin KothariSenior Researcher, Microsoft Quantum and Microsoft ResearchVerified email at robinkothari.com
Shai Ben-DavidUniverity of Waterloo, CanadaVerified email at uwaterloo.ca
Kaspars BalodisUniversity of LatviaVerified email at lu.lv
Andris AmbainisProfessor, University of LatviaVerified email at lu.lv

Troy Lee

University of Technology Sydney

Verified email at uts.edu.au - Homepage

Theoretical Computer Science UTS:QSI


Title Sort by citations Sort by year Sort by 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	177	2007
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	133	2011
Lower bounds in communication complexity T Lee, A Shraibman Now Publishers Inc 3 (4), 2009	115	2009
Disjointness is hard in the multiparty number-on-the-forehead model T Lee, A Shraibman Computational Complexity 18 (2), 309-336, 2009	103	2009
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	89	2002
A direct product theorem for discrepancy T Lee, A Shraibman, R Špalek 2008 23rd Annual IEEE Conference on Computational Complexity, 71-80, 2008	83	2008
The quantum adversary method and classical formula size lower bounds S Laplante, T Lee, M Szegedy computational complexity 15 (2), 163-196, 2006	76	2006
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	74	2017
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	64	2013
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	55	2017
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	41	2013
Composition theorems in communication complexity T Lee, S Zhang Automata, Languages and Programming, 475-489, 2010	31	2010
An approximation algorithm for approximation rank T Lee, A Shraibman 2009 24th Annual IEEE Conference on Computational Complexity, 351-357, 2009	31	2009
A learning graph based quantum query algorithm for finding constant-size subgraphs T Lee, F Magniez, M Santha arXiv preprint arXiv:1109.5135, 2011	27	2011
Matrix Completion From any Given Set of Observations. T Lee, A Shraibman NIPS, 1781-1787, 2013	26	2013
Quantum algorithm for k-distinctness with prior knowledge on the input A Belovs, T Lee arXiv preprint arXiv:1108.3022, 2011	22	2011
Information-theoretic approximations of the nonnegative rank G Braun, R Jain, T Lee, S Pokutta computational complexity 26 (1), 147-197, 2017	21	2017
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	20	2016
A strong direct product theorem for quantum query complexity T Lee, J Roland computational complexity 22 (2), 429-462, 2013	20	2013
Optimal quantum adversary lower bounds for ordered search AM Childs, T Lee International Colloquium on Automata, Languages, and Programming, 869-880, 2008	20	2008

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors