Kontakt
bild3 bild2 bild1
Skolan för
datavetenskap
och kommunikation

Gustav Hast's publications

Cryptography
  • G. Hast, Nearly One-Sided Tests and the Goldreich-Levin Predicate, EUROCRYPT 2003: 195-210.

  • G. Hast, Nearly One-Sided Tests and the Goldreich-Levin Predicate, J. Cryptology 17(3): 209-229 (2004).

Approximation algorithms
  • G. Hast, Approximating Max kCSP using random restrictions, APPROX-RANDOM 2004: 151-162. Full paper (.ps)
  • G. Hast, Approximating Max kCSP - Outperforming a Random Assignment with Almost a Linear Factor. To appear in ICALP 2005. Conference paper (.ps)
Dissertation
  • G. Hast, Beating a Random Assignment. Doctoral Thesis in Computer Science, Royal Institute of Technology, 2005. Electronic version (.pdf)
Sidansvarig: Gustav Hast <gustav.hast@gmail.com>
Uppdaterad: 2005-09-13