Prof. Johan Håstad (Sweden) 29.11.2012

City of Poznań and the Adam Mickiewicz University are inviting to a open lecture "Lazy verification of proofs and hard problems" which will be delivered by prof. Johan Håstad - a prominent expert in the field of theoretical computer science. Lecture will be held on 29 November 2012, at 15:30 (3:30 pm.) in the A Auditorium in Department of Mathematics and Computer Science, 87 Umultowska Street in Poznań.

Johan Håstad is a prominent Swedish professor of theoretical computer science, best known for his achievements in the theory of computational complexity. Since 1992 he is a professor of theoretical computer science at the Royal Institute of Technology (KTH) in Stockholm. Johan Håstad is also a member of the Royal Swedish Academy of Sciences (since 2001), member of the board in School of Computer Science and Communication, KTH (2005-2011), deputy director of the Center for Industrial and Applied Mathematics, CIAM (since 2006), member of the Nevanlinna Prize Committee, ICM (2006), member of the board in Stockholm Mathematics Center (since 2009). Although much of the theoretical nature of his research, he is also a co-author of a patent related to electronic transactions. Johan Håstad was also a member of the program committees of major conferences in theoretical computer science and cryptology: Eurocrypt 1989, SWAT 1990, STACS 1991, STOC 1992, ICALP 1993, FOCS 1994, ESA 1996, CRYPTO 1998, Approx 1998, ICALP 2002, CRYPTO 2002, STOC 2003, Computational Complexity 2003, FOCS 2004, Eurocrypt 2005, Random 2005, Theory of Cryptography Conference 2006, ICALP 2006, Approx 2006, SWAT 2008, ESA 2008, Computational Complexity 2009 (chair), Theory of Cryptography Conference 2010, Crypto 2010, ITCS 2012. Also an editor in such magazines as: Computational Complexity (since 1991), Theory of Computing (2004), Random Structures and Algorithms (2008), ACM Transactions on Computation Theory (2008), Information Processing Letter (1990-1993), SIAM Journal on Computing (1991-1999) and the Journal of the ACM (1997-2003). He is also known as a member of the Scientific Committee Electronic Colloquium on Computational Complexity.

Johan Håstad received twice the most prestigious award in theoretical computer science - Gödel Prize (in 1994 and 2011). Other acquired awards are: ACM doctoral dissertation award (1986), Chester Carlson's research prize (1990), Göran Gustafsson prize in mathematics (1999). Johan Håstad was also invited to give a lecture at ICM in Berlin (1998), and a plenary lecture at the ECM in Stockholm (2004). In 2008, Johan Håstad obtained a prestigious ERC grant, assigned for the best researchers in Europe (over 2 million euros) for research in 2009-2013.

This article has more than one page. Choose below next page, to read further