Adrian Kosowski
Adrian Kosowski
Researcher in Computer Science
Zweryfikowany adres z inria.fr
TytułCytowane przezRok
Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
R Klasing, A Kosowski, A Navarra
Theoretical Computer Science 411 (34-36), 3235-3246, 2010
100*2010
Boundary patrolling by mobile agents with distinct maximal speeds
J Czyzowicz, L Gąsieniec, A Kosowski, E Kranakis
European Symposium on Algorithms, 701-712, 2011
752011
How to meet when you forget: log-space rendezvous in arbitrary graphs
J Czyzowicz, A Kosowski, A Pelc
Distributed Computing 25 (2), 165-178, 2012
742012
Local conflict coloring
P Fraigniaud, M Heinrich, A Kosowski
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016
542016
Constructing a map of an anonymous graph: Applications of universal sequences
J Chalopin, S Das, A Kosowski
International Conference On Principles Of Distributed Systems, 119-134, 2010
442010
Euler tour lock-in problem in the rotor-router model
E Bampas, L Gąsieniec, N Hanusse, D Ilcinkas, R Klasing, A Kosowski
International Symposium on Distributed Computing, 423-435, 2009
382009
On the complexity of distributed graph coloring with local minimality constraints
C Gavoille, R Klasing, A Kosowski, Ł Kuszner, A Navarra
Networks 54 (1), 12-19, 2009
37*2009
Synchronous black hole search in directed graphs
A Kosowski, A Navarra, CM Pinotti
Theoretical Computer Science, 2011
35*2011
Classical coloring of graphs
A Kosowski, K Manuszewski
Contemporary Mathematics 352, 1-20, 2004
322004
Universal augmentation schemes for network navigability
P Fraigniaud, C Gavoille, A Kosowski, E Lebhar, Z Lotker
Theoretical Computer Science 410 (21-23), 1970-1981, 2009
29*2009
Cost minimization in wireless networks with a bounded and unbounded number of interfaces
R Klasing, A Kosowski, A Navarra
Networks 53 (3), 266-275, 2009
29*2009
A self-stabilizing algorithm for finding a spanning tree in a polynomial number of moves
A Kosowski, Ł Kuszner
International Conference on Parallel Processing and Applied Mathematics, 75-82, 2005
282005
Graph Decomposition for Memoryless Periodic Exploration
A Kosowski, A Navarra
Algorithmica, 1-13, 2011
25*2011
Application of an online judge & contester system in academic tuition
A Kosowski, M Małafiejski, T Noiński
International Conference on Web-Based Learning, 343-354, 2007
252007
Optimal patrolling of fragmented boundaries
A Collins, J Czyzowicz, L Gasieniec, A Kosowski, E Kranakis, D Krizanc, ...
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in …, 2013
242013
Derandomizing random walks in undirected graphs using locally fair exploration strategies
C Cooper, D Ilcinkas, R Klasing, A Kosowski
Distributed Computing, 1-9, 2011
242011
Nonclassicality of temporal correlations
S Brierley, A Kosowski, M Markiewicz, T Paterek, A Przysiężna
Physical review letters 115 (12), 120404, 2015
232015
k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth
A Kosowski, B Li, N Nisse, K Suchan
232012
Exploiting multi-interface networks: Connectivity and Cheapest Paths
A Kosowski, A Navarra, CM Pinotti
Wireless Networks 16 (4), 1063-1073, 2010
23*2010
Fast collaborative graph exploration
D Dereniowski, Y Disser, A Kosowski, D Pająk, P Uznański
Information and Computation 243, 37-49, 2015
222015
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20