Jiřı́ Wiedermann

891 total citations
40 papers, 231 citations indexed

About

Jiřı́ Wiedermann is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Molecular Biology. According to data from OpenAlex, Jiřı́ Wiedermann has authored 40 papers receiving a total of 231 indexed citations (citations by other indexed papers that have themselves been cited), including 17 papers in Artificial Intelligence, 16 papers in Computational Theory and Mathematics and 4 papers in Molecular Biology. Recurrent topics in Jiřı́ Wiedermann's work include Computability, Logic, AI Algorithms (12 papers), Cellular Automata and Applications (7 papers) and semigroups and automata theory (5 papers). Jiřı́ Wiedermann is often cited by papers focused on Computability, Logic, AI Algorithms (12 papers), Cellular Automata and Applications (7 papers) and semigroups and automata theory (5 papers). Jiřı́ Wiedermann collaborates with scholars based in Czechia, Netherlands and Slovakia. Jiřı́ Wiedermann's co-authors include Mogens Nielsen, Jan Van Leeuwen, Peter van Emde Boas, Jiřı́ Šı́ma, Jan Van Leeuwen, Ladjel Bellatreche, Stefan Biffl, A Min Tjoa, Petr Hájek and Jozef Gruska and has published in prestigious journals such as ACM Computing Surveys, Journal of the ACM and Theoretical Computer Science.

In The Last Decade

Jiřı́ Wiedermann

36 papers receiving 211 citations

Peers

Jiřı́ Wiedermann
Walter S. Brainerd United States
Philip Leonard United States
P.R.J. Asveld Netherlands
Bryant Tuckerman United States
Jiřı́ Wiedermann
Citations per year, relative to Jiřı́ Wiedermann Jiřı́ Wiedermann (= 1×) peers Theodore Andronikos

Countries citing papers authored by Jiřı́ Wiedermann

Since Specialization
Citations

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

Fields of papers citing papers by Jiřı́ Wiedermann

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jiřı́ Wiedermann. 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 Jiřı́ Wiedermann. The network helps show where Jiřı́ Wiedermann may publish in the future.

Co-authorship network of co-authors of Jiřı́ Wiedermann

This figure shows the co-authorship network connecting the top 25 collaborators of Jiřı́ Wiedermann. A scholar is included among the top collaborators of Jiřı́ Wiedermann 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 Jiřı́ Wiedermann. Jiřı́ Wiedermann 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.
Leeuwen, Jan Van & Jiřı́ Wiedermann. (2018). Question answering by humans and machines: A complexity-theoretic view. Theoretical Computer Science. 777. 464–473. 3 indexed citations
2.
Leeuwen, Jan Van & Jiřı́ Wiedermann. (2011). Computation as an unbounded process. Theoretical Computer Science. 429. 202–212. 12 indexed citations
3.
Wiedermann, Jiřı́. (2007). Autopoietic automata: Complexity issues in offspring-producing evolving processes. Theoretical Computer Science. 383(2-3). 260–269. 2 indexed citations
4.
Wiedermann, Jiřı́, et al.. (2006). SOFSEM 2006: Theory and Practice of Computer Science: 32nd Conference on Current Trends in Theory and Practice of Computer Science, Merin, Czech Republic, ... (Lecture Notes in Computer Science). Springer eBooks.
5.
Wiedermann, Jiřı́, et al.. (2006). SOFSEM 2006 : theory and practice of computer science : 32nd Conference on Current Trends in Theory and Practice of Computer Science, Měřín,Czech Republic, January 21-27, 2006 : proceedings. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)). 2 indexed citations
6.
Wiedermann, Jiřı́. (2004). Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines. Theoretical Computer Science. 317(1-3). 61–69. 20 indexed citations
7.
Leeuwen, Jan Van, et al.. (2003). Lineages of automata. Utrecht University Repository (Utrecht University). 2 indexed citations
8.
Wiedermann, Jiřı́. (2003). Mirror Neurons, Embodied Cognitive Agents and Imitation Learning. Digital Repository (National Repository of Grey Literature). 22(6). 545–559. 7 indexed citations
9.
Wiedermann, Jiřı́. (2002). Fuzzy Turing machines revised. Digital Repository (National Repository of Grey Literature). 21(3). 251–263. 11 indexed citations
10.
Wiedermann, Jiřı́ & Jan Van Leeuwen. (2002). The emergent computational potential of evolving artificial living systems. AI Communications. 15(4). 205–215. 8 indexed citations
11.
Wiedermann, Jiřı́ & Jan Van Leeuwen. (2001). A computational model of interaction in embedded systems. Utrecht University Repository (Utrecht University). 2001(2). 7 indexed citations
12.
Šı́ma, Jiřı́ & Jiřı́ Wiedermann. (1995). Neural Language Acceptors.. Digital Repository (National Repository of Grey Literature). 430–439. 1 indexed citations
14.
Wiedermann, Jiřı́. (1992). Optimal Algorithms for Sorting on Single-tape Turing Machines. 306–314. 2 indexed citations
15.
Wiedermann, Jiřı́. (1991). On the computational efficiency of symmetric neural networks. Theoretical Computer Science. 80(2). 337–345. 2 indexed citations
16.
Wiedermann, Jiřı́. (1989). On the power of synchronization. Journal of automata, languages and combinatorics. 25(10). 499–506. 9 indexed citations
17.
Wiedermann, Jiřı́. (1989). Fast simulation of nondeterministic turing machines with application to the knapsack problem. Computing and Informatics / Computers and Artificial Intelligence. 8(6). 591–596. 2 indexed citations
18.
Wiedermann, Jiřı́. (1983). Deterministic and Nondeterministic Simulation of the RAM by the Turing Machine.. IFIP Congress. 163–168. 7 indexed citations
19.
Wiedermann, Jiřı́. (1981). The complexity of lexicographic sorting and searching. Applications of Mathematics. 26(6). 432–436. 2 indexed citations
20.
Růžička, Peter & Jiřı́ Wiedermann. (1978). On the lower bound for minimum comparison selection. Applications of Mathematics. 23(1). 1–8. 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