Constant width planar computation characterizes ACC0 - Kristoffer Arnsfelt Hansen (Electron. Colloquium Comput. Complex., 2003)

Some Meet-in-the-Middle Circuit Lower Bounds. - Kristoffer Arnsfelt Hansen; Peter Bro Miltersen (MFCS, 2004)

Lower Bounds for Circuits with Few Modular and Symmetric Gates. - Arkadev Chattopadhyay; Kristoffer Arnsfelt Hansen (ICALP, 2005)

On Modular Counting with Polynomials. - Kristoffer Arnsfelt Hansen (CCC, 2006)

Circuits on cylinders. - Kristoffer Arnsfelt Hansen; Peter Bro Miltersen; V. Vinay (Comput. Complex., 2006)

Lower Bounds for Circuits with Few Modular Gates using Exponential Sums. - Kristoffer Arnsfelt Hansen (Electron. Colloquium Comput. Complex., 2006)

Constant Width Planar Computation Characterizes ACC0. - Kristoffer Arnsfelt Hansen (Theory Comput. Syst., 2006)

Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates. - Kristoffer Arnsfelt Hansen (COCOON, 2007)

Finding Equilibria in Games of No Chance. - Kristoffer Arnsfelt Hansen; Peter Bro Miltersen; Troels Bjerre Sørensen (COCOON, 2007)

Dynamic Matchings in Convex Bipartite Graphs. - Gerth Stølting Brodal; Loukas Georgiadis; Kristoffer Arnsfelt Hansen; Irit Katriel (MFCS, 2007)

Simple Recursive Games - Daniel Andersson; Kristoffer Arnsfelt Hansen; Peter Bro Miltersen; Troels Bjerre Sørensen (CoRR, 2007)

Constant Width Planar Branching Programs Characterize ACC^0 in Quasipolynomial Size. - Kristoffer Arnsfelt Hansen (CCC, 2008)

Depth Reduction for Circuits with a Single Layer of Modular Counting Gates. - Kristoffer Arnsfelt Hansen (Computational Complexity of Discrete Problems, 2008)

Approximability and Parameterized Complexity of Minmax Values. - Kristoffer Arnsfelt Hansen; Thomas Dueholm Hansen; Peter Bro Miltersen; Troels Bjerre Sørensen (WINE, 2008)

Hilbert's Thirteenth Problem and Circuit Complexity. - Kristoffer Arnsfelt Hansen; Oded Lachish; Peter Bro Miltersen (ISAAC, 2009)

Winning Concurrent Reachability Games Requires Doubly-Exponential Patience. - Kristoffer Arnsfelt Hansen; Michal Koucký 001; Peter Bro Miltersen (LICS, 2009)

Exact Threshold Circuits. - Kristoffer Arnsfelt Hansen; Vladimir V. Podolskii (CCC, 2010)

Weights of Exact Threshold Functions. - László Babai; Kristoffer Arnsfelt Hansen; Vladimir V. Podolskii; Xiaoming Sun 001 (MFCS, 2010)

The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements. - Kristoffer Arnsfelt Hansen; Peter Bro Miltersen; Troels Bjerre Sørensen (SAGT, 2010)

A New Characterization of ACC0 and Probabilistic CC0. - Kristoffer Arnsfelt Hansen; Michal Koucký 001 (Comput. Complex., 2010)

Exact algorithms for solving stochastic games: extended abstract. - Kristoffer Arnsfelt Hansen; Michal Koucký 001; Niels Lauritzen; Peter Bro Miltersen; Elias P. Tsigaridas (STOC, 2011)

Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. - Anna Gál; Kristoffer Arnsfelt Hansen; Michal Koucký 001; Pavel Pudlák; Emanuele Viola (Electron. Colloquium Comput. Complex., 2011)

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 (SAGT, 2012)

Exact Algorithms for Solving Stochastic Games - Kristoffer Arnsfelt Hansen; Michal Koucký 001; Niels Lauritzen; Peter Bro Miltersen; Elias P. Tsigaridas (CoRR, 2012)

Approximating the minmax value of 3-player games within a constant is as hard as detecting planted cliques. - Kord Eickmeyer; Kristoffer Arnsfelt Hansen; Elad Verbin (Electron. Colloquium Comput. Complex., 2012)

Deterministic Graphical Games Revisited. - Daniel Andersson; Kristoffer Arnsfelt Hansen; Peter Bro Miltersen; Troels Bjerre Sørensen (J. Log. Comput., 2012)

Patience of matrix games. - Kristoffer Arnsfelt Hansen; Rasmus Ibsen-Jensen; Vladimir V. Podolskii; Elias P. Tsigaridas (Discret. Appl. Math., 2013)

Polynomial threshold functions and Boolean threshold circuits. - Kristoffer Arnsfelt Hansen; Vladimir V. Podolskii (Electron. Colloquium Comput. Complex., 2013)

Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth. - Kristoffer Arnsfelt Hansen; Balagopal Komarath; Jayalal Sarma; Sven Skyum; Navid Talebanfard (MFCS (2), 2014)

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 Sørensen (SAGT, 2014)

Learning Read-Constant Polynomials of Constant Degree Modulo Composites. - Arkadev Chattopadhyay; Ricard Gavaldà; Kristoffer Arnsfelt Hansen; Denis Thérien (Theory Comput. Syst., 2014)

