Search the dblp DataBase

Publications of Author

1. Paul Valiant
   The Tensor Product of Two Codes Is Not Necessarily Robustly Testable. [Citation Graph (0, 0)][DBLP]
   APPROX-RANDOM, 2005, pp:472-481 [Conf]
   
2. Timothy Abbott, Daniel Kane, Paul Valiant
   On the Complexity of Two-PlayerWin-Lose Games. [Citation Graph (0, 0)][DBLP]
   FOCS, 2005, pp:113-122 [Conf]
   
3. Mart de Graaf, Paul Valiant
   Comparing EQP and MOD_{p^k}P using Polynomial Degree Lower Bounds [Citation Graph (0, 0)][DBLP]
   CoRR, 2002, v:0, n:, pp:- [Journal]
   
4. Paul Valiant
   The Log-Rank Conjecture and low degree polynomials. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:89, n:2, pp:99-103 [Journal]
   
5. Mart de Graaf, Paul Valiant
   Polynomial Representations of Symmetric Partial Boolean Functions. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 2005, v:19, n:2, pp:481-488 [Journal]
   
6. Mythili Vutukuru, Paul Valiant, Swastik Kopparty, Hari Balakrishnan
   How to Construct a Correct and Scalable iBGP Configuration. [Citation Graph (0, 0)][DBLP]
   INFOCOM, 2006, pp:- [Conf]
   
7. Xi Chen, Shang-Hua Teng, Paul Valiant
   The approximation complexity of win-lose games. [Citation Graph (0, 0)][DBLP]
   SODA, 2007, pp:159-168 [Conf]
   
8. 
   On the complexity of Nash equilibria of action-graph games. [Citation Graph (, )][DBLP]
   
   
9. 
   Testing symmetric properties of distributions. [Citation Graph (, )][DBLP]
   
   
10. 
    Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency. [Citation Graph (, )][DBLP]
    
    
11. 
    Robustly Leveraging Collusion in Combinatorial Auctions. [Citation Graph (, )][DBLP]
    
    
12. 
    On the Complexity of Nash Equilibria of Action-Graph Games [Citation Graph (, )][DBLP]
    
    
13. 
    Size Bounds for Conjunctive Queries with General Functional Dependencies [Citation Graph (, )][DBLP]
    
    
14. 
    Testing Symmetric Properties of Distributions. [Citation Graph (, )][DBLP]