Search the dblp DataBase

Publications of Author

1. 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]
   
2. 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]
   
3. Troy Lee, Andrei E. Romashchenko
   On Polynomially Time Bounded Symmetry of Information. [Citation Graph (0, 0)][DBLP]
   MFCS, 2004, pp:463-475 [Conf]
   
4. Lance Fortnow, Troy Lee, Nikolai K. Vereshchagin
   Kolmogorov Complexity with Error. [Citation Graph (0, 0)][DBLP]
   STACS, 2006, pp:137-148 [Conf]
   
5. Troy Lee
   A New Rank Technique for Formula Size Lower Bounds. [Citation Graph (0, 0)][DBLP]
   STACS, 2007, pp:145-156 [Conf]
   
6. 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]
   
7. 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]
   
8. 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]
   
9. 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]
   
10. 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]
    
11. Troy Lee
    Arithmetical definability over finite structures. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2003, v:49, n:4, pp:385-392 [Journal]
    
12. 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]
    
13. Peter Høyer, Troy Lee, Robert Spalek
    Negative weights make adversaries stronger. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:526-535 [Conf]
    
14. 
    A Direct Product Theorem for Discrepancy. [Citation Graph (, )][DBLP]
    
    
15. 
    Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model. [Citation Graph (, )][DBLP]
    
    
16. 
    An Approximation Algorithm for Approximation Rank. [Citation Graph (, )][DBLP]
    
    
17. 
    Lower Bounds on Quantum Multiparty Communication Complexity. [Citation Graph (, )][DBLP]
    
    
18. 
    Product Theorems Via Semidefinite Programming. [Citation Graph (, )][DBLP]
    
    
19. 
    Optimal Quantum Adversary Lower Bounds for Ordered Search. [Citation Graph (, )][DBLP]
    
    
20. 
    Composition Theorems in Communication Complexity. [Citation Graph (, )][DBLP]
    
    
21. 
    Disjointness is Hard in the Multiparty Number-on-the-Forehead Model. [Citation Graph (, )][DBLP]
    
    
22. 
    Disjointness is hard in the multi-party number on the forehead model [Citation Graph (, )][DBLP]
    
    
23. 
    Product theorems via semidefinite programming [Citation Graph (, )][DBLP]
    
    
24. 
    An approximation algorithm for approximation rank [Citation Graph (, )][DBLP]
    
    
25. 
    A note on the sign degree of formulas [Citation Graph (, )][DBLP]
    
    
26. 
    Composition theorems in communication complexity [Citation Graph (, )][DBLP]
    
    
27. 
    Disjointness is hard in the multi-party number-on-the-forehead model. [Citation Graph (, )][DBLP]