The Complexity of Solving Reachability Games Using Value and Strategy Iteration. - Kristoffer Arnsfelt Hansen; Rasmus Ibsen-Jensen; Peter Bro Miltersen (Theory Comput. Syst., 2014)

Strategy Complexity of Concurrent Stochastic Games with Safety and Reachability Objectives. - Krishnendu Chatterjee; Kristoffer Arnsfelt Hansen; Rasmus Ibsen-Jensen (CoRR, 2015)

On Low Rank Approximation of Binary Matrices. - Chen Dan 001; Kristoffer Arnsfelt Hansen; He Jiang; Liwei Wang 001; Yuchen Zhou (CoRR, 2015)

The Big Match in Small Space - (Extended Abstract). - Kristoffer Arnsfelt Hansen; Rasmus Ibsen-Jensen; Michal Koucký 001 (SAGT, 2016)

The Big Match in Small Space. - Kristoffer Arnsfelt Hansen; Rasmus Ibsen-Jensen; Michal Koucký 001 (CoRR, 2016)

Strategy Complexity of Concurrent Safety Games. - Krishnendu Chatterjee; Kristoffer Arnsfelt Hansen; Rasmus Ibsen-Jensen (MFCS, 2017)

Computation of Stackelberg Equilibria of Finite Sequential Games. - Branislav Bosanský; Simina Brânzei; Kristoffer Arnsfelt Hansen; Troels Bjerre Lund; Peter Bro Miltersen (ACM Trans. Economics and Comput., 2017)

Low Rank Approximation of Binary Matrices: Column Subset Selection and Generalizations. - Chen Dan 001; Kristoffer Arnsfelt Hansen; He Jiang; Liwei Wang 001; Yuchen Zhou (MFCS, 2018)

Computational Complexity of Proper Equilibrium. - Kristoffer Arnsfelt Hansen; Troels Bjerre Lund (EC, 2018)

A Stay-in-a-Set Game without a Stationary Equilibrium. - Kristoffer Arnsfelt Hansen; Mikhail A. Raskin (GandALF, 2019)

The Real Computational Complexity of Minmax Value and Equilibrium Refinements in Multi-player Games. - Kristoffer Arnsfelt Hansen (Theory Comput. Syst., 2019)

∃ℝ-Completeness of Stationary Nash Equilibria in Perfect Information Stochastic Games. - Kristoffer Arnsfelt Hansen; Steffan Christ Sølvsten (MFCS, 2020)

Existential Theory of the Reals Completeness of Stationary Nash Equilibria in Perfect Information Stochastic Games. - Kristoffer Arnsfelt Hansen; Steffan Christ Sølvsten (CoRR, 2020)

Computational Complexity of Multi-player Evolutionarily Stable Strategies. - Manon Blanc; Kristoffer Arnsfelt Hansen (CSR, 2021)

Computational Complexity of Computing a Quasi-Proper Equilibrium. - Kristoffer Arnsfelt Hansen; Troels Bjerre Lund (FCT, 2021)

FIXP-membership via Convex Optimization: Games, Cakes, and Markets. - Aris Filos-Ratsikas; Kristoffer Arnsfelt Hansen; Kasper Høgh; Alexandros Hollender (FOCS, 2021)

Strong Approximate Consensus Halving and the Borsuk-Ulam Theorem. - Eleni Batziou; Kristoffer Arnsfelt Hansen; Kasper Høgh (ICALP, 2021)

Absorbing games with a clock and two bits of memory. - Kristoffer Arnsfelt Hansen; Rasmus Ibsen-Jensen; Abraham Neyman (Games Econ. Behav., 2021)

On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria. - Marie Louisa Tølbøll Berthelsen; Kristoffer Arnsfelt Hansen (Theory Comput. Syst., 2022)

Computational Complexity of Decision Problems About Nash Equilibria in Win-Lose Multi-player Games. - Vittorio Bilò; Kristoffer Arnsfelt Hansen; Marios Mavronicolas (SAGT, 2023)

The Big Match with a Clock and a Bit of Memory. - Kristoffer Arnsfelt Hansen; Rasmus Ibsen-Jensen; Abraham Neyman (Math. Oper. Res., 2023)

On the Complexity of Pareto-Optimal and Envy-Free Lotteries. - Ioannis Caragiannis; Kristoffer Arnsfelt Hansen; Nidhi Rathi (AAMAS, 2024)

PPAD-Membership for Problems with Exact Rational Solutions: A General Approach via Convex Optimization. - Aris Filos-Ratsikas; Kristoffer Arnsfelt Hansen; Kasper Høgh; Alexandros Hollender (STOC, 2024)

Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship. - Ioannis Caragiannis; Aris Filos-Ratsikas; Søren Kristoffer Stiil Frederiksen; Kristoffer Arnsfelt Hansen; Zihan Tan (Math. Program., 2024)

Improved Hardness Results for the Clearing Problem in Financial Networks with Credit Default Swaps. - Simon Dohn; Kristoffer Arnsfelt Hansen; Asger Klinkby (SAGT, 2025)

Stochastic Games with Limited Public Memory. - Kristoffer Arnsfelt Hansen; Rasmus Ibsen-Jensen; Abraham Neyman (CoRR, 2025)