Travelled to:1 × France
1 × Iceland
1 × Japan
2 × USA
Collaborated with:S.Zhang A.M.Childs R.Mittal J.Kaniewski R.d.Wolf P.Høyer R.Spalek N.Alon A.Shraibman S.Vempala
Talks about:adversari (2) approxim (2) theorem (2) complex (2) rank (2) semidefinit (1) algorithm (1) stronger (1) composit (1) communic (1)
Person: Troy Lee
DBLP: Lee:Troy
Contributed to:
2015
2013201020082007Wrote 6 papers:
- ICALP-v1-2015-KaniewskiLW #complexity #query
- Query Complexity in Expectation (JK, TL, RdW), pp. 761–772.
- STOC-2013-AlonLSV #algorithm #approximate #matrix #rank
- The approximate rank of a matrix and its algorithmic applications: approximate rank (NA, TL, AS, SV), pp. 675–684.
- ICALP-v1-2010-LeeZ #communication #complexity #composition #theorem
- Composition Theorems in Communication Complexity (TL, SZ), pp. 475–489.
- ICALP-A-2008-ChildsL #bound #order #quantum
- Optimal Quantum Adversary Lower Bounds for Ordered Search (AMC, TL), pp. 869–880.
- ICALP-A-2008-LeeM #programming #theorem
- Product Theorems Via Semidefinite Programming (TL, RM), pp. 674–685.
- STOC-2007-HoyerLS
- Negative weights make adversaries stronger (PH, TL, RS), pp. 526–535.