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 | 64 | 2011 |
Exact threshold circuits KA Hansen, VV Podolskii 2010 IEEE 25th Annual Conference on Computational Complexity, 270-279, 2010 | 43 | 2010 |
The computational complexity of trembling hand perfection and other equilibrium refinements KA Hansen, PB Miltersen, TB Sørensen Algorithmic Game Theory: Third International Symposium, SAGT 2010, Athens …, 2010 | 41 | 2010 |
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 | 37 | 2011 |
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 | 35 | 2009 |
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 | 31* | 2022 |
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 | 30 | 2017 |
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 | 30 | 2013 |
Polynomial threshold functions and Boolean threshold circuits KA Hansen, VV Podolskii Information and Computation 240, 56-73, 2015 | 29 | 2015 |
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 | 28 | 2015 |
Approximability and parameterized complexity of minmax values KA Hansen, TD Hansen, PB Miltersen, TB Sørensen Internet and Network Economics: 4th International Workshop, WINE 2008 …, 2008 | 28 | 2008 |
On the computational complexity of decision problems about multi-player Nash equilibria MLT Berthelsen, KA Hansen Theory of Computing Systems 66 (3), 519-545, 2022 | 25 | 2022 |
Weights of exact threshold functions L Babai, KA Hansen, VV Podolskii, X Sun Mathematical Foundations of Computer Science 2010: 35th International …, 2010 | 24 | 2010 |
Constant width planar computation characterizes ACC^0 KA Hansen Theory of Computing Systems 39 (1), 79-92, 2006 | 24 | 2006 |
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 | 22* | 2012 |
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 | 22 | 2007 |
A new characterization of ACC^0 and probabilistic CC^0 KA Hansen, M Koucký Computational Complexity 19 (2), 211-234, 2010 | 21 | 2010 |
Some meet-in-the-middle circuit lower bounds KA Hansen, PB Miltersen Mathematical Foundations of Computer Science 2004: 29th International …, 2004 | 20 | 2004 |
Computational complexity of proper equilibrium KA Hansen, TB Lund Proceedings of the 2018 ACM conference on economics and computation, 113-130, 2018 | 17 | 2018 |
Lower bounds for circuits with few modular and symmetric gates A Chattopadhyay, K Hansen Automata, Languages and Programming, 102-102, 2005 | 17 | 2005 |