| 2008 |
|---|
| 21 | EE | Troy Lee,
Rajat Mittal:
Product Theorems Via Semidefinite Programming.
ICALP (1) 2008: 674-685 |
| 20 | EE | Andrew M. Childs,
Troy Lee:
Optimal Quantum Adversary Lower Bounds for Ordered Search.
ICALP (1) 2008: 869-880 |
| 19 | EE | Troy Lee,
Adi Shraibman,
Robert Spalek:
A Direct Product Theorem for Discrepancy.
IEEE Conference on Computational Complexity 2008: 71-80 |
| 18 | EE | Troy Lee,
Adi Shraibman:
Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model.
IEEE Conference on Computational Complexity 2008: 81-91 |
| 17 | EE | Troy Lee,
Rajat Mittal:
Product theorems via semidefinite programming
CoRR abs/0803.4206: (2008) |
| 16 | EE | Troy Lee,
Adi Shraibman:
An approximation algorithm for approximation rank
CoRR abs/0809.2093: (2008) |
| 15 | EE | Troy Lee,
Adi Shraibman:
Disjointness is hard in the multi-party number-on-the-forehead model.
Electronic Colloquium on Computational Complexity (ECCC) 15(003): (2008) |
| 2007 |
|---|
| 14 | EE | Troy Lee:
A New Rank Technique for Formula Size Lower Bounds.
STACS 2007: 145-156 |
| 13 | EE | Peter Høyer,
Troy Lee,
Robert Spalek:
Negative weights make adversaries stronger.
STOC 2007: 526-535 |
| 12 | EE | Troy Lee,
Adi Shraibman:
Disjointness is hard in the multi-party number on the forehead model
CoRR abs/0712.4279: (2007) |
| 2006 |
|---|
| 11 | EE | Lance Fortnow,
Troy Lee,
Nikolai K. Vereshchagin:
Kolmogorov Complexity with Error.
STACS 2006: 137-148 |
| 10 | EE | Sophie Laplante,
Troy Lee,
Mario Szegedy:
The Quantum Adversary Method and Classical Formula Size Lower Bounds.
Computational Complexity 15(2): 163-196 (2006) |
| 2005 |
|---|
| 9 | EE | Sophie Laplante,
Troy Lee,
Mario Szegedy:
The Quantum Adversary Method and Classical Formula Size Lower Bounds.
IEEE Conference on Computational Complexity 2005: 76-90 |
| 8 | EE | Harry Buhrman,
Troy Lee,
Dieter van Melkebeek:
Language compression and pseudorandom generators.
Computational Complexity 14(3): 228-255 (2005) |
| 7 | EE | Troy Lee,
Andrei E. Romashchenko:
Resource bounded symmetry of information revisited.
Theor. Comput. Sci. 345(2-3): 386-405 (2005) |
| 2004 |
|---|
| 6 | EE | Harry Buhrman,
Troy Lee,
Dieter van Melkebeek:
Language Compression and Pseudorandom Generators.
IEEE Conference on Computational Complexity 2004: 15-28 |
| 5 | EE | Troy Lee,
Andrei E. Romashchenko:
On Polynomially Time Bounded Symmetry of Information.
MFCS 2004: 463-475 |
| 4 | EE | Troy Lee,
Dieter van Melkebeek,
Harry Buhrman:
Language Compression and Pseudorandom Generators
Electronic Colloquium on Computational Complexity (ECCC)(002): (2004) |
| 3 | EE | Troy Lee,
Andrei E. Romashchenko:
On Polynomially Time Bounded Symmetry of Information
Electronic Colloquium on Computational Complexity (ECCC)(031): (2004) |
| 2 | EE | Lance Fortnow,
Troy Lee,
Nikolai K. Vereshchagin:
Kolmogorov Complexity with Error
Electronic Colloquium on Computational Complexity (ECCC)(080): (2004) |
| 2003 |
|---|
| 1 | EE | Troy Lee:
Arithmetical definability over finite structures.
Math. Log. Q. 49(4): 385-392 (2003) |
