Travelled to:1 × Portugal
3 × USA
Collaborated with:M.Koucký P.B.Miltersen A.Chattopadhyay A.Gál P.Pudlák E.Viola N.Lauritzen E.P.Tsigaridas
Talks about:bound (3) circuit (2) gate (2) game (2) exponenti (1) arbitrari (1) algorithm (1) stochast (1) reachabl (1) abstract (1)
Person: Kristoffer Arnsfelt Hansen
DBLP: Hansen:Kristoffer_Arnsfelt
Contributed to:
20122011
2009
2005Wrote 4 papers:
- STOC-2012-GalHKPV #bound
- Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates (AG, KAH, MK, PP, EV), pp. 479–494.
- STOC-2011-HansenKLMT #algorithm #game studies #probability
- Exact algorithms for solving stochastic games: extended abstract (KAH, MK, NL, PBM, EPT), pp. 205–214.
- LICS-2009-HansenKM #concurrent #game studies #reachability
- Winning Concurrent Reachability Games Requires Doubly-Exponential Patience (KAH, MK, PBM), pp. 332–341.
- ICALP-2005-ChattopadhyayH #bound #composition #symmetry
- Lower Bounds for Circuits with Few Modular and Symmetric Gates (AC, KAH), pp. 994–1005.