Follow
Kristoffer Arnsfelt Hansen
Kristoffer Arnsfelt Hansen
Associate Professor, Department of Computer Science, Aarhus University
Verified email at cs.au.dk - Homepage
Title
Cited by
Cited by
Year
Exact algorithms for solving stochastic games
KA Hansen, M Koucký, N Lauritzen, PB Miltersen, EP Tsigaridas
Proc. 43rd Annual ACM Symp. Theory of Computing (STOC), 2011
602011
The computational complexity of trembling hand perfection and other equilibrium refinements
KA Hansen, PB Miltersen, TB Sørensen
International Symposium on Algorithmic Game Theory, 198-209, 2010
352010
Exact threshold circuits
KA Hansen, VV Podolskii
2010 IEEE 25th Annual Conference on Computational Complexity, 270-279, 2010
352010
The complexity of solving reachability games using value and strategy iteration
K Hansen, R Ibsen-Jensen, P Miltersen
Computer Science–Theory and Applications, 77-90, 2011
342011
Winning concurrent reachability games requires doubly-exponential patience
KA Hansen, M Koucky, PB Miltersen
2009 24th Annual IEEE Symposium on Logic In Computer Science, 332-341, 2009
332009
Tight Bounds Computing Error-Correcting Codes by Bounded-Depth Circuits With Arbitrary Gates
A Gal, K Hansen, M Koucky, P Pudlák, E Viola
IEEE, 2013
282013
Approximability and parameterized complexity of minmax values
KA Hansen, TD Hansen, PB Miltersen, TB Sørensen
International Workshop on Internet and Network Economics, 684-695, 2008
272008
Polynomial threshold functions and Boolean threshold circuits
KA Hansen, VV Podolskii
Information and Computation 240, 56-73, 2015
262015
Computation of Stackelberg equilibria of finite sequential games
B Bošanský, S Brânzei, KA Hansen, TB Lund, PB Miltersen
ACM Transactions on Economics and Computation (TEAC) 5 (4), 1-24, 2017
232017
Constant width planar computation characterizes ACC^0
KA Hansen
Theory of Computing Systems 39 (1), 79-92, 2006
232006
Weights of exact threshold functions
L Babai, KA Hansen, VV Podolskii, X Sun
International Symposium on Mathematical Foundations of Computer Science, 66-77, 2010
222010
Dynamic matchings in convex bipartite graphs
GS Brodal, L Georgiadis, KA Hansen, I Katriel
International Symposium on Mathematical Foundations of Computer Science, 406-417, 2007
202007
Some meet-in-the-middle circuit lower bounds
KA Hansen, PB Miltersen
International Symposium on Mathematical Foundations of Computer Science, 334-345, 2004
202004
Truthful facility assignment with resource augmentation: An exact analysis of serial dictatorship
I Caragiannis, A Filos-Ratsikas, SKS Frederiksen, KA Hansen, Z Tan
Mathematical Programming, 1-30, 2022
192022
Deterministic graphical games revisited
D Andersson, K Arnsfelt Hansen, P Bro Miltersen, T Bjerre Sørensen
Journal of Logic and Computation 22 (2), 165-178, 2012
19*2012
A new characterization of ACC^0 and probabilistic CC^0
KA Hansen, M Koucký
Computational Complexity 19 (2), 211-234, 2010
192010
Low rank approximation of binary matrices: Column subset selection and generalizations
C Dan, KA Hansen, H Jiang, L Wang, Y Zhou
arXiv preprint arXiv:1511.01699, 2015
182015
Lower bounds for circuits with few modular and symmetric gates
A Chattopadhyay, K Hansen
Automata, Languages and Programming, 102-102, 2005
172005
The complexity of approximating a trembling hand perfect equilibrium of a multi-player game in strategic form
K Etessami, KA Hansen, PB Miltersen, TB Sørensen
International Symposium on Algorithmic Game Theory, 231-243, 2014
152014
Computational complexity of proper equilibrium
KA Hansen, TB Lund
Proceedings of the 2018 ACM Conference on Economics and Computation, 113-130, 2018
142018
The system can't perform the operation now. Try again later.
Articles 1–20