Troy Lee

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6138069	2024-01-16	Paper
https://portal.mardi4nfdi.de/entity/Q6147309	2024-01-15	Paper
Around the log-rank conjecture	2023-10-12	Paper
https://portal.mardi4nfdi.de/entity/Q6115369	2023-07-12	Paper
https://portal.mardi4nfdi.de/entity/Q6115391	2023-07-12	Paper
https://portal.mardi4nfdi.de/entity/Q5091164	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5091221	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5090429	2022-07-18	Paper
https://portal.mardi4nfdi.de/entity/Q5090458	2022-07-18	Paper
https://portal.mardi4nfdi.de/entity/Q5136299	2020-11-25	Paper
https://portal.mardi4nfdi.de/entity/Q5111154	2020-05-26	Paper
Query Complexity	2020-03-04	Paper
Quadratically tight relations for randomized query complexity	2020-02-27	Paper
Improved Quantum Query Algorithms for Triangle Finding and Associativity Testing	2019-05-15	Paper
Quadratically tight relations for randomized query complexity	2018-11-28	Paper
Separations in Query Complexity Based on Pointer Functions	2018-05-17	Paper
https://portal.mardi4nfdi.de/entity/Q5368751	2017-10-10	Paper
Separations in Query Complexity Based on Pointer Functions	2017-09-29	Paper
Information-theoretic approximations of the nonnegative rank	2017-07-28	Paper
Some upper and lower bounds on PSD-rank	2017-03-23	Paper
https://portal.mardi4nfdi.de/entity/Q2969040	2017-03-22	Paper
Improved quantum query algorithms for triangle detection and associativity testing	2017-03-03	Paper
https://portal.mardi4nfdi.de/entity/Q2957488	2017-01-26	Paper
Hellinger volume and number-on-the-forehead communication complexity	2016-06-13	Paper
Query Complexity in Expectation	2015-10-27	Paper
Fooling-sets and rank	2015-06-02	Paper
The approximate rank of a matrix and its algorithmic applications	2014-08-07	Paper
Quantum Query Complexity of State Conversion	2014-07-30	Paper
https://portal.mardi4nfdi.de/entity/Q5414605	2014-05-06	Paper
Rank and fooling set size	2013-10-28	Paper
A strong direct product theorem for quantum query complexity	2013-07-19	Paper
All Schatten spaces endowed with the Schur product are \(Q\)-algebras	2011-12-14	Paper
Disjointness is hard in the multiparty number-on-the-forehead model	2011-02-18	Paper
Composition Theorems in Communication Complexity	2010-09-07	Paper
Lower Bounds in Communication Complexity	2010-02-08	Paper
https://portal.mardi4nfdi.de/entity/Q3549652	2009-01-05	Paper
Product Theorems Via Semidefinite Programming	2008-08-28	Paper
Optimal Quantum Adversary Lower Bounds for Ordered Search	2008-08-28	Paper
Kolmogorov Complexity with Error	2008-03-19	Paper
The quantum adversary method and classical formula size power bounds	2007-11-05	Paper
A New Rank Technique for Formula Size Lower Bounds	2007-09-03	Paper
Language compression and pseudorandom generators	2006-02-08	Paper
Resource bounded symmetry of information revisited	2005-12-06	Paper
Mathematical Foundations of Computer Science 2004	2005-08-22	Paper
Arithmetical definability over finite structures	2003-07-31	Paper
How Information-Mapping Patterns Determine Foraging Behaviour of a Honey Bee Colony	2002-08-21	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Troy Lee