Troy Lee

	2012
33		Troy Lee, Dirk Oliver Theis: Lower bounds for sizes of semidefinite formulations for some combinatorial optimization problems CoRR abs/1203.3961: (2012)
32		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
31		Troy Lee, Rajat Mittal, Ben W. Reichardt, Robert Spalek, Mario Szegedy: Quantum Query Complexity of State Conversion. FOCS 2011: 344-353
30		Troy Lee, Jérémie Roland: A strong direct product theorem for quantum query complexity CoRR abs/1104.4468: (2011)
29		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
28		Troy Lee, Shengyu Zhang: Composition Theorems in Communication Complexity. ICALP (1) 2010: 475-489
27		Troy Lee, Shengyu Zhang: Composition theorems in communication complexity CoRR abs/1003.1443: (2010)
	2009
26		Troy Lee, Gideon Schechtman, Adi Shraibman: Lower Bounds on Quantum Multiparty Communication Complexity. IEEE Conference on Computational Complexity 2009: 254-262
25		Troy Lee, Adi Shraibman: An Approximation Algorithm for Approximation Rank. IEEE Conference on Computational Complexity 2009: 351-357
24		Troy Lee: A note on the sign degree of formulas CoRR abs/0909.4607: (2009)
23		Troy Lee, Adi Shraibman: Disjointness is Hard in the Multiparty Number-on-the-Forehead Model. Computational Complexity 18(2): 309-336 (2009)
22		Troy Lee, Adi Shraibman: Lower Bounds in Communication Complexity. Foundations and Trends in Theoretical Computer Science 3(4): 263-398 (2009)
	2008
21		Troy Lee, Rajat Mittal: Product Theorems Via Semidefinite Programming. ICALP (1) 2008: 674-685
20		Andrew M. Childs, Troy Lee: Optimal Quantum Adversary Lower Bounds for Ordered Search. ICALP (1) 2008: 869-880
19		Troy Lee, Adi Shraibman, Robert Spalek: A Direct Product Theorem for Discrepancy. IEEE Conference on Computational Complexity 2008: 71-80
18		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		Troy Lee, Rajat Mittal: Product theorems via semidefinite programming CoRR abs/0803.4206: (2008)
16		Troy Lee, Adi Shraibman: An approximation algorithm for approximation rank CoRR abs/0809.2093: (2008)
15		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		Troy Lee: A New Rank Technique for Formula Size Lower Bounds. STACS 2007: 145-156
13		Peter Høyer, Troy Lee, Robert Spalek: Negative weights make adversaries stronger. STOC 2007: 526-535
12		Troy Lee, Adi Shraibman: Disjointness is hard in the multi-party number on the forehead model CoRR abs/0712.4279: (2007)
	2006
11		Lance Fortnow, Troy Lee, Nikolai K. Vereshchagin: Kolmogorov Complexity with Error. STACS 2006: 137-148
10		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		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		Harry Buhrman, Troy Lee, Dieter van Melkebeek: Language compression and pseudorandom generators. Computational Complexity 14(3): 228-255 (2005)
7		Troy Lee, Andrei E. Romashchenko: Resource bounded symmetry of information revisited. Theor. Comput. Sci. 345(2-3): 386-405 (2005)
	2004
6		Harry Buhrman, Troy Lee, Dieter van Melkebeek: Language Compression and Pseudorandom Generators. IEEE Conference on Computational Complexity 2004: 15-28
5		Troy Lee, Andrei E. Romashchenko: On Polynomially Time Bounded Symmetry of Information. MFCS 2004: 463-475
4		Troy Lee, Dieter van Melkebeek, Harry Buhrman: Language Compression and Pseudorandom Generators Electronic Colloquium on Computational Complexity (ECCC)(002): (2004)
3		Troy Lee, Andrei E. Romashchenko: On Polynomially Time Bounded Symmetry of Information Electronic Colloquium on Computational Complexity (ECCC)(031): (2004)
2		Lance Fortnow, Troy Lee, Nikolai K. Vereshchagin: Kolmogorov Complexity with Error Electronic Colloquium on Computational Complexity (ECCC)(080): (2004)
	2003
1		Troy Lee: Arithmetical definability over finite structures. Math. Log. Q. 49(4): 385-392 (2003)

Coauthor Index

1	Harry Buhrman	[4] [6] [8]
2	Andrew M. Childs	[20]
3	Lance Fortnow	[2] [11]
4	Peter Høyer	[13]
5	Gábor Ivanyos	[32]
6	Hartmut Klauck	[32]
7	Sophie Laplante	[9] [10]
8	Frédéric Magniez	[29]
9	Dieter van Melkebeek	[4] [6] [8]
10	Rajat Mittal	[17] [21] [31]
11	Ben Reichardt (Ben W. Reichardt)	[31]
12	Jérémie Roland	[30]
13	Andrei E. Romashchenko	[3] [5] [7]
14	Miklos Santha	[29] [32]
15	Gideon Schechtman	[26]
16	Adi Shraibman	[12] [15] [16] [18] [19] [22] [23] [25] [26]
17	Robert Spalek	[13] [19] [31]
18	Mario Szegedy	[9] [10] [31]
19	Dirk Oliver Theis	[33]
20	Nikolai K. Vereshchagin (Nikolay K. Vereshchagin)	[2] [11]
21	Ronald de Wolf	[32]
22	Shengyu Zhang	[27] [28]

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page