| | |
- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| 6 |      | Trinh Huynh, Jakob Nordström: On the virtue of succinct proofs: amplifying communication complexity hardness to time-space trade-offs in proof complexity. STOC 2012: 233-248 |
| 5 | | Paul Beame, Trinh Huynh: Multiparty Communication Complexity and Threshold Circuit Size of sfAC0. SIAM J. Comput. 41(3): 484-518 (2012) |
| 4 | | Paul Beame, Trinh Huynh: The Value of Multiple Read/Write Streams for Approximating Frequency Moments. TOCT 3(2): 6 (2012) |
| 2010 | ||
| 3 | | Paul Beame, Trinh Huynh, Toniann Pitassi: Hardness amplification in proof complexity. STOC 2010: 87-96 |
| 2009 | ||
| 2 | | Paul Beame, Trinh Huynh, Toniann Pitassi: Hardness Amplification in Proof Complexity CoRR abs/0912.0568: (2009) |
| 1 | | Paul Beame, Trinh Huynh: Hardness Amplification in Proof Complexity. Electronic Colloquium on Computational Complexity (ECCC) 16: 72 (2009) |
| 1 | Paul Beame | [1] [2] [3] [4] [5] |
| 2 | Jakob Nordström | [6] |
| 3 | Toniann Pitassi | [2] [3] |
Colors in the list of coauthors
Last update Thu May 31 18:55:10 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page