| 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 | 73 | 2011 |
| 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 | 46 | 2010 |
| Exact threshold circuits KA Hansen, VV Podolskii 2010 IEEE 25th Annual Conference on Computational Complexity, 270-279, 2010 | 45 | 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 | 42 | 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 | 41 | 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 | 37* | 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 | 37 | 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 | 35 | 2013 |
| 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 | 35 | 2008 |
| Polynomial threshold functions and Boolean threshold circuits KA Hansen, VV Podolskii Information and Computation 240, 56-73, 2015 | 34 | 2015 |
| 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 | 32 | 2022 |
| 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 | 31 | 2015 |
| Fixp-membership via convex optimization: Games, cakes, and markets A Filos-Ratsikas, KA Hansen, K Høgh, A Hollender SIAM Journal on Computing, FOCS21-30-FOCS21-84, 2023 | 27 | 2023 |
| Weights of exact threshold functions L Babai, KA Hansen, VV Podolskii, X Sun International Symposium on Mathematical Foundations of Computer Science, 66-77, 2010 | 27 | 2010 |
| Constant width planar computation characterizes ACC^0 KA Hansen Theory of Computing Systems 39 (1), 79-92, 2006 | 26 | 2006 |
| 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 | 25 | 2007 |
| 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 | 24* | 2012 |
| A new characterization of ACC^0 and probabilistic CC^0 KA Hansen, M Koucký Computational Complexity 19 (2), 211-234, 2010 | 23 | 2010 |
| Some meet-in-the-middle circuit lower bounds KA Hansen, PB Miltersen International Symposium on Mathematical Foundations of Computer Science, 334-345, 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 | 18 | 2018 |
Peter Bro MiltersenFormer Professor of Computer Science at Aarhus UniversityVerified email at cs.au.dk
