Kristoffer Arnsfelt Hansen

	2012
35		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
34		Kristoffer Arnsfelt Hansen, Michal Koucký, Niels Lauritzen, Peter Bro Miltersen, Elias P. Tsigaridas: Exact Algorithms for Solving Stochastic Games CoRR abs/1202.3898: (2012)
33		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)
32		Daniel Andersson, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen: Deterministic Graphical Games Revisited. J. Log. Comput. 22(2): 165-178 (2012)
	2011
31		Arkadev Chattopadhyay, Ricard Gavaldà, Kristoffer Arnsfelt Hansen, Denis Thérien: Learning Read-Constant Polynomials of Constant Degree Modulo Composites. CSR 2011: 29-42
30		Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen: The Complexity of Solving Reachability Games Using Value and Strategy Iteration. CSR 2011: 77-90
29		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
28		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
27		Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii: Exact Threshold Circuits. IEEE Conference on Computational Complexity 2010: 270-279
26		László Babai, Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii, Xiaoming Sun: Weights of Exact Threshold Functions. MFCS 2010: 66-77
25		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
24		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)
23		Kristoffer Arnsfelt Hansen, Michal Koucký: A New Characterization of ACC0 and Probabilistic CC0. Computational Complexity 19(2): 211-234 (2010)
	2009
22		Kristoffer Arnsfelt Hansen: Depth Reduction for Circuits with a Single Layer of Modular Counting Gates. CSR 2009: 117-128
21		Kristoffer Arnsfelt Hansen, Michal Koucký: A New Characterization of ACC0 and Probabilistic CC0. IEEE Conference on Computational Complexity 2009: 27-34
20		Kristoffer Arnsfelt Hansen, Oded Lachish, Peter Bro Miltersen: Hilbert's Thirteenth Problem and Circuit Complexity. ISAAC 2009: 153-162
19		Kristoffer Arnsfelt Hansen, Michal Koucký, Peter Bro Miltersen: Winning Concurrent Reachability Games Requires Doubly-Exponential Patience. LICS 2009: 332-341
	2008
18		Daniel Andersson, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen: Deterministic Graphical Games Revisited. CiE 2008: 1-10
17		Kristoffer Arnsfelt Hansen: Constant Width Planar Branching Programs Characterize ACC^0 in Quasipolynomial Size. IEEE Conference on Computational Complexity 2008: 92-99
16		Kristoffer Arnsfelt Hansen, Thomas Dueholm Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen: Approximability and Parameterized Complexity of Minmax Values. WINE 2008: 684-695
15		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
14		Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen: Finding Equilibria in Games of No Chance. COCOON 2007: 274-284
13		Kristoffer Arnsfelt Hansen: Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates. COCOON 2007: 448-458
12		Gerth Stølting Brodal, Loukas Georgiadis, Kristoffer Arnsfelt Hansen, Irit Katriel: Dynamic Matchings in Convex Bipartite Graphs. MFCS 2007: 406-417
11		Daniel Andersson, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen: Simple Recursive Games CoRR abs/0711.1055: (2007)
	2006
10		Kristoffer Arnsfelt Hansen: On Modular Counting with Polynomials. IEEE Conference on Computational Complexity 2006: 202-212
9		Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay: Circuits on cylinders. Computational Complexity 15(1): 62-81 (2006)
8		Kristoffer Arnsfelt Hansen: Lower Bounds for Circuits with Few Modular Gates using Exponential Sums. Electronic Colloquium on Computational Complexity (ECCC) 13(079): (2006)
7		Kristoffer Arnsfelt Hansen: Constant Width Planar Computation Characterizes ACC0. Theory Comput. Syst. 39(1): 79-92 (2006)
	2005
6		Arkadev Chattopadhyay, Kristoffer Arnsfelt Hansen: Lower Bounds for Circuits with Few Modular and Symmetric Gates. ICALP 2005: 994-1005
	2004
5		Kristoffer Arnsfelt Hansen, Peter Bro Miltersen: Some Meet-in-the-Middle Circuit Lower Bounds. MFCS 2004: 334-345
4		Kristoffer Arnsfelt Hansen: Constant Width Planar Computation Characterizes ACC0. STACS 2004: 44-55
	2003
3		Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay: Circuits on Cylinders. FCT 2003: 171-182
2		Kristoffer Arnsfelt Hansen: Constant width planar computation characterizes ACC0 Electronic Colloquium on Computational Complexity (ECCC) 10(025): (2003)
	2002
1		Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay: Circuits on Cylinders Electronic Colloquium on Computational Complexity (ECCC)(066): (2002)

Coauthor Index

1	Daniel Andersson	[11] [18] [32]
2	László Babai	[26]
3	Gerth Stølting Brodal	[12]
4	Arkadev Chattopadhyay	[6] [31]
5	Kord Eickmeyer	[33]
6	Anna Gál	[28] [35]
7	Ricard Gavaldà	[31]
8	Loukas Georgiadis	[12]
9	Thomas Dueholm Hansen	[15] [16]
10	Rasmus Ibsen-Jensen	[24] [30]
11	Irit Katriel	[12]
12	Michal Koucký	[19] [21] [23] [28] [29] [34] [35]
13	Oded Lachish	[20]
14	Niels Lauritzen	[29] [34]
15	Peter Bro Miltersen	[1] [3] [5] [9] [11] [14] [15] [16] [18] [19] [20] [24] [25] [29] [30] [32] [34]
16	Vladimir V. Podolskii	[26] [27]
17	Pavel Pudlák	[28] [35]
18	Troels Bjerre Sørensen	[11] [14] [15] [16] [18] [25] [32]
19	Xiaoming Sun	[26]
20	Denis Thérien	[31]
21	Elias P. Tsigaridas	[29] [34]
22	Elad Verbin	[33]
23	V. Vinay	[1] [3] [9]
24	Emanuele Viola	[28] [35]

Colors in the list of coauthors

Last update Thu May 31 18:55:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page