Department of Computer Science, Aarhus University (official personal page).
PhD, Aarhus University, 2006 (genealogy).
Previously I was at The University of Chicago for 1 year, funded by a Villum Kann Rasmussen postdoc fellowship, and at Aarhus University in a postdoc position for 2 years, funded by The Carlsberg Foundation.
My main research interest is computational complexity theory, in particular Boolean circuit complexity. Additional interests include algorithms and game theory.
Online publications (locally)
Google Scholar Citations
Optimization, Spring 2015
Computational Complexity Theory, Fall 2014
Combinatorial Search, Spring 2014
Optimization, Spring 2014
Approximation Algorithms, Fall 2013
Combinatorial Search, Spring 2013
Optimization, Spring 2013
Computational Complexity Theory, Fall 2012
Combinatorial Search, Spring 2012
Optimization, Spring 2012
Combinatorial Search, Spring 2011
Optimization, Spring 2011
Computational Complexity Theory, Fall 2010
Combinatorial Search, Spring 2010
Optimization, Spring 2010
Combinatorial Search, Spring 2009
Computational Complexity Theory, Fall 2008
Combinatorial Search, Spring 2008
Kristoffer Arnsfelt Hansen
Department of Computer Science
IT-Parken, Aabogade 34
DK-8200 Aarhus N
Algebra and Computation Seminars 2005-2006
ACM ICPC local contest page 2001