Troy Lee

1.5k total citations
35 papers, 376 citations indexed

About

Troy Lee is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Electrical and Electronic Engineering. According to data from OpenAlex, Troy Lee has authored 35 papers receiving a total of 376 indexed citations (citations by other indexed papers that have themselves been cited), including 25 papers in Computational Theory and Mathematics, 18 papers in Artificial Intelligence and 7 papers in Electrical and Electronic Engineering. Recurrent topics in Troy Lee's work include Complexity and Algorithms in Graphs (21 papers), Quantum Computing Algorithms and Architecture (11 papers) and Machine Learning and Algorithms (7 papers). Troy Lee is often cited by papers focused on Complexity and Algorithms in Graphs (21 papers), Quantum Computing Algorithms and Architecture (11 papers) and Machine Learning and Algorithms (7 papers). Troy Lee collaborates with scholars based in Singapore, United States and Netherlands. Troy Lee's co-authors include Adi Shraibman, Miklós Sántha, Marco Tomamichel, Divesh Aggarwal, Gavin K. Brennen, Márió Szegedy, Sophie Laplante, Ronald de Wolf, Noga Alon and Santosh Vempala and has published in prestigious journals such as SHILAP Revista de lepidopterología, Mathematical Programming and Journal of Functional Analysis.

In The Last Decade

Troy Lee

34 papers receiving 331 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Troy Lee Singapore	10	243	191	71	40	39	35	376
Rainer Steinwandt United States	10	392 1.6×	122 0.6×	109 1.5×	57 1.4×	84 2.2×	59	475
Roberto Bagnara Italy	11	241 1.0×	323 1.7×	32 0.5×	31 0.8×	57 1.5×	36	450
Ragesh Jaiswal India	9	211 0.9×	129 0.7×	28 0.4×	22 0.6×	49 1.3×	27	316
François Panneton Canada	8	175 0.7×	123 0.6×	29 0.4×	28 0.7×	60 1.5×	11	321
Steven Homer United States	15	416 1.7×	481 2.5×	17 0.2×	49 1.2×	67 1.7×	53	661
Stasys Jukna Germany	9	245 1.0×	397 2.1×	20 0.3×	87 2.2×	111 2.8×	42	571
Jiaquan Gao China	12	108 0.4×	147 0.8×	19 0.3×	16 0.4×	79 2.0×	48	363
Albrecht Petzoldt United States	6	183 0.8×	54 0.3×	89 1.3×	75 1.9×	72 1.8×	10	283
Hao Hao China	9	169 0.7×	84 0.4×	108 1.5×	30 0.8×	53 1.4×	26	378

Countries citing papers authored by Troy Lee

Since Specialization

Citations

This map shows the geographic impact of Troy Lee's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Troy Lee with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Troy Lee more than expected).

Fields of papers citing papers by Troy Lee

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Troy Lee. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Troy Lee. The network helps show where Troy Lee may publish in the future.

Co-authorship network of co-authors of Troy Lee

This figure shows the co-authorship network connecting the top 25 collaborators of Troy Lee. A scholar is included among the top collaborators of Troy Lee based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Troy Lee. Troy Lee is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Lee, Troy & Adi Shraibman. (2023). Around the log-rank conjecture. Israel Journal of Mathematics. 256(2). 441–477. 3 indexed citations

Jain, Rahul, et al.. (2019). Quadratically Tight Relations for Randomized Query Complexity. Theory of Computing Systems. 64(1). 101–119.

Aggarwal, Divesh, Gavin K. Brennen, Troy Lee, Miklós Sántha, & Marco Tomamichel. (2018). Quantum Attacks on Bitcoin, and How to Protect Against Them. SHILAP Revista de lepidopterología. 3. 94 indexed citations

Lee, Troy, et al.. (2016). Hellinger volume and number-on-the-forehead communication complexity. Journal of Computer and System Sciences. 82(6). 1064–1074. 1 indexed citations

Lee, Troy, Zhaohui Wei, & Ronald de Wolf. (2016). Some upper and lower bounds on PSD-rank. Mathematical Programming. 162(1-2). 495–521. 9 indexed citations

Ambainis, Andris, et al.. (2016). Separations in query complexity based on pointer functions. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 800–813. 15 indexed citations

Braun, Gábor, Rahul Jain, Troy Lee, & Sebastian Pokutta. (2016). Information-theoretic approximations of the nonnegative rank. Computational Complexity. 26(1). 147–197. 1 indexed citations

Lee, Troy, et al.. (2015). Fooling-sets and rank. European Journal of Combinatorics. 48. 143–153. 1 indexed citations

Lee, Troy & Adi Shraibman. (2013). Matrix Completion From any Given Set of Observations. DR-NTU (Nanyang Technological University). 26. 1781–1787. 11 indexed citations

10.

Beasley, LeRoy B., Hartmut Klauck, Troy Lee, & Dirk Oliver Theis. (2013). Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices (Dagstuhl Seminar 13082). DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 3(2). 127–143. 2 indexed citations

11.

Briët, Jop, Harry Buhrman, Troy Lee, & Thomas Vidick. (2013). Multipartite entanglement in XOR games. Quantum Information and Computation. 13(3&4). 334–360. 7 indexed citations

12.

Lee, Troy & Dirk Oliver Theis. (2012). Support based bounds for positive semidefinite rank. arXiv (Cornell University). 1 indexed citations

13.

Lee, Troy & Dirk Oliver Theis. (2012). Lower Bounds for Sizes of Semidefinite Formulations for Some Combinatorial Optimization Problems.. arXiv (Cornell University). 176–180. 1 indexed citations

14.

Ivanyos, Gábor, Hartmut Klauck, Troy Lee, Miklós Sántha, & Ronald de Wolf. (2012). New bounds on the classical and quantum communication complexity of some graph properties. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 8 indexed citations

15.

Briët, Jop, Harry Buhrman, Troy Lee, & Thomas Vidick. (2011). All Schatten spaces endowed with the Schur product are Q-algebras. Journal of Functional Analysis. 262(1). 1–9. 4 indexed citations

16.

Lee, Troy, Gideon Schechtman, & Adi Shraibman. (2009). Lower Bounds on Quantum Multiparty Communication Complexity. 254–262. 8 indexed citations

17.

Lee, Troy & Adi Shraibman. (2008). Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model. 81–91. 25 indexed citations

18.

Lee, Troy & Andrei Romashchenko. (2004). On Polynomially Time Bounded Symmetry of Information. Electronic colloquium on computational complexity. 1 indexed citations

19.

Lee, Troy. (2003). Arithmetical definability over finite structures. Mathematical logic quarterly. 49(4). 385–392. 8 indexed citations

20.

Lee, Troy, et al.. (2002). How Information-Mapping Patterns Determine Foraging Behaviour of a Honey Bee Colony. Open Systems & Information Dynamics. 9(2). 181–193. 51 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact