Travelled to:1 × Iceland
1 × Latvia
5 × USA
Collaborated with:P.Pudlák K.A.Hansen J.Bulánek M.E.Saks P.B.Miltersen P.Nimbhorkar C.Avin Z.Lotker D.Thérien H.Buhrman R.Cleve B.Loff F.Speelman A.Gál E.Viola N.Lauritzen E.P.Tsigaridas
Talks about:bound (4) label (3) abstract (2) circuit (2) random (2) extend (2) comput (2) tight (2) onlin (2) depth (2)
Person: Michal Koucký
DBLP: Kouck=yacute=:Michal
Contributed to:
2014
201320122011
200920082005Wrote 9 papers:
- STOC-2014-BuhrmanCKLS #memory management
- Computing with a full memory: catalytic space (HB, RC, MK, BL, FS), pp. 857–866.
- ICALP-v1-2013-BulanekKS #on the #online #random
- On Randomized Online Labeling with Polynomially Many Labels (JB, MK, MES), pp. 291–302.
- STOC-2012-BulanekKS #bound #online #problem
- Tight lower bounds for the online labeling problem (JB, MK, MES), pp. 1185–1198.
- 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.
- STOC-2011-KouckyNP #generative #pseudo
- Pseudorandom generators for group products: extended abstract (MK, PN, PP), pp. 263–272.
- LICS-2009-HansenKM #concurrent #game studies #reachability
- Winning Concurrent Reachability Games Requires Doubly-Exponential Patience (KAH, MK, PBM), pp. 332–341.
- ICALP-A-2008-AvinKL #evolution #graph #how #random
- How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs) (CA, MK, ZL), pp. 121–132.
- STOC-2005-KouckyPT #bound
- Bounded-depth circuits: separating wires from gates (MK, PP, DT), pp. 257–265.