| | |
- CSB - MetaPress - Google - Bing - Yahoo
 | 2005 | |
|---|---|---|
| 5 |      | Gustav Hast: Beating a Random Assignment. APPROX-RANDOM 2005: 134-145 |
| 4 | | Gustav Hast: Approximating - Outperforming a Random Assignment with Almost a Linear Factor. ICALP 2005: 956-968 |
| 2004 | ||
| 3 | | Gustav Hast: Approximating Max kCSP Using Random Restrictions. APPROX-RANDOM 2004: 151-162 |
| 2 | | Gustav Hast: Nearly One-Sided Tests and the Goldreich?Levin Predicate. J. Cryptology 17(3): 209-229 (2004) |
| 2003 | ||
| 1 | | Gustav Hast: Nearly One-Sided Tests and the Goldreich-Levin Predicate. EUROCRYPT 2003: 195-210 |
Data released under the ODC-BY 1.0 license — See also our legal information page