Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Kristoffer Arnsfelt Hansen
2010 – today
- 2013
[i11]Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii: Polynomial threshold functions and Boolean threshold circuits. Electronic Colloquium on Computational Complexity (ECCC) 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
- [i10]Kristoffer Arnsfelt Hansen, Michal Koucký, Niels Lauritzen, Peter Bro Miltersen, Elias P. Tsigaridas: Exact Algorithms for Solving Stochastic Games. CoRR abs/1202.3898 (2012)
- [i9]Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Vladimir V. Podolskii, Elias P. Tsigaridas: Patience of Matrix Games. CoRR abs/1206.1751 (2012)
- [i8]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. Electronic Colloquium on Computational Complexity (ECCC) 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
- [i7]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. Electronic Colloquium on Computational Complexity (ECCC) 18: 150 (2011)
- 2010
- [j3]Kristoffer Arnsfelt Hansen, Michal Koucký: A New Characterization of ACC0 and Probabilistic CC0. Computational Complexity 19(2): 211-234 (2010)
- [c18]Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii: Exact Threshold Circuits. IEEE Conference on Computational Complexity 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
- [i6]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. IEEE Conference on Computational Complexity 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. IEEE Conference on Computational Complexity 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
- [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. Computational Complexity 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. IEEE Conference on Computational Complexity 2006: 202-212
- [i3]Kristoffer Arnsfelt Hansen: Lower Bounds for Circuits with Few Modular Gates using Exponential Sums. Electronic Colloquium on Computational Complexity (ECCC) 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]
- 2003
- [c1]
- [i2]Kristoffer Arnsfelt Hansen: Constant width planar computation characterizes ACC0. Electronic Colloquium on Computational Complexity (ECCC) 10(025) (2003)
- 2002
- [i1]Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay: Circuits on Cylinders. Electronic Colloquium on Computational Complexity (ECCC)(066) (2002)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-18 21:33 CEST by the dblp team