Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA Scholar
CiteSeerX
ORCIDKristoffer Arnsfelt Hansen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j13]Marie Louisa Tølbøll Berthelsen, Kristoffer Arnsfelt Hansen
:
On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria. Theory Comput. Syst. 66(3): 519-545 (2022)- [i24]Manon Blanc, Kristoffer Arnsfelt Hansen:
Computational Complexity of Multi-Player Evolutionarily Stable Strategies. CoRR abs/2203.07407 (2022) - 2021
- [j12]Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Abraham Neyman:
Absorbing games with a clock and two bits of memory. Games Econ. Behav. 128: 213-230 (2021) - [c41]Manon Blanc, Kristoffer Arnsfelt Hansen:
Computational Complexity of Multi-player Evolutionarily Stable Strategies. CSR 2021: 1-17 - [c40]Kristoffer Arnsfelt Hansen, Troels Bjerre Lund:
Computational Complexity of Computing a Quasi-Proper Equilibrium. FCT 2021: 259-271 - [c39]Aris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Høgh, Alexandros Hollender:
FIXP-membership via Convex Optimization: Games, Cakes, and Markets. FOCS 2021: 827-838 - [c38]Eleni Batziou, Kristoffer Arnsfelt Hansen, Kasper Høgh:
Strong Approximate Consensus Halving and the Borsuk-Ulam Theorem. ICALP 2021: 24:1-24:20 - [e1]Ioannis Caragiannis, Kristoffer Arnsfelt Hansen:
Algorithmic Game Theory - 14th International Symposium, SAGT 2021, Aarhus, Denmark, September 21-24, 2021, Proceedings. Lecture Notes in Computer Science 12885, Springer 2021, ISBN 978-3-030-85946-6 [contents] - [i23]Eleni Batziou, Kristoffer Arnsfelt Hansen, Kasper Høgh:
Strong Approximate Consensus Halving and the Borsuk-Ulam Theorem. CoRR abs/2103.04452 (2021) - [i22]Kristoffer Arnsfelt Hansen, Troels Bjerre Lund:
Computational Complexity of Computing a Quasi-Proper Equilibrium. CoRR abs/2107.04300 (2021) - [i21]Aris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Høgh, Alexandros Hollender:
FIXP-membership via Convex Optimization: Games, Cakes, and Markets. CoRR abs/2111.06878 (2021) - 2020
- [c37]Kristoffer Arnsfelt Hansen, Steffan Christ Sølvsten:
∃ℝ-Completeness of Stationary Nash Equilibria in Perfect Information Stochastic Games. MFCS 2020: 45:1-45:15 - [i20]Marie Louisa Tølbøll Berthelsen, Kristoffer Arnsfelt Hansen:
On the Computational Complexity of Decision Problems about Multi-Player Nash Equilibria. CoRR abs/2001.05196 (2020) - [i19]Kristoffer Arnsfelt Hansen, Steffan Christ Sølvsten:
Existential Theory of the Reals Completeness of Stationary Nash Equilibria in Perfect Information Stochastic Games. CoRR abs/2006.08314 (2020)
2010 – 2019
- 2019
- [j11]Kristoffer Arnsfelt Hansen:
The Real Computational Complexity of Minmax Value and Equilibrium Refinements in Multi-player Games. Theory Comput. Syst. 63(7): 1554-1571 (2019) - [c36]Marie Louisa Tølbøll Berthelsen, Kristoffer Arnsfelt Hansen:
On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria. SAGT 2019: 153-167 - [c35]Kristoffer Arnsfelt Hansen, Mikhail A. Raskin:
A Stay-in-a-Set Game without a Stationary Equilibrium. GandALF 2019: 83-90 - 2018
- [c34]Chen Dan, Kristoffer Arnsfelt Hansen, He Jiang, Liwei Wang, Yuchen Zhou:
Low Rank Approximation of Binary Matrices: Column Subset Selection and Generalizations. MFCS 2018: 41:1-41:16 - [c33]Kristoffer Arnsfelt Hansen, Troels Bjerre Lund:
Computational Complexity of Proper Equilibrium. EC 2018: 113-130 - [c32]Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Abraham Neyman:
The Big Match with a Clock and a Bit of Memory. EC 2018: 149-150 - 2017
- [j10]Branislav Bosanský, Simina Brânzei, Kristoffer Arnsfelt Hansen, Troels Bjerre Lund, Peter Bro Miltersen:
Computation of Stackelberg Equilibria of Finite Sequential Games. ACM Trans. Economics and Comput. 5(4): 23:1-23:24 (2017) - [c31]Krishnendu Chatterjee, Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen:
Strategy Complexity of Concurrent Safety Games. MFCS 2017: 55:1-55:13 - [c30]Kristoffer Arnsfelt Hansen:
The Real Computational Complexity of Minmax Value and Equilibrium Refinements in Multi-player Games. SAGT 2017: 119-130 - 2016
- [c29]Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Michal Koucký:
The Big Match in Small Space - (Extended Abstract). SAGT 2016: 64-76 - [c28]Ioannis Caragiannis, Aris Filos-Ratsikas, Søren Kristoffer Stiil Frederiksen, Kristoffer Arnsfelt Hansen, Zihan Tan:
Truthful Facility Assignment with Resource Augmentation: An Exact Analysis of Serial Dictatorship. WINE 2016: 236-250 - [i18]Ioannis Caragiannis, Aris Filos-Ratsikas, Søren Kristoffer Stiil Frederiksen, Kristoffer Arnsfelt Hansen, Zihan Tan:
Truthful Facility Assignment with Resource Augmentation: An Exact Analysis of Serial Dictatorship. CoRR abs/1602.08023 (2016) - [i17]Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Michal Koucký:
The Big Match in Small Space. CoRR abs/1604.07634 (2016) - 2015
- [j9]Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii:
Polynomial threshold functions and Boolean threshold circuits. Inf. Comput. 240: 56-73 (2015) - [c27]Branislav Bosanský, Simina Brânzei, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen:
Computation of Stackelberg Equilibria of Finite Sequential Games. WINE 2015: 201-215 - [i16]Krishnendu Chatterjee, Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen:
Strategy Complexity of Concurrent Stochastic Games with Safety and Reachability Objectives. CoRR abs/1506.02434 (2015) - [i15]Branislav Bosanský, Simina Brânzei, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen:
Computation of Stackelberg Equilibria of Finite Sequential Games. CoRR abs/1507.07677 (2015) - [i14]Chen Dan, Kristoffer Arnsfelt Hansen, He Jiang, Liwei Wang, Yuchen Zhou:
On Low Rank Approximation of Binary Matrices. CoRR abs/1511.01699 (2015) - 2014
- [j8]Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen:
The Complexity of Solving Reachability Games Using Value and Strategy Iteration. Theory Comput. Syst. 55(2): 380-403 (2014) - [j7]Arkadev Chattopadhyay, Ricard Gavaldà, Kristoffer Arnsfelt Hansen, Denis Thérien:
Learning Read-Constant Polynomials of Constant Degree Modulo Composites. Theory Comput. Syst. 55(2): 404-420 (2014) - [c26]Kristoffer Arnsfelt Hansen, Balagopal Komarath, Jayalal Sarma, Sven Skyum, Navid Talebanfard:
Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth. MFCS (2) 2014: 336-347 - [c25]Kousha Etessami, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen:
The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form. SAGT 2014: 231-243 - [i13]Kousha Etessami, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen:
The complexity of approximating a trembling hand perfect equilibrium of a multi-player game in strategic form. CoRR abs/1408.1017 (2014) - 2013
- [j6]Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Vladimir V. Podolskii, Elias P. Tsigaridas:
Patience of matrix games. Discret. Appl. Math. 161(16-17): 2440-2459 (2013) - [j5]Anna Gál, Kristoffer Arnsfelt Hansen, Michal Koucký, Pavel Pudlák, Emanuele Viola:
Tight Bounds on Computing Error-Correcting Codes by Bounded-Depth Circuits With Arbitrary Gates. IEEE Trans. Inf. Theory 59(10): 6611-6627 (2013) - [c24]Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii:
Polynomial Threshold Functions and Boolean Threshold Circuits. MFCS 2013: 516-527 - [i12]Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii:
Polynomial threshold functions and Boolean threshold circuits. Electron. Colloquium Comput. Complex. 20: 21 (2013) - 2012
- [j4]Daniel Andersson, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen:
Deterministic Graphical Games Revisited. J. Log. Comput. 22(2): 165-178 (2012) - [c23]Kord Eickmeyer, Kristoffer Arnsfelt Hansen, Elad Verbin:
Approximating the Minmax Value of Three-Player Games within a Constant is as Hard as Detecting Planted Cliques. SAGT 2012: 96-107 - [c22]Anna Gál, Kristoffer Arnsfelt Hansen, Michal Koucký, Pavel Pudlák, Emanuele Viola:
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. STOC 2012: 479-494 - [i11]Kristoffer Arnsfelt Hansen, Michal Koucký, Niels Lauritzen, Peter Bro Miltersen, Elias P. Tsigaridas:
Exact Algorithms for Solving Stochastic Games. CoRR abs/1202.3898 (2012) - [i10]Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Vladimir V. Podolskii, Elias P. Tsigaridas:
Patience of Matrix Games. CoRR abs/1206.1751 (2012) - [i9]Kord Eickmeyer, Kristoffer Arnsfelt Hansen, Elad Verbin:
Approximating the minmax value of 3-player games within a constant is as hard as detecting planted cliques. Electron. Colloquium Comput. Complex. 19: 25 (2012) - 2011
- [c21]Arkadev Chattopadhyay, Ricard Gavaldà, Kristoffer Arnsfelt Hansen, Denis Thérien:
Learning Read-Constant Polynomials of Constant Degree Modulo Composites. CSR 2011: 29-42 - [c20]Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen:
The Complexity of Solving Reachability Games Using Value and Strategy Iteration. CSR 2011: 77-90 - [c19]Kristoffer Arnsfelt Hansen, Michal Koucký, Niels Lauritzen, Peter Bro Miltersen, Elias P. Tsigaridas:
Exact algorithms for solving stochastic games: extended abstract. STOC 2011: 205-214 - [i8]Anna Gál, Kristoffer Arnsfelt Hansen, Michal Koucký, Pavel Pudlák, Emanuele Viola:
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. Electron. Colloquium Comput. Complex. 18: 150 (2011) - 2010
- [j3]Kristoffer Arnsfelt Hansen, Michal Koucký:
A New Characterization of ACC0 and Probabilistic CC0. Comput. Complex. 19(2): 211-234 (2010) - [c18]Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii:
Exact Threshold Circuits. Computational Complexity Conference 2010: 270-279 - [c17]László Babai, Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii, Xiaoming Sun:
Weights of Exact Threshold Functions. MFCS 2010: 66-77 - [c16]Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen:
The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements. SAGT 2010: 198-209 - [i7]Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen:
The complexity of solving reachability games using value and strategy iteration. CoRR abs/1007.1812 (2010)
2000 – 2009
- 2009
- [c15]Kristoffer Arnsfelt Hansen, Michal Koucký:
A New Characterization of ACC0 and Probabilistic CC0. Computational Complexity Conference 2009: 27-34 - [c14]Kristoffer Arnsfelt Hansen:
Depth Reduction for Circuits with a Single Layer of Modular Counting Gates. CSR 2009: 117-128 - [c13]Kristoffer Arnsfelt Hansen, Oded Lachish, Peter Bro Miltersen:
Hilbert's Thirteenth Problem and Circuit Complexity. ISAAC 2009: 153-162 - [c12]Kristoffer Arnsfelt Hansen, Michal Koucký, Peter Bro Miltersen:
Winning Concurrent Reachability Games Requires Doubly-Exponential Patience. LICS 2009: 332-341 - 2008
- [c11]Daniel Andersson, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen:
Deterministic Graphical Games Revisited. CiE 2008: 1-10 - [c10]Kristoffer Arnsfelt Hansen:
Constant Width Planar Branching Programs Characterize ACC^0 in Quasipolynomial Size. Computational Complexity Conference 2008: 92-99 - [c9]Kristoffer Arnsfelt Hansen, Thomas Dueholm Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen:
Approximability and Parameterized Complexity of Minmax Values. WINE 2008: 684-695 - [i6]Kristoffer Arnsfelt Hansen:
Depth Reduction for Circuits with a Single Layer of Modular Counting Gates. Computational Complexity of Discrete Problems 2008 - [i5]Kristoffer Arnsfelt Hansen, Thomas Dueholm Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen:
Approximability and parameterized complexity of minmax values. CoRR abs/0806.4344 (2008) - 2007
- [c8]Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen:
Finding Equilibria in Games of No Chance. COCOON 2007: 274-284 - [c7]Kristoffer Arnsfelt Hansen:
Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates. COCOON 2007: 448-458 - [c6]Gerth Stølting Brodal, Loukas Georgiadis, Kristoffer Arnsfelt Hansen, Irit Katriel:
Dynamic Matchings in Convex Bipartite Graphs. MFCS 2007: 406-417 - [i4]Daniel Andersson, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen:
Simple Recursive Games. CoRR abs/0711.1055 (2007) - 2006
- [j2]Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay:
Circuits on cylinders. Comput. Complex. 15(1): 62-81 (2006) - [j1]Kristoffer Arnsfelt Hansen:
Constant Width Planar Computation Characterizes ACC0. Theory Comput. Syst. 39(1): 79-92 (2006) - [c5]Kristoffer Arnsfelt Hansen:
On Modular Counting with Polynomials. Computational Complexity Conference 2006: 202-212 - [i3]Kristoffer Arnsfelt Hansen:
Lower Bounds for Circuits with Few Modular Gates using Exponential Sums. Electron. Colloquium Comput. Complex. 13(079) (2006) - 2005
- [c4]Arkadev Chattopadhyay, Kristoffer Arnsfelt Hansen:
Lower Bounds for Circuits with Few Modular and Symmetric Gates. ICALP 2005: 994-1005 - 2004
- [c3]Kristoffer Arnsfelt Hansen, Peter Bro Miltersen:
Some Meet-in-the-Middle Circuit Lower Bounds. MFCS 2004: 334-345 - [c2]Kristoffer Arnsfelt Hansen:
Constant Width Planar Computation Characterizes ACC0. STACS 2004: 44-55 - 2003
- [c1]Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay:
Circuits on Cylinders. FCT 2003: 171-182 - [i2]Kristoffer Arnsfelt Hansen:
Constant width planar computation characterizes ACC0. Electron. Colloquium Comput. Complex. 10(025) (2003) - 2002
- [i1]Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay:
Circuits on Cylinders. Electron. Colloquium Comput. Complex.(066) (2002)
Coauthor Index
aka: Troels Bjerre Sørensen
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2022-06-29 21:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp has been originally created in 1993 at:
since 2018, dblp is operated and maintained by:
the dblp computer science bibliography is funded and supported by:
