- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j8 |      | Troy Lee, Jérémie Roland: A strong direct product theorem for quantum query complexity. Computational Complexity 22(2): 429-462 (2013) |
| c18 | | Troy Lee, Frédéric Magniez, Miklos Santha: Improved quantum query algorithms for triangle finding and associativity testing. SODA 2013: 1486-1502 |
| 2012 | ||
| c17 | | Troy Lee, Jérémie Roland: A Strong Direct Product Theorem for Quantum Query Complexity. IEEE Conference on Computational Complexity 2012: 236-246 |
| c16 |  | Troy Lee, Dirk Oliver Theis: Lower Bounds for Sizes of Semidefinite Formulations for Some Combinatorial Optimization Problems. CTW 2012: 176-180 |
| c15 | | Gábor Ivanyos, Hartmut Klauck, Troy Lee, Miklos Santha, Ronald de Wolf: New bounds on the classical and quantum communication complexity of some graph properties. FSTTCS 2012: 148-159 |
| i13 | | Troy Lee, Dirk Oliver Theis: Lower bounds for sizes of semidefinite formulations for some combinatorial optimization problems. CoRR abs/1203.3961 (2012) |
| i12 | | Gábor Ivanyos, Hartmut Klauck, Troy Lee, Miklos Santha, Ronald de Wolf: New bounds on the classical and quantum communication complexity of some graph properties. CoRR abs/1204.4596 (2012) |
| 2011 | ||
| c14 | | Troy Lee, Rajat Mittal, Ben W. Reichardt, Robert Spalek, Mario Szegedy: Quantum Query Complexity of State Conversion. FOCS 2011: 344-353 |
| i11 | | Troy Lee, Jérémie Roland: A strong direct product theorem for quantum query complexity. CoRR abs/1104.4468 (2011) |
| i10 | | Troy Lee, Frédéric Magniez, Miklos Santha: A learning graph based quantum query algorithm for finding constant-size subgraphs. CoRR abs/1109.5135 (2011) |
| 2010 | ||
| c13 | | |
| i9 | | Troy Lee, Shengyu Zhang: Composition theorems in communication complexity. CoRR abs/1003.1443 (2010) |
| 2009 | ||
| j7 | | Troy Lee, Adi Shraibman: Disjointness is Hard in the Multiparty Number-on-the-Forehead Model. Computational Complexity 18(2): 309-336 (2009) |
| j6 | | Troy Lee, Adi Shraibman: Lower Bounds in Communication Complexity. Foundations and Trends in Theoretical Computer Science 3(4): 263-398 (2009) |
| c12 | | Troy Lee, Gideon Schechtman, Adi Shraibman: Lower Bounds on Quantum Multiparty Communication Complexity. IEEE Conference on Computational Complexity 2009: 254-262 |
| c11 | | Troy Lee, Adi Shraibman: An Approximation Algorithm for Approximation Rank. IEEE Conference on Computational Complexity 2009: 351-357 |
| i8 | | |
| 2008 | ||
| c10 | | Troy Lee, Adi Shraibman, Robert Spalek: A Direct Product Theorem for Discrepancy. IEEE Conference on Computational Complexity 2008: 71-80 |
| c9 | | Troy Lee, Adi Shraibman: Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model. IEEE Conference on Computational Complexity 2008: 81-91 |
| c8 | | |
| c7 | | Andrew M. Childs, Troy Lee: Optimal Quantum Adversary Lower Bounds for Ordered Search. ICALP (1) 2008: 869-880 |
| i7 | | |
| i6 | | Troy Lee, Adi Shraibman: An approximation algorithm for approximation rank. CoRR abs/0809.2093 (2008) |
| i5 | | 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 | ||
| c6 | | |
| c5 | | Peter Høyer, Troy Lee, Robert Spalek: Negative weights make adversaries stronger. STOC 2007: 526-535 |
| i4 | | Troy Lee, Adi Shraibman: Disjointness is hard in the multi-party number on the forehead model. CoRR abs/0712.4279 (2007) |
| 2006 | ||
| j5 | | Sophie Laplante, Troy Lee, Mario Szegedy: The Quantum Adversary Method and Classical Formula Size Lower Bounds. Computational Complexity 15(2): 163-196 (2006) |
| c4 | | Lance Fortnow, Troy Lee, Nikolai K. Vereshchagin: Kolmogorov Complexity with Error. STACS 2006: 137-148 |
| 2005 | ||
| j4 | | Harry Buhrman, Troy Lee, Dieter van Melkebeek: Language compression and pseudorandom generators. Computational Complexity 14(3): 228-255 (2005) |
| j3 | | Troy Lee, Andrei E. Romashchenko: Resource bounded symmetry of information revisited. Theor. Comput. Sci. 345(2-3): 386-405 (2005) |
| c3 | | Sophie Laplante, Troy Lee, Mario Szegedy: The Quantum Adversary Method and Classical Formula Size Lower Bounds. IEEE Conference on Computational Complexity 2005: 76-90 |
| 2004 | ||
| c2 | | Harry Buhrman, Troy Lee, Dieter van Melkebeek: Language Compression and Pseudorandom Generators. IEEE Conference on Computational Complexity 2004: 15-28 |
| c1 | | Troy Lee, Andrei E. Romashchenko: On Polynomially Time Bounded Symmetry of Information. MFCS 2004: 463-475 |
| i3 | | Troy Lee, Dieter van Melkebeek, Harry Buhrman: Language Compression and Pseudorandom Generators. Electronic Colloquium on Computational Complexity (ECCC)(002) (2004) |
| i2 | | Troy Lee, Andrei E. Romashchenko: On Polynomially Time Bounded Symmetry of Information. Electronic Colloquium on Computational Complexity (ECCC)(031) (2004) |
| i1 | | Lance Fortnow, Troy Lee, Nikolai K. Vereshchagin: Kolmogorov Complexity with Error. Electronic Colloquium on Computational Complexity (ECCC)(080) (2004) |
| 2003 | ||
| j2 | | |
| 2002 | ||
| j1 | | Valery Tereshko, Troy Lee: How Information-Mapping Patterns Determine Foraging Behaviour of a Honey Bee Colony. Open Syst. Inform. Dynam. 9(2): 181-194 (2002) |
Data released under the ODC-BY 1.0 license — See also our legal information page