Kristoffer Arnsfelt Hansen

	2009
19		Kristoffer Arnsfelt Hansen: Depth Reduction for Circuits with a Single Layer of Modular Counting Gates. CSR 2009: 117-128
	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]
2	Gerth Stølting Brodal	[12]
3	Arkadev Chattopadhyay	[6]
4	Loukas Georgiadis	[12]
5	Thomas Dueholm Hansen	[15] [16]
6	Irit Katriel	[12]
7	Peter Bro Miltersen	[1] [3] [5] [9] [11] [14] [15] [16] [18]
8	Troels Bjerre Sørensen	[11] [14] [15] [16] [18]
9	V. Vinay	[1] [3] [9]

Colors in the list of coauthors