Citations per year, relative to Rudolf Freund Rudolf Freund (= 1×)
peers
Ignacio Pérez–Hurtado
Countries citing papers authored by Rudolf Freund
Since
Specialization
Citations
This map shows the geographic impact of Rudolf Freund'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 Rudolf Freund with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Rudolf Freund more than expected).
This network shows the impact of papers produced by Rudolf Freund. 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 Rudolf Freund. The network helps show where Rudolf Freund may publish in the future.
Co-authorship network of co-authors of Rudolf Freund
This figure shows the co-authorship network connecting the top 25 collaborators of Rudolf Freund.
A scholar is included among the top collaborators of Rudolf Freund 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 Rudolf Freund. Rudolf Freund 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.
Alhazov, Artiom, et al.. (2023). Numerical networks of cells. Theoretical Computer Science. 958. 113873–113873.1 indexed citations
Freund, Rudolf, et al.. (2016). Going Beyond Turing with P Automata: Regular Observer ω-Languages and Partial Adult Halting.. International journal of unconventional computing. 12. 51–69.1 indexed citations
8.
Freund, Rudolf. (2016). P Automata: New ideas and results.. 13–40.2 indexed citations
Freund, Rudolf & Marion Oswald. (2013). Catalytic and purely catalytic P automata: control mechanisms for obtaining computational completeness.. 133–150.2 indexed citations
11.
Freund, Rudolf & Marion Oswald. (2008). Regular ω-Languages Defined by Finite Extended Spiking Neural P Systems. Fundamenta Informaticae. 83(1). 65–73.8 indexed citations
12.
Freund, Rudolf & Marion Oswald. (2007). Modelling Grammar Systems by Tissue P Systems Working in the Sequential Mode. Fundamenta Informaticae. 76(3). 305–323.5 indexed citations
13.
Freund, Rudolf, et al.. (2007). On String Languages Generated by Spiking Neural P Systems. Fundamenta Informaticae. 75(1). 141–162.121 indexed citations
14.
Freund, Rudolf & Marion Oswald. (2006). A Small Universal Antiport P System with Forbidden Context.. 259–266.1 indexed citations
15.
Freund, Rudolf, Marion Oswald, & Andrei Păun. (2004). Gemmating P Systems are Computationally Complete with Four Membranes.. 191–203.2 indexed citations
16.
Freund, Rudolf, Marion Oswald, & Petr Sosı́k. (2003). Reducing the Number of Catalysts Needed in Computationally Universal P Systems without Priorities.. 102–113.3 indexed citations
17.
Freund, Rudolf & Marion Oswald. (2002). A Short Note on Analysing P Systems with Antiport Rules.. Bulletin of the European Association for Theoretical Computer Science. 78. 231–236.22 indexed citations
18.
Freund, Rudolf & Marion Oswald. (2002). GP Systems with Forbidding Context. Fundamenta Informaticae. 49(1). 81–102.20 indexed citations
19.
Freund, Rudolf. (2001). Special Variants of P Systems Inducing an Infinite Hierarchy with Respect to the Number of Membranes.. Bulletin of the European Association for Theoretical Computer Science. 75. 209–219.4 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.