2012

• Eickmeyer, K., Hansen, K. A., Verbin, E., 2012, "Approximating the minmax value of 3-player games within a constant is as hard as detecting planted cliques", Electronic Colloquium on Computational Complexity, vol. 19, nr. 25. Journal article
• Andersson, K. O. D., Hansen, K. A., Miltersen, P. B., Sørensen, T. B., 2012, "Deterministic Graphical Games Revisited", Journal of Logic and Computation, vol. 22, nr. 2, s. 165-178. Journal article

2011

• Frandsen, G. S., Sankowski, P., 2011, "Dynamic normal forms and dynamic characteristic polynomial", Theoretical Computer Science, vol. 412, nr. 16, s. 1470-1483. Journal article
• Hansen, K. A., Koucký, M., Lauritzen, N., Miltersen, P. B., Tsigaridas, E., 2011, "Exact algorithms for solving stochastic games", STOC'11, Association for Computing Machinery, New York, s. 205-214. Article in proceedings
• Friedmann, O., Hansen, T. D., Zwick, U., 2011, "A subexponential lower bound for the Random Facet algorithm for Parity Games", Proceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithms. SODA 2011, Society for Industriel & Applied Mathematics, s. 202-216. Article in proceedings
• Friedmann, O., Hansen, T. D., Zwick, U., 2011, "Subexponential lower bounds for randomized pivoting rules for the simplex algorithm", Proceedings of the 43rd annual ACM symposium on Theory of computing, Association for Computing Machinery, s. 283-292. Article in proceedings
• Hansen, K. A., Miltersen, P. B., Ibsen-Jensen, R., 2011, "The complexity of solving reachability games using value and strategy iteration", Lecture Notes in Computer Science, vol. 6651, s. 77-90. Conference article
• Chattopadhyay, A., Gavaldá, R., Hansen, K. A., Thérien, D., 2011, "Learning Read-constant Polynomials of Constant Degree modulo Composites", Lecture Notes in Computer Science, vol. 6651, s. 29-42. Conference article
• Gál, A., Hansen, K. A., Koucký, M., Pudlák, P., Viola, E., 2011, "Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates", Electronic Colloquium on Computational Complexity, vol. 18, nr. 150. Journal article
• Hansen, T. D., Miltersen, P. B., Zwick, U., 2011, "Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor", Proceedings of the Second Symposium on Innovations in Computer Science, Tsinghua University Press, Beijing, s. 253-263. Article in proceedings
• Hansen, K. A., Koucky, M., Lauritzen, N., Tsigaridas, E., 2011, "Separation bounds for real roots of polynomial systems". Paper
• Ibsen-Jensen, R., Miltersen, P. B., 2011, "Solving simple stochastic games with few coin toss positions". Working paper

2010

• Miltersen, P. B., Sørensen, T. B., 2010, "Computing a quasi-perfect equilibrium of a two-player game", Economic Theory, vol. 42, nr. 1, s. 175-192. Journal article
• Santillan, R., 2010, "Existence and Computation of Equilibria in Auction Games". Ph.d. thesis
• Babai, L., Hansen, K. A., Podolskii, V. V., Sun, X., 2010, "Weights of Exact Threshold Functions", Lecture Notes in Computer Science, vol. 6281, s. 66-77. Conference article
• Hansen, K. A., Podolskii, V. V., 2010, "Exact Threshold Circuits", I E E E Conference on Computational Complexity. Proceedings, s. 270-279. Conference article
• Hansen, K. A., Miltersen, P. B., Sørensen, T. B., 2010, "The computational complexity of trembling hand perfection and other equilibrium refinements", Lecture Notes in Computer Science, vol. 6386, s. 198-209. Conference article
• Andersson, K. O. D., Hansen, T. D., Gurvich, V., 2010, "On acyclicity of games with cycles", Discrete Applied Mathematics, vol. 158, nr. 10, s. 1049-1063. Journal article
• Hansen, T. D., Zwick, U., 2010, "Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles", Lecture Notes in Computer Science, vol. 6506, s. 415-426. Conference article

2009

