||My user name is johanh and this should be followed by
the at sign and then kth.se|
|Office phone:||+46 8 790 66 91|
|Address:||Mathematics KTH, SE-100 44 Stockholm, Sweden|
|Visiting address:||Linstedsvagen 15, floor 6, room 3634|
|Home address:||Karlavägen 28, 5 tr, 114 31 Stockholm|
|Private phone:||+46 70 565 5211|
I am professor in theoretical computer science the
at SCI, the school
of Engineering Sciences at
The safest way to reach me is by email.
In the spring of 2020 I am teaching
groups and rings .
Open graduate student positions
I am currently looking a new graduate students in
theory focusing on the
approximability of NP-hard optimization problems. The deadline
for this position is April 23.
I am interested in computation complexity and in particular efficent approximation algoritms and circuit complexity.
I am the chairman for the class of mathematics and a member of
the board of
the Royal Swedish Academy of Sciences.
I am the chairman for the program group for mathematical foundations of AI
which is financed by the
Knut and Alice Wallenberg foundation
I am involved in the center for
I am an editor for the journals
Theory of Computing,
Random Structures and Algorithms
ACM Transactions on Computation Theory.
- My CV.
- Some of my papers, available on-line
(updated at irregular intervals).
- Some of my talks, available on-line.
- An old set of lecture notes
on complexity theory (130 pages). pdf
- A set of notes for my course "Advanced algorithms".
They are revised at regular intervals but you are always free to
take the last version. They are currently 182 pages. There
is also a gzipped version which is
490 Kbytes large. Also available as pdf.
Responsible for this page: <Johan Håstad>
Latest change January 16, 2020