Prize for final year project theses 2012

One Bachelor and one Master level thesis were awarded by Swedish Computer Society (East) for best IT thesis in 2012. Bernhard Hahn did his thesis at IDA on analysis of algorithms for smart recipe suggestions on social platforms. Simon Tegelid and Johan Kihlberg were awarded the prize for map-assisted indoor positioning.

Software: security requirements and secure programming

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.

Exploiting Structure in CSP-related Problems

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.