Countries citing papers authored by Juraj Hromkovič
Since
Specialization
Citations
This map shows the geographic impact of Juraj Hromkovič'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 Juraj Hromkovič with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Juraj Hromkovič more than expected).
This network shows the impact of papers produced by Juraj Hromkovič. 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 Juraj Hromkovič. The network helps show where Juraj Hromkovič may publish in the future.
Co-authorship network of co-authors of Juraj Hromkovič
This figure shows the co-authorship network connecting the top 25 collaborators of Juraj Hromkovič.
A scholar is included among the top collaborators of Juraj Hromkovič 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 Juraj Hromkovič. Juraj Hromkovič 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.
Hromkovič, Juraj & Dennis Komm. (2019). Can Solving Short Tasks be an Essential Part of Constructionist Learning. Constructivist Foundations. 14(3). 402–404.1 indexed citations
2.
Hromkovič, Juraj, et al.. (2019). Constructing Computational Thinking using CS Unplugged. Constructivist Foundations. 14(3). 353–355.1 indexed citations
3.
Komm, Dennis, et al.. (2018). Interdisciplinary education in mathematics and informatics at swiss high schools. Bulletin of the European Association for Theoretical Computer Science. 2018(126). 67–78.2 indexed citations
4.
Hromkovič, Juraj, et al.. (2017). Algorithmic Thinking from the Start. Bulletin of the European Association for Theoretical Computer Science. 121(121). 132–139.4 indexed citations
5.
Hromkovič, Juraj, et al.. (2017). How to convince teachers to teach computer science even if informatics was never a part of their own studies. Bulletin of the European Association for Theoretical Computer Science. 123(123).1 indexed citations
6.
Hromkovič, Juraj, et al.. (2011). Fehlerkorrigierende Codes - Ein Unterrichtsbeispiel zum gelenkten entdeckenden Lernen.. 31. 50–55.1 indexed citations
Hromkovič, Juraj. (2001). Descriptional Complexity of Regular Languages (Concepts and Open Problems).. 11–13.1 indexed citations
10.
Hromkovič, Juraj & Ondřej Sýkora. (1998). Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science.8 indexed citations
11.
Ďuriš, Pavol, Juraj Hromkovič, Andrea Roli, & Georg Schnitger. (1997). On the Power of Las Vegas for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations. Electronic colloquium on computational complexity. 4.
12.
Hromkovič, Juraj. (1995). On the Communication Complexity of Distributive Language Generation.. 237–246.
13.
Hromkovič, Juraj, et al.. (1993). Deterministic Versus Nondeterministic Space in Terms of Synchronized Alternating Machines.. 314–325.1 indexed citations
14.
Hromkovič, Juraj, et al.. (1990). Optimal Algorithms for Dissemination of Information in Some Interconnection Networks (Extended Abstract). 337–346.1 indexed citations
15.
Hromkovič, Juraj. (1988). Some complexity aspects of VLSI computations, part 1. Computing and Informatics / Computers and Artificial Intelligence. 7(3). 229–252.2 indexed citations
16.
Hromkovič, Juraj, et al.. (1988). Graph controlled table Lindenmayer systems. Journal of automata, languages and combinatorics. 24(10). 481–493.2 indexed citations
17.
Ďuriš, Pavol & Juraj Hromkovič. (1987). Zerotesting bounded one-way multicounter machines. Kybernetika. 23(1). 13–18.1 indexed citations
Hromkovič, Juraj. (1985). On the number of monotonic functions from two-valued logic to k-valued logic. Kybernetika. 21(3). 228–234.2 indexed citations
20.
Hromkovič, Juraj. (1985). On one-way two-head deterministic finite state automata. Computing and Informatics / Computers and Artificial Intelligence. 4(6). 503–526.3 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.