Juraj Hromkovič
- Computational Theory and Mathematics top 1%
- Artificial Intelligence top 5%
- Computer Networks and Communications top 5%
- Molecular Biology
- Electrical and Electronic Engineering
- Co-authors
- Georg SchnitgerSebastian SeibertHans-Joachim BöckenhauerRalf KlasingWalter UngerThomas WilkeJuhani KarhumäkiDennis Komm
- Topics
- semigroups and automata theory (40 papers)Complexity and Algorithms in Graphs (26 papers)DNA and Biological Computing (26 papers)
- Cited by
- Computational Theory and MathematicsComputer Networks and CommunicationsArtificial Intelligence
- Journals
- SIAM Journal on ComputingTheoretical Computer ScienceJournal of Computer and System Sciences
- Partner nations
- GermanySwitzerlandSlovakia
In The Last Decade
Juraj Hromkovič
113 papers receiving 945 citations
Peers
Comparison fields: 5 of 85
- Computational Theory and Mathematics 573
- Artificial Intelligence 383
- Computer Networks and Communications 317
- Molecular Biology 189
- Electrical and Electronic Engineering 120
Countries citing papers authored by Juraj Hromkovič
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).
Fields of papers citing papers by Juraj Hromkovič
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
| # | Work | Indexed citations |
|---|---|---|
| 1 | Can Solving Short Tasks be an Essential Part of Constructionist Learning | 1 |
| 2 | Constructing Computational Thinking using CS Unplugged | 1 |
| 3 | Interdisciplinary education in mathematics and informatics at swiss high schools | 2 |
| 4 | Algorithmic Thinking from the Start | 4 |
| 5 | How to convince teachers to teach computer science even if informatics was never a part of their own studies | 1 |
| 6 | Fehlerkorrigierende Codes - Ein Unterrichtsbeispiel zum gelenkten entdeckenden Lernen. | 1 |
| 7 | 40 | |
| 8 | 77 | |
| 9 | Descriptional Complexity of Regular Languages (Concepts and Open Problems). | 1 |
| 10 | Graph-theoretic concepts in computer science : 24th International Workshop, WG '98, Smolenice Castle, Slovak Republic, June 18-20, 1998 : proceedings | 0 |
| 11 | Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science | 8 |
| 12 | On the Power of Las Vegas for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations | 0 |
| 13 | Dissemination of Information in Vertex-Disjoint Paths Mode | 8 |
| 14 | On the Communication Complexity of Distributive Language Generation. | 0 |
| 15 | Deterministic Versus Nondeterministic Space in Terms of Synchronized Alternating Machines. | 1 |
| 16 | Reversals-space-parallelism tradeoffs for language recognition | 1 |
| 17 | Some complexity aspects of VLSI computations, part 1 | 2 |
| 18 | Zerotesting bounded one-way multicounter machines | 1 |
| 19 | Hierarchy of reversal bounded one-way multicounter machines | 1 |
| 20 | On the number of monotonic functions from two-valued logic to k-valued logic | 2 |
About Juraj Hromkovič
Juraj Hromkovič is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Science Applications, having authored 128 papers that have together received 1.0k indexed citations. Recurring topics across this work include semigroups and automata theory (40 papers), Complexity and Algorithms in Graphs (26 papers) and DNA and Biological Computing (26 papers). The work is most often cited by research in Computational Theory and Mathematics (573 citations), Computer Networks and Communications (317 citations) and Artificial Intelligence (383 citations). Juraj Hromkovič has collaborated with scholars based in Germany, Switzerland and Slovakia. Frequent co-authors include Georg Schnitger, Sebastian Seibert, Hans-Joachim Böckenhauer, Ralf Klasing, Walter Unger, Thomas Wilke, Juhani Karhumäki, Dennis Komm, Hubert Wagener and Hartmut Klauck. Their work appears in journals such as SIAM Journal on Computing, Theoretical Computer Science and Journal of Computer and System Sciences.
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.