Probabilistic algorithms for the wakeup problem in single-hop radio networks T Jurdziński, G Stachowiak International Symposium on Algorithms and Computation, 535-549, 2002 | 166 | 2002 |
MST in O(1) Rounds of Congested Clique T Jurdziński, K Nowicki Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 102 | 2018 |
Efficient algorithms for leader election in radio networks T Jurdziński, M Kutyłowski, J Zatopiański Proceedings of the twenty-first annual symposium on Principles of …, 2002 | 102 | 2002 |
Energy-efficient size approximation of radio networks with no collision detection T Jurdziński, M Kutyłowski, J Zatopiański International Computing and Combinatorics Conference, 279-289, 2002 | 76 | 2002 |
Distributed backbone structure for algorithms in the SINR model of wireless networks T Jurdzinski, DR Kowalski International Symposium on Distributed Computing, 106-120, 2012 | 54 | 2012 |
Distributed randomized broadcasting in wireless networks under the SINR model T Jurdzinski, DR Kowalski, M Rozanski, G Stachowiak International Symposium on Distributed Computing, 373-387, 2013 | 50 | 2013 |
Some results on RWW-and RRWW-automata and their relation to the class of growing context-sensitive languages T Jurdziński, K Lorys, G Niemann, F Otto Journal of Automata, Languages and Combinatorics 9 (4), 407-437, 2004 | 42* | 2004 |
Distributed deterministic broadcasting in uniform-power ad hoc wireless networks T Jurdzinski, DR Kowalski, G Stachowiak Fundamentals of Computation Theory: 19th International Symposium, FCT 2013 …, 2013 | 40 | 2013 |
On the impact of geometry on ad hoc communication in wireless networks T Jurdzinski, DR Kowalski, M Rozanski, G Stachowiak Proceedings of the 2014 ACM symposium on Principles of distributed computing …, 2014 | 37 | 2014 |
Distributed deterministic broadcasting in wireless networks of weak devices T Jurdzinski, DR Kowalski, G Stachowiak International Colloquium on Automata, Languages, and Programming, 632-644, 2013 | 36 | 2013 |
Church-Rosser languages vs. UCFL T Jurdziński, K Loryś International Colloquium on Automata, Languages, and Programming, 147-158, 2002 | 35* | 2002 |
Shrinking restarting automata T Jurdziński, F Otto International Journal of Foundations of Computer Science 18 (02), 361-385, 2007 | 32 | 2007 |
Weak communication in single‐hop radio networks: adjusting algorithms to industrial standards T Jurdziński, M Kutyłowski, J Zatopiański Concurrency and Computation: Practice and Experience 15 (11‐12), 1117-1131, 2003 | 31* | 2003 |
On the complexity of 2-monotone restarting automata T Jurdziński, F Otto, F Mráz, M Plátek Theory of Computing Systems 42 (4), 488-518, 2008 | 23* | 2008 |
Subquadratic non-adaptive threshold group testing G De Marco, T Jurdziński, M Różański, G Stachowiak International Symposium on Fundamentals of Computation Theory, 177-189, 2017 | 19 | 2017 |
On setting-up asynchronous ad hoc wireless networks T Jurdzinski, DR Kowalski, M Rozanski, G Stachowiak 2015 IEEE Conference on Computer Communications (INFOCOM), 2191-2199, 2015 | 19 | 2015 |
On left-monotone deterministic restarting automata T Jurdziński, F Otto, F Mráz, M Plátek International Conference on Developments in Language Theory, 249-260, 2004 | 19* | 2004 |
The cost of synchronizing multiple-access channels T Jurdzinski, G Stachowiak Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing …, 2015 | 17 | 2015 |
Degrees of non-monotonicity for restarting automata T Jurdziński, F Mráz, F Otto, M Plátek Theoretical computer science 369 (1-3), 1-34, 2006 | 17 | 2006 |
Patrolling a path connecting a set of points with unbalanced frequencies of visits H Chuangpishit, J Czyzowicz, L Gąsieniec, K Georgiou, T Jurdziński, ... SOFSEM 2018: Theory and Practice of Computer Science: 44th International …, 2018 | 15 | 2018 |