Ben Livshits from Microsoft Research, a well-known profile within the area of secure software, acted as opponent at the PhD defence by John Wilander within the area of software security. The seminar was attended by a large audience from the industry including several LiU alumni.
By relating complexity issues in constraint satisfaction problems to properties of graphs and their structure Tommy Färnqvist has in a recent PhD shown that a large class of applications e.g. in database search or AI do not have efficient solutions, thus not polynomially solvable. He has thereafter found a metric to relate problems that are approximation friendly.
Anders Haraldsson, one of the early pioneers of computer science in Sweden, and an inspiration engine on teaching and learning for generations of computer scientists, was thanked in a touching show of support by students and colleagues at IDA on the occasion of his retirement.
Coming Up Soon
Page responsible: Webmaster