The SCEAS System
| |||||||

## Search the dblp DataBase
Troy Lee:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Harry Buhrman, Troy Lee, Dieter van Melkebeek
**Language Compression and Pseudorandom Generators.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2004, pp:15-28 [Conf] - Sophie Laplante, Troy Lee, Mario Szegedy
**The Quantum Adversary Method and Classical Formula Size Lower Bounds.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2005, pp:76-90 [Conf] - Troy Lee, Andrei E. Romashchenko
**On Polynomially Time Bounded Symmetry of Information.**[Citation Graph (0, 0)][DBLP] MFCS, 2004, pp:463-475 [Conf] - Lance Fortnow, Troy Lee, Nikolai K. Vereshchagin
**Kolmogorov Complexity with Error.**[Citation Graph (0, 0)][DBLP] STACS, 2006, pp:137-148 [Conf] - Troy Lee
**A New Rank Technique for Formula Size Lower Bounds.**[Citation Graph (0, 0)][DBLP] STACS, 2007, pp:145-156 [Conf] - Harry Buhrman, Troy Lee, Dieter van Melkebeek
**Language compression and pseudorandom generators.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 2005, v:14, n:3, pp:228-255 [Journal] - Sophie Laplante, Troy Lee, Mario Szegedy
**The Quantum Adversary Method and Classical Formula Size Lower Bounds.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 2006, v:15, n:2, pp:163-196 [Journal] - Troy Lee, Dieter van Melkebeek, Harry Buhrman
**Language Compression and Pseudorandom Generators**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:002, pp:- [Journal] - Troy Lee, Andrei E. Romashchenko
**On Polynomially Time Bounded Symmetry of Information**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:031, pp:- [Journal] - Lance Fortnow, Troy Lee, Nikolai K. Vereshchagin
**Kolmogorov Complexity with Error**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:080, pp:- [Journal] - Troy Lee
**Arithmetical definability over finite structures.**[Citation Graph (0, 0)][DBLP] Math. Log. Q., 2003, v:49, n:4, pp:385-392 [Journal] - Troy Lee, Andrei E. Romashchenko
**Resource bounded symmetry of information revisited.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:345, n:2-3, pp:386-405 [Journal] - Peter Høyer, Troy Lee, Robert Spalek
**Negative weights make adversaries stronger.**[Citation Graph (0, 0)][DBLP] STOC, 2007, pp:526-535 [Conf] **A Direct Product Theorem for Discrepancy.**[Citation Graph (, )][DBLP]**Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model.**[Citation Graph (, )][DBLP]**An Approximation Algorithm for Approximation Rank.**[Citation Graph (, )][DBLP]**Lower Bounds on Quantum Multiparty Communication Complexity.**[Citation Graph (, )][DBLP]**Product Theorems Via Semidefinite Programming.**[Citation Graph (, )][DBLP]**Optimal Quantum Adversary Lower Bounds for Ordered Search.**[Citation Graph (, )][DBLP]**Composition Theorems in Communication Complexity.**[Citation Graph (, )][DBLP]**Disjointness is Hard in the Multiparty Number-on-the-Forehead Model.**[Citation Graph (, )][DBLP]**Disjointness is hard in the multi-party number on the forehead model**[Citation Graph (, )][DBLP]**Product theorems via semidefinite programming**[Citation Graph (, )][DBLP]**An approximation algorithm for approximation rank**[Citation Graph (, )][DBLP]**A note on the sign degree of formulas**[Citation Graph (, )][DBLP]**Composition theorems in communication complexity**[Citation Graph (, )][DBLP]**Disjointness is hard in the multi-party number-on-the-forehead model.**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |