Tomasz Jurdziński

1.1k total citations
41 papers, 252 citations indexed

About

Tomasz Jurdziński is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Artificial Intelligence. According to data from OpenAlex, Tomasz Jurdziński has authored 41 papers receiving a total of 252 indexed citations (citations by other indexed papers that have themselves been cited), including 21 papers in Computer Networks and Communications, 15 papers in Computational Theory and Mathematics and 13 papers in Artificial Intelligence. Recurrent topics in Tomasz Jurdziński's work include semigroups and automata theory (13 papers), Cooperative Communication and Network Coding (11 papers) and DNA and Biological Computing (10 papers). Tomasz Jurdziński is often cited by papers focused on semigroups and automata theory (13 papers), Cooperative Communication and Network Coding (11 papers) and DNA and Biological Computing (10 papers). Tomasz Jurdziński collaborates with scholars based in Poland, United Kingdom and United States. Tomasz Jurdziński's co-authors include Grzegorz Stachowiak, Mirosław Kutyłowski, Dariusz R. Kowalski, Friedrich Otto, Michał Różański, Andrzej Tarlecki, Lars Arge, Christian Cachin, František Mráz and Gianluca De Marco and has published in prestigious journals such as IEEE Communications Letters, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Tomasz Jurdziński

36 papers receiving 241 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Tomasz Jurdziński Poland 8 168 81 73 51 41 41 252
Chong Shangguan China 8 124 0.7× 49 0.6× 86 1.2× 37 0.7× 81 2.0× 24 214
Klim Efremenko Israel 8 101 0.6× 74 0.9× 117 1.6× 49 1.0× 34 0.8× 27 193
Venkat Chandar United States 11 161 1.0× 85 1.0× 65 0.9× 46 0.9× 108 2.6× 25 242
Hironori Uchikawa Japan 9 247 1.5× 111 1.4× 101 1.4× 25 0.5× 92 2.2× 19 279
Pavol Ďuriš Slovakia 8 51 0.3× 139 1.7× 108 1.5× 31 0.6× 37 0.9× 20 180
Qiaoqiao Zhou Hong Kong 10 171 1.0× 23 0.3× 53 0.7× 46 0.9× 194 4.7× 37 245
Suogang Gao China 9 47 0.3× 96 1.2× 99 1.4× 12 0.2× 101 2.5× 64 305
Chih-wen Weng Taiwan 11 36 0.2× 71 0.9× 119 1.6× 46 0.9× 159 3.9× 33 328
Andrzej Szepietowski Poland 9 60 0.4× 152 1.9× 77 1.1× 41 0.8× 29 0.7× 35 223
Anoosheh Heidarzadeh United States 8 148 0.9× 24 0.3× 109 1.5× 13 0.3× 91 2.2× 31 226

Countries citing papers authored by Tomasz Jurdziński

Since Specialization
Citations

This map shows the geographic impact of Tomasz Jurdziński's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Tomasz Jurdziński with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Tomasz Jurdziński more than expected).

Fields of papers citing papers by Tomasz Jurdziński

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Tomasz Jurdziński. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Tomasz Jurdziński. The network helps show where Tomasz Jurdziński may publish in the future.

Co-authorship network of co-authors of Tomasz Jurdziński

This figure shows the co-authorship network connecting the top 25 collaborators of Tomasz Jurdziński. A scholar is included among the top collaborators of Tomasz Jurdziński based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Tomasz Jurdziński. Tomasz Jurdziński is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Gąsieniec, Leszek, Tomasz Jurdziński, Ralf Klasing, et al.. (2023). Perpetual maintenance of machines with different urgency requirements. Journal of Computer and System Sciences. 139. 103476–103476.
2.
Cholvi, Vicent, et al.. (2022). Stable routing scheduling algorithms in multi-hop wireless networks. Theoretical Computer Science. 921. 20–35. 1 indexed citations
3.
Bureš, Tomáš, Riccardo Dondi, Johann Gamper, et al.. (2021). SOFSEM 2021: Theory and Practice of Computer Science. Lecture notes in computer science. 4 indexed citations
4.
Jurdziński, Tomasz, Dariusz R. Kowalski, Michał Różański, & Grzegorz Stachowiak. (2019). Token traversal in ad hoc wireless networks via implicit carrier sensing. Theoretical Computer Science. 811. 3–20.
5.
Jurdziński, Tomasz, et al.. (2019). Stable Memoryless Queuing under Contention. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 17. 2 indexed citations
6.
Bieńkowski, Marcin, et al.. (2018). Distributed Online and Stochastic Queueing on a Multiple Access Channel. ACM Transactions on Algorithms. 14(2). 1–22. 7 indexed citations
7.
Jurdziński, Tomasz. (2008). The Boolean Closure of Growing Context-Sensitive Languages. Fundamenta Informaticae. 89(2-3). 289–305.
8.
Arge, Lars, Christian Cachin, Tomasz Jurdziński, & Andrzej Tarlecki. (2007). Proceedings of the 34th international colloquium on Automata, Languages and Programming. Lecture notes in computer science. 28 indexed citations
9.
Jurdziński, Tomasz & Friedrich Otto. (2007). SHRINKING RESTARTING AUTOMATA. International Journal of Foundations of Computer Science. 18(2). 361–385. 11 indexed citations
10.
Jurdziński, Tomasz, et al.. (2007). Lower bound technique for length-reducing automata. Information and Computation. 205(9). 1387–1412. 6 indexed citations
11.
Arge, Lars, Christian Cachin, Tomasz Jurdziński, & Andrzej Tarlecki. (2007). Proceedings of the 34th international conference on Automata, Languages and Programming. 4 indexed citations
12.
Jurdziński, Tomasz, et al.. (2007). Leftist Grammars and the Chomsky Hierarchy. Theory of Computing Systems. 41(2). 233–256.
13.
Mráz, František, Martin Plátek, & Tomasz Jurdziński. (2007). AMBIGUITY BY RESTARTING AUTOMATA. International Journal of Foundations of Computer Science. 18(6). 1343–1352.
14.
Jurdziński, Tomasz, et al.. (2006). Degrees of non-monotonicity for restarting automata. Theoretical Computer Science. 369(1-3). 1–34. 7 indexed citations
15.
Jurdziński, Tomasz & Friedrich Otto. (2006). Restarting automata with restricted utilization of auxiliary symbols. Theoretical Computer Science. 363(2). 162–181. 3 indexed citations
16.
Jurdziński, Tomasz, Friedrich Otto, František Mráz, & Martin Plátek. (2005). Deterministic Two-Way Restarting Automata and Marcus Contextual Grammars. Fundamenta Informaticae. 64(1). 217–228. 2 indexed citations
17.
Jurdziński, Tomasz, et al.. (2005). Efficient simulation of synchronous systems by multi-speed systems. RAIRO - Theoretical Informatics and Applications. 39(2). 403–419. 1 indexed citations
18.
Jurdziński, Tomasz, et al.. (2003). Weak communication in single‐hop radio networks: adjusting algorithms to industrial standards. Concurrency and Computation Practice and Experience. 15(11-12). 1117–1131. 7 indexed citations
19.
Jurdziński, Tomasz, et al.. (2002). Efficient algorithms for leader election in radio networks. 2 indexed citations
20.
Jurdziński, Tomasz, et al.. (2002). Efficient algorithms for leader election in radio networks. 51–57. 42 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026