 | 2009 |
|---|
| 13 |       | Constantinos Daskalakis,
Grant Schoenebeck,
Gregory Valiant,
Paul Valiant:
On the complexity of Nash equilibria of action-graph games.
SODA 2009: 710-719 |
| 12 | | Gregory Valiant,
Paul Valiant:
Size Bounds for Conjunctive Queries with General Functional Dependencies
CoRR abs/0909.2030: (2009) |
| 2008 |
|---|
| 11 | | Paul Valiant:
Testing symmetric properties of distributions.
STOC 2008: 383-392 |
| 10 | | Paul Valiant:
Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency.
TCC 2008: 1-18 |
| 9 | | Constantinos Daskalakis,
Grant Schoenebeck,
Gregory Valiant,
Paul Valiant:
On the Complexity of Nash Equilibria of Action-Graph Games
CoRR abs/0802.1604: (2008) |
| 2007 |
|---|
| 8 | | Xi Chen,
Shang-Hua Teng,
Paul Valiant:
The approximation complexity of win-lose games.
SODA 2007: 159-168 |
| 7 | | Paul Valiant:
Testing Symmetric Properties of Distributions.
Electronic Colloquium on Computational Complexity (ECCC) 14(135): (2007) |
| 2006 |
|---|
| 6 | | Mythili Vutukuru,
Paul Valiant,
Swastik Kopparty,
Hari Balakrishnan:
How to Construct a Correct and Scalable iBGP Configuration.
INFOCOM 2006 |
| 2005 |
|---|
| 5 | | Paul Valiant:
The Tensor Product of Two Codes Is Not Necessarily Robustly Testable.
APPROX-RANDOM 2005: 472-481 |
| 4 | | Timothy G. Abbott,
Daniel Kane,
Paul Valiant:
On the Complexity of Two-PlayerWin-Lose Games.
FOCS 2005: 113-122 |
| 3 | | Mart de Graaf,
Paul Valiant:
Polynomial Representations of Symmetric Partial Boolean Functions.
SIAM J. Discrete Math. 19(2): 481-488 (2005) |
| 2004 |
|---|
| 2 | | Paul Valiant:
The Log-Rank Conjecture and low degree polynomials.
Inf. Process. Lett. 89(2): 99-103 (2004) |
| 2002 |
|---|
| 1 | | Mart de Graaf,
Paul Valiant:
Comparing EQP and MOD_{p^k}P using Polynomial Degree Lower Bounds
CoRR quant-ph/0211179: (2002) |
