| | |
- CSB - MetaPress - Google - Bing - Yahoo
 | 2009 | |
|---|---|---|
| 8 |      | Shankar Kalyanaraman, Christopher Umans: The Complexity of Rationalizing Network Formation. FOCS 2009: 485-494 |
| 7 | | Shankar Kalyanaraman, Christopher Umans: The Complexity of Rationalizing Network Formation. Electronic Colloquium on Computational Complexity (ECCC) 16: 145 (2009) |
| 2008 | ||
| 6 | | Shankar Kalyanaraman, Christopher Umans: The Complexity of Rationalizing Matchings. ISAAC 2008: 171-182 |
| 5 | | Shankar Kalyanaraman, Christopher Umans: The Complexity of Rationalizing Matchings. Electronic Colloquium on Computational Complexity (ECCC) 15(021): (2008) |
| 2007 | ||
| 4 | | Shankar Kalyanaraman, Christopher Umans: Algorithms for Playing Games with Limited Randomness. ESA 2007: 323-334 |
| 3 | | Shankar Kalyanaraman, Christopher Umans: Algorithms for Playing Games with Limited Randomness. Electronic Colloquium on Computational Complexity (ECCC) 14(059): (2007) |
| 2006 | ||
| 2 | | Shankar Kalyanaraman, Christopher Umans: On Obtaining Pseudorandomness from Error-Correcting Codes. FSTTCS 2006: 105-116 |
| 1 | | Shankar Kalyanaraman, Christopher Umans: On obtaining pseudorandomness from error-correcting codes.. Electronic Colloquium on Computational Complexity (ECCC) 13(128): (2006) |
| 1 | Christopher Umans | [1] [2] [3] [4] [5] [6] [7] [8] |
Data released under the ODC-BY 1.0 license — See also our legal information page