• Miltersen, P. B., Allender, E., Burgisser, P., Kjeldgaard-Pedersen, J., 2009, "On the complexity of numerical analysis", S I A M Journal on Computing, vol. 38, nr. 5, s. 1987-2006. Journal article
• Andersson, D., Gurvich, V., Hansen, T. D., 2009, "On Acyclicity of Games with Cycles", Lecture Notes in Computer Science, s. 15-28. Conference article
• Miltersen, P. B., Nielsen, J. B., Triandopoulos, N., 2009, "Privacy-Enhancing Auctions Using Rational Cryptography", Lecture Notes in Computer Science, vol. 5677, s. 541-558. Conference article
• Frandsen, G. S., Frandsen, P. F., 2009, "Dynamic Matrix Rank", Theoretical Computer Science, vol. 410, nr. 41, s. 4085-4093. Journal article
• Hansen, K. A., Koucký, M., Miltersen, P. B., 2009, "Winning Concurrent Reachability Games Requires Doubly-Exponential Patience", Symposium on Logic in Computer Science, s. 332-341. Conference article
• Hansen, K. A., Lachish, O., Miltersen, P. B., 2009, "Hilbert's thirteenth problem and circuit complexity", Lecture Notes in Computer Science, vol. 5878, s. 153-162. Conference article
• Andersson, D., Miltersen, P. B., 2009, "The complexity of solving stochastic games on graphs", Lecture Notes in Computer Science, s. 112-121. Conference article
• Escamocher, G., Miltersen, P. B., Santillan, R., 2009, "Existence and computation of equilibria of first-price auctions with integral valuations and bids", S. Decker, K., Sichman, J. S., Sierra, C., Castelfranchi, C. (eds.), Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems (AAMAS'09), International Foundation for Autonomous Agents and Multiagent Systems, s. 1227-1228. Article in proceedings
• Bielikova, M., Nielsen, M., Kucera, A., Miltersen, P. B., Palamidessi, C., Tuma, P., Valencia, F., 2009, "SOFSEM 2009: Theory and Practice of Computer Science". Anthology
• Hansen, K. A., Koucký, M., 2009, "A new characterization of ACC⁰ and probabilistic CC⁰", I E E E Conference on Computational Complexity. Proceedings, s. 27-34. Conference article
• Hansen, K. A., 2009, "Depth Reduction for Circuits with a Single Layer of Modular Counting Gates", Lecture Notes in Computer Science, vol. 5675, s. 117-128. Conference article
• Hansen, T. D., Telelis, O., 2009, "Improved Bounds for Facility Location Games with Fair Cost Allocation", Lecture Notes in Computer Science, s. 174-185. Conference article
• Hansen, K. A., Koucký, M., 2009, "A New Characterization of ACC⁰ and Probabilistic CC⁰", Computational Complexity, vol. 19, nr. 2, s. 211-234. Journal article

2008

• Miltersen, P. B., Sørensen, T. B., 2008, "Fast algorithms for finding proper strategies in game trees", Huang, S. (eds.), Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industriel & Applied Mathematics, s. 874-883. Article in proceedings
• Hansen, K. A., 2008, "Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates", Lin, G. (eds.), Computing and Combinatorics, Springer, s. 448-458. Article in proceedings
• Hansen, T. D., Miltersen, P. B., Sørensen, T. B., 2008, "On Range of Skill", Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, AAAI Press, s. 277-282. Article in proceedings
• Andersson, D., Hansen, K. A., Miltersen, P. B., Sørensen, T. B., 2008, "Deterministic Graphical Games Revisited", Lecture Notes in Computer Science, vol. 5028, s. 1-10. Conference article
• Frandsen, G. S., Sankowski, P., 2008, "Dynamic Normal Forms and Dynamic Characteristic Polynomial", Lecture Notes in Computer Science, s. 434-446. Conference article
• Hansen, K. A., Hansen, T. D., Miltersen, P. B., Sørensen, T. B., 2008, "Approximability and Parameterized Complexity of Minmax Values", Lecture Notes in Computer Science, vol. 5385, s. 684-695. Conference article
• Hansen, T. D., Telelis, O. A., 2008, "On Pure and (approximate) Strong Equilibria of Facility Location Games", Lecture Notes in Computer Science, s. 490-497. Conference article
• Hansen, K. A., 2008, "Constant Width Planar Branching Programs Characterize ACC⁰ in Quasipolynomial Size", I E E E Conference on Computational Complexity. Proceedings, s. 92-99. Conference article
• Herings, P. J., Jurdzinski, M., Miltersen, P. B., Tardos, É., von Stengel, B., 2008, "Equilibrium Computation", Dagstuhl Seminar Proceedings, vol. 07471. Editorial
• Miltersen, P. B., 2008, "Conference on Computational Complexity 2007", Computational Complexity, vol. 17, nr. 2, s. 147-148. Journal article
• Miltersen, P. B., 2008, "Trembling hand perfection is NP-hard". Working paper
• Miltersen, P. B., Gurvich, V., Andersson, D., 2008, "The Complexity of Solving Stochastic Games on Graphs", Department of Computer Science, Aarhus University. Working paper

2007

• Miltersen, P. B., 1.7.2007, "Special issue of "Computational Complexity" for IEEE Conference on Computational Complexity, 2007", Mangler titel. Book chapter
• Brodal, G. S., Georgiadis, L., Hansen, K. A., Katriel, I., 2007, "Dynamic Matchings in Convex Bipartite Graphs", Kucera, L., Kucera, A. (eds.), Proc. 32nd International Symposium on Mathematical Foundations of Computer Science, Springer, s. 406-417. Article in proceedings
• Hansen, K. A., 2007, "On Modular Counting with Polynomials", 21st Annual IEEE Conference on Computational Complexity (CCC'06), IEEE Computer Society Press, s. 202-212. Article in proceedings
• Miltersen, P. B., Gal, A., 2007, "The Cell Probe Complexity of Succinct Data Structures", Theoretical Computer Science, vol. 379, nr. 3, s. 405-417. Journal article
• Miltersen, P. B., Sørensen, T. B., 2007, "Computing Proper Equilibria of Zero-Sum Games", Proceedings of the 5th International Conference on Computers and Games, Springer Verlag. ISBN-rødder: 0-978, s. 200-211. Article in proceedings
• Miltersen, P. B., Sørensen, T. B., 2007, "A Near-Optimal Strategy for a Heads-Up No-Limit Texas Hold'em Poker Tournament", Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems, s. 1168-1175. Article in proceedings