Troy Lee

ScholarGPS® ID: 87512992150150

Affiliation

Nanyang Technological University, Jurong West, Singapore

Affiliation History

Field

Physical Sciences and Mathematics

Discipline

Mathematics

Metrics Summary

Publication Count

Predicted Citations

718

Predicted h-index

Ranking

Publications and Citation History

Publications based on Top Specialties

Types of Publication

Publications
Books
Patents
NIH/NSF

Add Delete
Query Complexity (book) Kothari, Robin \| Lee, Troy \| Newman, Ilan \| Szegedy, Mario WORLD SCIENTIFIC (2025) 10.1142/10525 Cite \| Source
Quadratically Tight Relations for Randomized Query Complexity (journal article) Jain, Rahul \| Klauck, Hartmut \| Kundu, Srijita \| Lee, Troy \| Santha, Miklos \| Sanyal, Swagato \| Vihrovs, Jevgēnijs Theory of Computing Systems, volume 64, issue 1, pages 101-119 (2020). 10.1007/s00224-019-09935-x Cite \| Source
Quadratically Tight Relations for Randomized Query Complexity (book chapter) In Computer Science – Theory and Applications Jain, Rahul \| Klauck, Hartmut \| Kundu, Srijita \| Lee, Troy \| Santha, Miklos \| Sanyal, Swagato \| Vihrovs, Jevgēnijs Springer International Publishing (2018) 10.1007/978-3-319-90530-3_18 Cite \| Source \| Open Access
Separations in Query Complexity Based on Pointer Functions (journal article) Ambainis, Andris \| Balodis, Kaspars \| Belovs, Aleksandrs \| Lee, Troy \| Santha, Miklos \| Smotrovs, Juris Journal of the ACM, volume 64, issue 5, pages 1-24 (2017). 10.1145/3106234 Cited by (17) \| Cite \| Source \| Open Access
Some upper and lower bounds on PSD-rank (journal article) Lee, Troy \| Wei, Zhaohui \| de Wolf, Ronald Mathematical Programming, volume 162, issue 1-2, pages 495-521 (2017). 10.1007/s10107-016-1052-0 Cited by (14) \| Cite \| Source \| Open Access
Information-theoretic approximations of the nonnegative rank (journal article) Braun, Gábor \| Jain, Rahul \| Lee, Troy \| Pokutta, Sebastian computational complexity, volume 26, issue 1, pages 147-197 (2017). 10.1007/s00037-016-0125-z Cited by (6) \| Cite \| Source
Improved Quantum Query Algorithms for Triangle Detection and Associativity Testing (journal article) Lee, Troy \| Magniez, Frédéric \| Santha, Miklos Algorithmica, volume 77, issue 2, pages 459-486 (2017). 10.1007/s00453-015-0084-9 Cited by (12) \| Cite \| Source
Separations in Communication Complexity Using Cheat Sheets and Information Complexity (conference) Anshu, Anurag \| Belovs, Aleksandrs \| Ben-David, Shalev \| Goos, Mika \| Jain, Rahul \| Kothari, Robin \| Lee, Troy \| Santha, Miklos 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) (2016) New Brunswick, NJ, USA 10.1109/FOCS.2016.66 Cited by (12) \| Cite \| Source \| Open Access
Hellinger volume and number-on-the-forehead communication complexity (journal article) Lee, Troy \| Leonardos, Nikos \| Saks, Michael \| Wang, Fengming Journal of Computer and System Sciences, volume 82, issue 6, pages 1064-1074 (2016). 10.1016/j.jcss.2016.03.005 Cited by (1) \| Cite \| Source \| Open Access
Separations in query complexity based on pointer functions (conference) Ambainis, Andris \| Balodis, Kaspars \| Belovs, Aleksandrs \| Lee, Troy \| Santha, Miklos \| Smotrovs, Juris STOC '16: Symposium on Theory of Computing (2016) Cambridge MA USA 10.1145/2897518.2897524 Cited by (26) \| Cite \| Source \| Open Access
On the sum-of-squares degree of symmetric quadratic functions (conference) Lee, Troy \| Prakash, Anupam \| Wolf, Ronald de \| Yuen, Henry Conference on Computational Complexity (2016) 10.4230/LIPIcs.CCC.2016.17 Cited by (8) \| Cite \| Source
Fooling-sets and rank (journal article) Friesen, Mirjam \| Hamed, Aya \| Lee, Troy \| Oliver Theis, Dirk European Journal of Combinatorics, volume 48 (2015). 10.1016/j.ejc.2015.02.016 Cited by (5) \| Cite \| Source
The approximate rank of a matrix and its algorithmic applications (conference) Alon, Noga \| Lee, Troy \| Shraibman, Adi \| Vempala, Santosh STOC'13: Symposium on Theory of Computing (2013) Palo Alto California USA 10.1145/2488608.2488694 Cited by (22) \| Cite \| Source \| Open Access
A strong direct product theorem for quantum query complexity (journal article) Lee, Troy \| Roland, Jérémie computational complexity, volume 22, issue 2, pages 429-462 (2013). 10.1007/s00037-013-0066-8 Cited by (9) \| Cite \| Source \| Open Access
Improved Quantum Query Algorithms for Triangle Finding and Associativity Testing (conference) Lee, Troy \| Magniez, Frédéric \| Santha, Miklos Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (2013) 10.1137/1.9781611973105.107 Cited by (21) \| Cite \| Source \| Open Access
A Strong Direct Product Theorem for Quantum Query Complexity (conference) Lee, Troy \| Roland, Jeremie 2012 IEEE Conference on Computational Complexity (CCC) (2012) Porto, Portugal 10.1109/CCC.2012.17 Cited by (6) \| Cite \| Source
All Schatten spaces endowed with the Schur product are Q-algebras (journal article) Briët, Jop \| Buhrman, Harry \| Lee, Troy \| Vidick, Thomas Journal of Functional Analysis, volume 262, issue 1, pages 1-9 (2012). 10.1016/j.jfa.2011.09.001 Cited by (7) \| Cite \| Source \| Open Access
Quantum Query Complexity of State Conversion (conference) Lee, Troy \| Mittal, Rajat \| Reichardt, Ben W. \| palek, Robert \| Szegedy, Mario 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS) (2011) Palm Springs, CA, USA 10.1109/FOCS.2011.75 Cited by (66) \| Cite \| Source \| Open Access
Composition Theorems in Communication Complexity (book chapter) In Automata, Languages and Programming Lee, Troy \| Zhang, Shengyu Springer Berlin Heidelberg (2010) 10.1007/978-3-642-14165-2_41 Cited by (12) \| Cite \| Source \| Open Access
An Approximation Algorithm for Approximation Rank (conference) Lee, Troy \| Shraibman, Adi 2009 24th Annual IEEE Conference on Computational Complexity (CCC) (2009) Paris, France 10.1109/CCC.2009.25 Cited by (22) \| Cite \| Source \| Open Access