Travelled to:1 × Denmark
1 × Greece
1 × Japan
1 × Latvia
1 × United Kingdom
Collaborated with:D.Pajak P.Uznanski B.Li N.Nisse K.Suchan C.Cooper D.Ilcinkas R.Klasing D.Dereniowski Y.Disser J.Czyzowicz L.Gasieniec E.Kranakis P.G.Spirakis
Talks about:graph (3) explor (2) treewidth (1) threshold (1) volterra (1) undirect (1) strategi (1) protocol (1) properti (1) derandom (1)
Person: Adrian Kosowski
DBLP: Kosowski:Adrian
Contributed to:
20152014201320122009Wrote 5 papers:
- ICALP-v1-2015-CzyzowiczGKKSU #convergence #on the #protocol
- On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols (JC, LG, AK, EK, PGS, PU), pp. 393–405.
- ICALP-v2-2014-KosowskiP #case study #difference
- Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router (AK, DP), pp. 544–555.
- ICALP-v2-2013-DereniowskiDKPU #collaboration #graph #performance
- Fast Collaborative Graph Exploration (DD, YD, AK, DP, PU), pp. 520–532.
- ICALP-v2-2012-KosowskiLNS #graph
- k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth (AK, BL, NN, KS), pp. 610–622.
- ICALP-v2-2009-CooperIKK #graph #random #using
- Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies (CC, DI, RK, AK), pp. 411–422.