| 2025 | SAGT | Improved Hardness Results for the Clearing Problem in Financial Networks with Credit Default Swaps. | Simon Dohn, Kristoffer Arnsfelt Hansen, Asger Klinkby |
| 2024 | STOC | PPAD-Membership for Problems with Exact Rational Solutions: A General Approach via Convex Optimization. | Aris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Hgh, Alexandros Hollender |
| 2023 | SAGT | Computational Complexity of Decision Problems About Nash Equilibria in Win-Lose Multi-player Games. | Vittorio Bil, Kristoffer Arnsfelt Hansen, Marios Mavronicolas |
| 2021 | CSR | Computational Complexity of Multi-player Evolutionarily Stable Strategies. | Manon Blanc, Kristoffer Arnsfelt Hansen |
| 2021 | FCT | Computational Complexity of Computing a Quasi-Proper Equilibrium. | Kristoffer Arnsfelt Hansen, Troels Bjerre Lund |
| 2021 | FOCS | FIXP-membership via Convex Optimization: Games, Cakes, and Markets. | Aris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Hgh, Alexandros Hollender |
| 2021 | ICALP | Strong Approximate Consensus Halving and the Borsuk-Ulam Theorem. | Eleni Batziou, Kristoffer Arnsfelt Hansen, Kasper Hgh |
| 2020 | MFCS | ∃ℝ-Completeness of Stationary Nash Equilibria in Perfect Information Stochastic Games. | Kristoffer Arnsfelt Hansen, Steffan Christ Slvsten |
| 2019 | SAGT | On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria. | Marie Louisa Tlbll Berthelsen, Kristoffer Arnsfelt Hansen |
| 2018 | MFCS | Low Rank Approximation of Binary Matrices: Column Subset Selection and Generalizations. | Chen Dan, Kristoffer Arnsfelt Hansen, He Jiang, Liwei Wang, Yuchen Zhou |
| 2017 | MFCS | Strategy Complexity of Concurrent Safety Games. | Krishnendu Chatterjee, Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen |
| 2017 | SAGT | The Real Computational Complexity of Minmax Value and Equilibrium Refinements in Multi-player Games. | Kristoffer Arnsfelt Hansen |
| 2016 | SAGT | The Big Match in Small Space - (Extended Abstract). | Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Michal Kouck |
| 2014 | MFCS | Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth. | Kristoffer Arnsfelt Hansen, Balagopal Komarath, Jayalal Sarma, Sven Skyum, Navid Talebanfard |
| 2014 | SAGT | The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form. | Kousha Etessami, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Srensen |
| 2013 | MFCS | Polynomial Threshold Functions and Boolean Threshold Circuits. | Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii |
| 2012 | STOC | Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. | Anna Gl, Kristoffer Arnsfelt Hansen, Michal Kouck, Pavel Pudlk, Emanuele Viola |
| 2012 | SAGT | Approximating the Minmax Value of Three-Player Games within a Constant is as Hard as Detecting Planted Cliques. | Kord Eickmeyer, Kristoffer Arnsfelt Hansen, Elad Verbin |
| 2011 | CSR | Learning Read-Constant Polynomials of Constant Degree Modulo Composites. | Arkadev Chattopadhyay, Ricard Gavald, Kristoffer Arnsfelt Hansen, Denis Thrien |
| 2011 | CSR | The Complexity of Solving Reachability Games Using Value and Strategy Iteration. | Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen |
| 2011 | STOC | Exact algorithms for solving stochastic games: extended abstract. | Kristoffer Arnsfelt Hansen, Michal Kouck, Niels Lauritzen, Peter Bro Miltersen, Elias P. Tsigaridas |
| 2010 | MFCS | Weights of Exact Threshold Functions. | Lszl Babai, Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii, Xiaoming Sun |
| 2010 | SAGT | The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements. | Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Srensen |
| 2009 | CSR | Depth Reduction for Circuits with a Single Layer of Modular Counting Gates. | Kristoffer Arnsfelt Hansen |
| 2009 | ISAAC | Hilbert's Thirteenth Problem and Circuit Complexity. | Kristoffer Arnsfelt Hansen, Oded Lachish, Peter Bro Miltersen |
| 2009 | LICS | Winning Concurrent Reachability Games Requires Doubly-Exponential Patience. | Kristoffer Arnsfelt Hansen, Michal Kouck, Peter Bro Miltersen |
| 2008 | CiE | Deterministic Graphical Games Revisited. | Daniel Andersson, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Srensen |
| 2007 | COCOON | Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates. | Kristoffer Arnsfelt Hansen |
| 2007 | COCOON | Finding Equilibria in Games of No Chance. | Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Srensen |
| 2007 | MFCS | Dynamic Matchings in Convex Bipartite Graphs. | Gerth Stlting Brodal, Loukas Georgiadis, Kristoffer Arnsfelt Hansen, Irit Katriel |
| 2005 | ICALP | Lower Bounds for Circuits with Few Modular and Symmetric Gates. | Arkadev Chattopadhyay, Kristoffer Arnsfelt Hansen |
| 2004 | MFCS | Some Meet-in-the-Middle Circuit Lower Bounds. | Kristoffer Arnsfelt Hansen, Peter Bro Miltersen |
| 2004 | STACS | Constant Width Planar Computation Characterizes ACC | Kristoffer Arnsfelt Hansen |
| 2003 | FCT | Circuits on Cylinders. | Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay |