# Troy Lee

Orcid: 0000-0001-6912-2338
According to our database

Collaborative distances:

^{1}, Troy Lee authored at least 68 papers between 2002 and 2023.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### On csauthors.net:

## Bibliography

2023

CoRR, 2023

2022

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

Proceedings of the Approximation, 2022

WorldScientific, ISBN: 9789813223226, 2022

2021

Quantum, 2021

CoRR, 2021

CoRR, 2021

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Proceedings of the 36th Computational Complexity Conference, 2021

Proceedings of the 36th Computational Complexity Conference, 2021

2020

Theory Comput. Syst., 2020

CoRR, 2020

CoRR, 2020

2019

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

A Composition Theorem for Randomized Query Complexity via Max-Conflict Complexity.

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Ledger, 2018

CoRR, 2018

CoRR, 2018

2017

Math. Program., 2017

Electron. Colloquium Comput. Complex., 2017

Electron. Colloquium Comput. Complex., 2017

Comput. Complex., 2017

Improved Quantum Query Algorithms for Triangle Detection and Associativity Testing.

Algorithmica, 2017

Proceedings of the 32nd Computational Complexity Conference, 2017

2016

J. Comput. Syst. Sci., 2016

Separations in communication complexity using cheat sheets and information complexity.

Electron. Colloquium Comput. Complex., 2016

Proceedings of the 31st Conference on Computational Complexity, 2016

2015

Eur. J. Comb., 2015

Electron. Colloquium Comput. Complex., 2015

Limitations of convex programming: lower bounds on extended formulations and factorization ranks (Dagstuhl Seminar 15082).

Dagstuhl Reports, 2015

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

CoRR, 2014

A quadratically tight partition bound for classical communication complexity and query complexity.

CoRR, 2014

Proceedings of the Approximation, 2014

2013

Quantum Inf. Comput., 2013

Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices (Dagstuhl Seminar 13082).

Dagstuhl Reports, 2013

Dagstuhl Report 13082: Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices

CoRR, 2013

CoRR, 2013

Comput. Complex., 2013

The approximate rank of a matrix and its algorithmic applications: approximate rank.

Proceedings of the Symposium on Theory of Computing Conference, 2013

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

2012

Learning graph based quantum query algorithms for finding constant-size subgraphs.

Chic. J. Theor. Comput. Sci., 2012

New bounds on the classical and quantum communication complexity of some graph properties.

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

Lower Bounds for Sizes of Semidefinite Formulations for Some Combinatorial Optimization Problems.

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011

A learning graph based quantum query algorithm for finding constant-size subgraphs

CoRR, 2011

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009

Found. Trends Theor. Comput. Sci., 2009

CoRR, 2009

Comput. Complex., 2009

Proceedings of the 24th Annual IEEE Conference on Computational Complexity, 2009

Proceedings of the 24th Annual IEEE Conference on Computational Complexity, 2009

2008

Electron. Colloquium Comput. Complex., 2008

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Proceedings of the Computational Complexity of Discrete Problems, 14.09. - 19.09.2008, 2008

Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, 2008

2007

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Proceedings of the STACS 2007, 2007

2006

Comput. Complex., 2006

2005

Theor. Comput. Sci., 2005

Comput. Complex., 2005

2004

Electron. Colloquium Comput. Complex., 2004

Electron. Colloquium Comput. Complex., 2004

2003

Math. Log. Q., 2003

2002

How Information-Mapping Patterns Determine Foraging Behaviour of a Honey Bee Colony.

Open Syst. Inf. Dyn., 2002