| 2007 |
|---|
| 13 | EE | Kristoffer Arnsfelt Hansen,
Peter Bro Miltersen,
Troels Bjerre Sørensen:
Finding Equilibria in Games of No Chance.
COCOON 2007: 274-284 |
| 12 | EE | Kristoffer Arnsfelt Hansen:
Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates.
COCOON 2007: 448-458 |
| 11 | EE | Gerth Stølting Brodal,
Loukas Georgiadis,
Kristoffer Arnsfelt Hansen,
Irit Katriel:
Dynamic Matchings in Convex Bipartite Graphs.
MFCS 2007: 406-417 |
| 10 | EE | Daniel Andersson,
Kristoffer Arnsfelt Hansen,
Peter Bro Miltersen,
Troels Bjerre Sørensen:
Simple Recursive Games
CoRR abs/0711.1055: (2007) |
| 2006 |
|---|
| 9 | EE | Kristoffer Arnsfelt Hansen:
On Modular Counting with Polynomials.
IEEE Conference on Computational Complexity 2006: 202-212 |
| 8 | EE | Kristoffer Arnsfelt Hansen,
Peter Bro Miltersen,
V. Vinay:
Circuits on cylinders.
Computational Complexity 15(1): 62-81 (2006) |
| 7 | EE | Kristoffer Arnsfelt Hansen:
Constant Width Planar Computation Characterizes ACC0.
Theory Comput. Syst. 39(1): 79-92 (2006) |
| 2005 |
|---|
| 6 | EE | Arkadev Chattopadhyay,
Kristoffer Arnsfelt Hansen:
Lower Bounds for Circuits with Few Modular and Symmetric Gates.
ICALP 2005: 994-1005 |
| 2004 |
|---|
| 5 | EE | Kristoffer Arnsfelt Hansen,
Peter Bro Miltersen:
Some Meet-in-the-Middle Circuit Lower Bounds.
MFCS 2004: 334-345 |
| 4 | EE | Kristoffer Arnsfelt Hansen:
Constant Width Planar Computation Characterizes ACC0.
STACS 2004: 44-55 |
| 2003 |
|---|
| 3 | EE | Kristoffer Arnsfelt Hansen,
Peter Bro Miltersen,
V. Vinay:
Circuits on Cylinders.
FCT 2003: 171-182 |
| 2 | EE | Kristoffer Arnsfelt Hansen:
Constant width planar computation characterizes ACC0
Electronic Colloquium on Computational Complexity (ECCC) 10(025): (2003) |
| 2002 |
|---|
| 1 | EE | Kristoffer Arnsfelt Hansen,
Peter Bro Miltersen,
V. Vinay:
Circuits on Cylinders
Electronic Colloquium on Computational Complexity (ECCC)(066): (2002) |
