Irek Ulidowski

1.1k total citations
34 papers, 271 citations indexed

About

Irek Ulidowski is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Irek Ulidowski has authored 34 papers receiving a total of 271 indexed citations (citations by other indexed papers that have themselves been cited), including 23 papers in Artificial Intelligence, 21 papers in Computational Theory and Mathematics and 10 papers in Computer Networks and Communications. Recurrent topics in Irek Ulidowski's work include Logic, programming, and type systems (14 papers), Formal Methods in Verification (14 papers) and Logic, Reasoning, and Knowledge (6 papers). Irek Ulidowski is often cited by papers focused on Logic, programming, and type systems (14 papers), Formal Methods in Verification (14 papers) and Logic, Reasoning, and Knowledge (6 papers). Irek Ulidowski collaborates with scholars based in United Kingdom, Japan and Italy. Irek Ulidowski's co-authors include Iain Phillips, Iain Phillips, Maciej Koutny, Shoji Yuen, Stefan Kühn, Ivan Lanese, Wei Wang, Shuihua Wang‎, Hengde Zhu and Huafeng Chen and has published in prestigious journals such as SHILAP Revista de lepidopterología, Knowledge-Based Systems and Theoretical Computer Science.

In The Last Decade

Irek Ulidowski

32 papers receiving 251 citations

Peers

Irek Ulidowski
Artur Jeż Poland
Irek Ulidowski
Citations per year, relative to Irek Ulidowski Irek Ulidowski (= 1×) peers Artur Jeż

Countries citing papers authored by Irek Ulidowski

Since Specialization
Citations

This map shows the geographic impact of Irek Ulidowski'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 Irek Ulidowski with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Irek Ulidowski more than expected).

Fields of papers citing papers by Irek Ulidowski

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Irek Ulidowski. 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 Irek Ulidowski. The network helps show where Irek Ulidowski may publish in the future.

Co-authorship network of co-authors of Irek Ulidowski

This figure shows the co-authorship network connecting the top 25 collaborators of Irek Ulidowski. A scholar is included among the top collaborators of Irek Ulidowski 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 Irek Ulidowski. Irek Ulidowski 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.
Lanese, Ivan, Iain Phillips, & Irek Ulidowski. (2024). An Axiomatic Theory for Reversible Computation. ACM Transactions on Computational Logic. 25(2). 1–40. 1 indexed citations
2.
Ulidowski, Irek, et al.. (2022). Reversing an imperative concurrent programming language. Science of Computer Programming. 223. 102873–102873. 3 indexed citations
3.
Kühn, Stefan & Irek Ulidowski. (2017). Local reversibility in a Calculus of Covalent Bonding. Science of Computer Programming. 151. 18–47. 8 indexed citations
4.
Morrison, Daniel R. & Irek Ulidowski. (2016). Direction-Reversible Self-Timed Cellular Automata for Delay-Insensitive Circuits.. 12. 101–120. 1 indexed citations
5.
Phillips, Iain & Irek Ulidowski. (2015). Reversibility and asymmetric conflict in event structures. Journal of Logical and Algebraic Methods in Programming. 84(6). 781–805. 19 indexed citations
6.
Koutny, Maciej & Irek Ulidowski. (2012). Concur 2012 - concurrency theory : 23rd International Conference, CONCUR 2012, Newcastle Upon Tyne, UK, September 4-7 2012, proceedings. DIAL (Catholic University of Leuven). 1 indexed citations
7.
Phillips, Iain & Irek Ulidowski. (2012). A hierarchy of reverse bisimulations on stable configuration structures. Mathematical Structures in Computer Science. 22(2). 333–372. 7 indexed citations
8.
Phillips, Iain, et al.. (2011). A logic with reverse modalities for historypreserving bisimulations. 7 indexed citations
9.
Cannata, Nicola, Emanuela Merelli, & Irek Ulidowski. (2010). Preface. Theoretical Computer Science. 411(20). 1997–1998. 1 indexed citations
10.
Ulidowski, Irek & Shoji Yuen. (2008). Generating priority rewrite systems for OSOS process languages. Information and Computation. 207(2). 120–145.
11.
Mousavi, Mohammad Reza, Iain Phillips, Michel Reniers, & Irek Ulidowski. (2008). Semantics and expressiveness of ordered SOS. Information and Computation. 207(2). 85–119. 7 indexed citations
12.
Mousavi, Mohammad Reza, et al.. (2007). Semantics and expressiveness of ordered SOS. TU/e Research Portal (Eindhoven University of Technology). 707. 2 indexed citations
13.
Phillips, Iain & Irek Ulidowski. (2007). Reversing algebraic process calculi. The Journal of Logic and Algebraic Programming. 73(1-2). 70–96. 54 indexed citations
14.
Mosses, Peter D. & Irek Ulidowski. (2006). Preface. Theoretical Computer Science. 373(3). 161–162. 1 indexed citations
15.
Ulidowski, Irek & Shoji Yuen. (2004). Process languages with discrete relative time based on the Ordered SOS format and rooted eager bisimulation. The Journal of Logic and Algebraic Programming. 60-61. 401–460. 10 indexed citations
16.
Ulidowski, Irek & Iain Phillips. (2002). Ordered SOS Process Languages for Branching and Eager Bisimulations. Information and Computation. 178(1). 180–213. 1 indexed citations
17.
Ulidowski, Irek. (2002). Ordered SOS Process Languages for Branching and Eager Bisimulations. Information and Computation. 178(1). 180–213. 22 indexed citations
18.
Ulidowski, Irek. (2000). Finite axiom systems for testing preorder and De Simone process languages. Theoretical Computer Science. 239(1). 97–139. 16 indexed citations
19.
Subieta, Kazimierz, et al.. (1998). Processing semi-structured data in object bases. 3–51.
20.
Phillips, Iain & Irek Ulidowski. (1997). ORDERED SOS RULES AND WEAK BISIMULATION(Concurrency Theory and Applications '96). Kyoto University Research Information Repository (Kyoto University). 996(996). 195–206. 1 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