Juraj Hromkovic

ORCID

Publication Activity (10 Years)

Years Active: 1981-2024
Publications (10 Years): 31

Top Venues

Publications

Hans-Joachim Böckenhauer, Matthias Gehnen, Juraj Hromkovic, Ralf Klasing, Dennis Komm, Henri Lotze, Daniel Mock, Peter Rossmanith, Moritz Stocker
Online Unbounded Knapsack. CoRR (2024)
Juraj Hromkovic
Kolmogorov complexity and nondeterminism versus determinism for polynomial time computations. Theor. Comput. Sci. 1013 (2024)
Fabian Frei, Juraj Hromkovic, Rastislav Královic, Richard Královic
Two-Way Non-Uniform Finite Automata. Int. J. Found. Comput. Sci. 34 (2&3) (2023)
Juraj Hromkovic, Regula Lacher
How Teaching Informatics Can Contribute to Improving Education in General. Bull. EATCS 139 (2023)
Juraj Hromkovic
Salomaa Prize in Automata Theory, Formal Languages and related topics. Bull. EATCS 136 (2022)
Fabian Frei, Juraj Hromkovic, Richard Královic, Rastislav Královic
Two-Way Non-uniform Finite Automata. DLT (2021)
Juraj Hromkovic
Kolmogorov complexity and nondeterminism versus determinism for polynomial time computations. Electron. Colloquium Comput. Complex. 28 (2021)
Valentina Dagiene, Juraj Hromkovic, Regula Lacher
Designing informatics curriculum for K-12 education: From Concepts to Implementations. Informatics Educ. 20 (3) (2021)
Hans-Joachim Böckenhauer, Elisabet Burjons, Juraj Hromkovic, Henri Lotze, Peter Rossmanith
Online Simple Knapsack with Reservation Costs. STACS (2021)
Juraj Hromkovic, Jacqueline Staub
The Problem with Debugging in Current Block-based Programming Environments. Bull. EATCS 135 (2021)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Sacha Krug, Walter Unger
On the advice complexity of the online dominating set problem. Theor. Comput. Sci. 862 (2021)
Fabian Frei, Juraj Hromkovic, Juhani Karhumäki
Roots and Powers in Regular Languages: Recognizing Nonregular Properties by Finite Automata. Fundam. Informaticae 175 (1-4) (2020)
Juraj Hromkovic, Peter Rossmanith
What one has to know when attacking P vs. NP. J. Comput. Syst. Sci. 107 (2020)
Hans-Joachim Böckenhauer, Elisabet Burjons, Juraj Hromkovic, Henri Lotze, Peter Rossmanith
Online Simple Knapsack with Reservation Costs. CoRR (2020)
Valentina Dagiene, Juraj Hromkovic, Regula Lacher
A Two-Dimensional Classification Model for the Bebras Tasks on Informatics Based Simultaneously on Subfields and Competencies. ISSEP (2020)
Juraj Hromkovic
Bilden wir die Erfinderinnen, Gestalter und Entwicklerinnen digitaler Technologie aus und nicht nur ihre Konsumenten! Inform. Spektrum 42 (2) (2019)
Juraj Hromkovic, Regula Lacher
E-Learning - Erwartungen, Möglichkeiten und Grenzen. Wirtschaftsinformatik Manag. 11 (6) (2019)
Juraj Hromkovic
Informatik im Kontext der allgemeinen Bildung. Inform. Spektrum 42 (2) (2019)
Maria Paola Bianchi, Juraj Hromkovic, Ivan Kovác
On the Size of Two-Way Reasonable Automata for the Liveness Problem. Int. J. Found. Comput. Sci. 29 (2) (2018)
Elisabet Burjons, Juraj Hromkovic, Rastislav Královic, Richard Královic, Xavier Muñoz, Walter Unger
Online Graph Coloring Against a Randomized Adversary. Int. J. Found. Comput. Sci. 29 (4) (2018)
Juraj Hromkovic, Tobias Kohn, Dennis Komm, Giovanni Serafini
Algorithmic Thinking from the Start. Bull. EATCS 121 (2017)
Juraj Hromkovic, Peter Rossmanith
What One Has to Know When Attacking P vs. NP (Extended Abstract). FCT (2017)
Juraj Hromkovic, Regula Lacher
How to convince teachers to teach computer science even if informatics was never a part of their own studies. Bull. EATCS 123 (2017)
Juraj Hromkovic, Giovanni Serafini, Jacqueline Staub
XLogoOnline: A Single-Page, Browser-Based Programming Environment for Schools Aiming at Reducing Cognitive Load on Pupils. ISSEP (2017)
Juraj Hromkovic, Regula Lacher
The Computer Science Way of Thinking in Human History and Consequences for the Design of Computer Science Curricula. ISSEP (2017)
Jhoirene B. Clemente, Juraj Hromkovic, Dennis Komm, Christian Kudahl
Advice Complexity of the Online Search Problem. IWOCA (2016)
Stefan Dobrev, Juraj Hromkovic, Dennis Komm, Richard Královic, Rastislav Královic, Tobias Mömke
The Complexity of Paging Against a Probabilistic Adversary. SOFSEM (2016)
Jhoirene B. Clemente, Juraj Hromkovic, Dennis Komm, Christian Kudahl
Advice Complexity of the Online Search Problem. CoRR (2016)
Elisabet Burjons, Juraj Hromkovic, Xavier Muñoz, Walter Unger
Online Graph Coloring with Advice and Randomized Adversary - (Extended Abstract). SOFSEM (2016)
Kfir Barhum, Juraj Hromkovic
On the Power of Laconic Advice in Communication Complexity. SOFSEM (2016)
Juraj Hromkovic, Tobias Kohn, Dennis Komm, Giovanni Serafini
Combining the Power of Python with the Simplicity of Logo for a Sustainable Computer Science Education. ISSEP (2016)
Maria Paola Bianchi, Juraj Hromkovic, Ivan Kovác
On the Size of Two-Way Reasonable Automata for the Liveness Problem. DLT (2015)
Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada
Corrigendum to "On the approximability and hardness of minimum topic connected overlay and its special instances" [Theoret. Comput. Sci. 429(2012) 144-154]. Theor. Comput. Sci. 562 (2015)
Juraj Hromkovic
Homo Informaticus. Bull. EATCS 115 (2015)
Juraj Hromkovic
Why the Concept of Computational Complexity is Hard for Verifiable Mathematics. Electron. Colloquium Comput. Complex. 22 (2015)
Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Lucia Keller
Online Coloring of Bipartite Graphs with and without Advice. Algorithmica 70 (1) (2014)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Sacha Krug, Jasmin Smula, Andreas Sprock
The string guessing problem as a method to prove lower bounds on the advice complexity. Theor. Comput. Sci. 554 (2014)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm
A Technique to Obtain Hardness Results for Randomized Online Algorithms - A Survey. Computing with New Resources (2014)
Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Sacha Krug, Björn Steffen
On the advice complexity of the online L(2, 1)-coloring problem on paths and cycles. Theor. Comput. Sci. 554 (2014)
Kfir Barhum, Hans-Joachim Böckenhauer, Michal Forisek, Heidi Gebauer, Juraj Hromkovic, Sacha Krug, Jasmin Smula, Björn Steffen
On the Power of Advice and Randomization for the Disjoint Path Allocation Problem. SOFSEM (2014)
Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Sacha Krug, Björn Steffen
(2, 1)-Coloring Problem on Paths and Cycles. COCOON (2013)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Sacha Krug, Jasmin Smula, Andreas Sprock
The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity. COCOON (2013)
Juraj Hromkovic, Rastislav Královic, Richard Královic, Richard Stefanec
Determinism vs. Nondeterminism for Two-Way Automata: Representing the Meaning of States by Logical Formulæ. Int. J. Found. Comput. Sci. 24 (7) (2013)
Hans-Joachim Böckenhauer, Karin Freiermuth, Juraj Hromkovic, Tobias Mömke, Andreas Sprock, Björn Steffen
Steiner tree reoptimization in graphs with sharpened triangle inequality. J. Discrete Algorithms 11 (2012)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Richard Královic, Peter Rossmanith
On the Power of Randomness versus Advice in Online Computation. Languages Alive (2012)
Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada
On the approximability and hardness of minimum topic connected overlay and its special instances. Theor. Comput. Sci. 429 (2012)
Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Lucia Keller
Online Coloring of Bipartite Graphs with and without Advice. COCOON (2012)
Juraj Hromkovic, Rastislav Královic, Richard Královic, Richard Stefanec
Determinism vs. Nondeterminism for Two-Way Automata - Representing the Meaning of States by Logical Formulæ. Developments in Language Theory (2012)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Sacha Krug, Jasmin Smula, Andreas Sprock
The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity. Electron. Colloquium Comput. Complex. 19 (2012)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Andreas Sprock
Knowing All Optimal Solutions Does Not Help for TSP Reoptimization. Computation, Cooperation, and Life (2011)
Juraj Hromkovic, Lucia Keller, Dennis Komm, Giovanni Serafini, Björn Steffen
Fehlerkorrigierende Codes - Ein Unterrichtsbeispiel zum gelenkten entdeckenden Lernen. LOG IN 31 (168) (2011)
Juraj Hromkovic, Björn Steffen
Why Teaching Informatics in Schools Is as Important as Teaching Mathematics and Natural Sciences. ISSEP (2011)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Andreas Sprock
On the Hardness of Reoptimization with Multiple Given Solutions. Fundam. Informaticae 110 (1-4) (2011)
Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada
On the Approximability and Hardness of Minimum Topic Connected Overlay and Its Special Instances CoRR (2011)
Juraj Hromkovic, Georg Schnitger
Ambiguity and Communication. Theory Comput. Syst. 48 (3) (2011)
D. Frank Hsu, Bruce M. Maggs, Howard C. T. Ho, Juraj Hromkovic, Francis C. M. Lau, Friedhelm Meyer auf der Heide
Editorial. J. Interconnect. Networks 12 (1-2) (2011)
Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada
On the Approximability of Minimum Topic Connected Overlay and Its Special Instances. MFCS (2011)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke
Improved Approximations for Hard Optimization Problems via Problem Instance Classification. Rainbow of Computer Science (2011)
Hans-Joachim Böckenhauer, Karin Freiermuth, Juraj Hromkovic, Tobias Mömke, Andreas Sprock, Björn Steffen
The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality. CIAC (2010)
Juraj Hromkovic, Georg Schnitger
On probabilistic pushdown automata. Inf. Comput. 208 (8) (2010)
Juraj Hromkovic, Rastislav Královic, Richard Královic
Information Complexity of Online Problems. MFCS (2010)
Juraj Hromkovic
Algorithmics - Is There Hope for a Unified Theory? CSR (2010)
Juraj Hromkovic, Borislav Suster, Eduard Toman
Preface. Fundam. Informaticae 104 (3) (2010)
Juraj Hromkovic, Holger Petersen, Georg Schnitger
On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's. Theor. Comput. Sci. 410 (30-32) (2009)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Rossmanith
Reoptimization of Steiner trees: Changing the terminal set. Theor. Comput. Sci. 410 (36) (2009)
Juraj Hromkovic, Georg Schnitger
Lower Bounds on the Size of Sweeping Automata. J. Autom. Lang. Comb. 14 (1) (2009)
Juraj Hromkovic, Georg Schnitger
Ambiguity and Communication CoRR (2009)
Juraj Hromkovic, Georg Schnitger
Ambiguity and Communication. STACS (2009)
Juraj Hromkovic, Przemyslawa Kanarek, Ralf Klasing, Krzysztof Lorys, Walter Unger, Hubert Wagener
On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks. SIAM J. Discret. Math. 23 (3) (2009)
Juraj Hromkovic, Georg Schnitger
On the Hardness of Determining Small NFA's and of Proving Lower Bounds on Their Sizes. Developments in Language Theory (2008)
Karin Freiermuth, Juraj Hromkovic, Björn Steffen
Creating and Testing Textbooks for Secondary Schools. ISSEP (2008)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke, Peter Widmayer
On the Hardness of Reoptimization. SOFSEM (2008)
Davide Bilò, Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Widmayer, Anna Zych
Reoptimization of Steiner Trees. SWAT (2008)
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
On k-connectivity problems with sharpened triangle inequality. J. Discrete Algorithms 6 (4) (2008)
Hans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovic, Joachim Kneis, Joachim Kupke, Guido Proietti, Peter Widmayer
On the Approximability of TSP on Local Modifications of Optimally Solved Instances. Algorithmic Oper. Res. 2 (2) (2007)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke
The Parameterized Approximability of TSP with Deadlines. Theory Comput. Syst. 41 (3) (2007)
Juraj Hromkovic, Georg Schnitger
Comparing the size of NFAs with and without epsilon-transitions. Theor. Comput. Sci. 380 (1-2) (2007)
Juraj Hromkovic, Tobias Mömke, Kathleen Steinhöfel, Peter Widmayer
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. Algorithmic Oper. Res. 2 (1) (2007)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Kathleen Steinhöfel
Efficient Algorithms for the Spoonerism Problem. FUN (2007)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke
On the Approximation Hardness of Some Generalizations of TSP. SWAT (2006)
Luca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert
On the Stability of Approximation for Hamiltonian Path Problems. Algorithmic Oper. Res. 1 (1) (2006)
Juraj Hromkovic
Contributing to General Education by Teaching Informatics. ISSEP (2006)
Hans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovic, Joachim Kneis, Joachim Kupke, Guido Proietti, Peter Widmayer
Reusing Optimal TSP Solutions for Locally Modified Input Instances. IFIP TCS (2006)
Luca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert
On the Stability of Approximation for Hamiltonian Path Problems. SOFSEM (2005)
Juraj Hromkovic, Georg Schnitger
Communication Complexity Method for Proving Lower Bounds on Descriptional Complexity in Automata and Formal Language Theory. DCFS (2005)
Juraj Hromkovic, Georg Schnitger
-Transitions. ICALP (2005)
Juraj Hromkovic, Georg Schnitger
On the power of randomized multicounter machines. Theor. Comput. Sci. 330 (1) (2005)
Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger
On multi-partition communication complexity. Inf. Comput. 194 (1) (2004)
Pavol Duris, Juraj Hromkovic, Katsushi Inoue
On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata. J. Comput. Syst. Sci. 68 (3) (2004)
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. Theor. Comput. Sci. 326 (1-3) (2004)
Juraj Hromkovic
Stability of Approximation in Discrete Optimization. IFIP TCS (2004)
Juraj Hromkovic, Georg Schnitger
Pushdown Automata and Multicounter Machines, a Comparison of Computation Modes. ICALP (2003)
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
On k-Edge-Connectivity Problems with Sharpened Triangle Inequality. CIAC (2003)
Juraj Hromkovic, Georg Schnitger
Nondeterministic Communication with a Limited Number of Advice Bits. SIAM J. Comput. 33 (1) (2003)
Juraj Hromkovic, Georg Schnitger
Nondeterminism versus Determinism for Two-Way Finite Automata: Generalizations of Sipser's Separation. ICALP (2003)
Juraj Hromkovic, Martin Sauerhoff
The Power of Nondeterminism and Randomness for Oblivious Branching Programs. Theory Comput. Syst. 36 (2) (2003)
Juraj Hromkovic, Sebastian Seibert, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger
Communication Complexity Method for Measuring Nondeterminism in Finite Automata. Inf. Comput. 172 (2) (2002)
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality. FSTTCS (2002)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. Theor. Comput. Sci. 285 (1) (2002)
Juraj Hromkovic
Descriptional Complexity of Finite Automata: Concepts and Open Problems. J. Autom. Lang. Comb. 7 (4) (2002)

Juraj Hromkovic.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Juraj Hromkovic