Closure Properties of the Family of Languages Recognized by One-Way Two-Head Deterministic Finite State Automata. - Juraj Hromkovic (MFCS, 1981)

Multihead Finite State Automata and Concatenation. - Pavol Duris; Juraj Hromkovic (ICALP, 1982)

On-Way Multihead Deterministic Finite Automata. - Juraj Hromkovic (Acta Informatica, 1983)

One-Way Simple Multihead Finite Automata are not Closed Under Concatenation. - Pavol Duris; Juraj Hromkovic (Theor. Comput. Sci., 1983)

Communication Complexity. - Juraj Hromkovic (ICALP, 1984)

Hierarchy of Reversal and Zerotesting Bounded Multicounter Machines. - Juraj Hromkovic (MFCS, 1984)

On the Power of Alternation in Finite Automata. - Juraj Hromkovic (MFCS, 1984)

On the power of Yao-Rivest technique. - Juraj Hromkovic (Bull. EATCS, 1984)

A note on the "Comuunication Complexity" paper by Papadimitriou and Sipser. - Juraj Hromkovic (Bull. EATCS, 1984)

Fooling a Two-Way Nondeterministic Multihead Automaton with Reversal Number Restriction. - Juraj Hromkovic (Acta Informatica, 1985)

Alternating Multicounter Machines with Constant Number of Reversals. - Juraj Hromkovic (Inf. Process. Lett., 1985)

Linear Lower Bounds on Unbounded Fan-In Boolean Circuits. - Juraj Hromkovic (Inf. Process. Lett., 1985)

On the Power of Alternation in Automata Theory. - Juraj Hromkovic (J. Comput. Syst. Sci., 1985)

On the number of monotonic functions from two-valued logic to k-valued logic. - Juraj Hromkovic (Kybernetika, 1985)

Tradeoffs for Language Recognition on Parallel Computing Models. - Juraj Hromkovic (ICALP, 1986)

Lower bound techniques for VLSI algorithms. - Juraj Hromkovic (IMYCS, 1986)

A New Approach to Defining the Complexity for VLSI. - Juraj Hromkovic (MFCS, 1986)

Hierarchy of reversal bounded one-way multicounter machines. - Juraj Hromkovic (Kybernetika, 1986)

Communication Complexity Hierarchy. - Juraj Hromkovic (Theor. Comput. Sci., 1986)

Reversal Complexity of Multicounter and Multihead Machines. - Juraj Hromkovic (STACS, 1987)

Zerotesting bounded one-way multicounter machines. - Pavol Duris; Juraj Hromkovic (Kybernetika, 1987)

Reversal-Bounded Nondeterministic Multicounter Machines and Complementation. - Juraj Hromkovic (Theor. Comput. Sci., 1987)

Branching Programs as a Tool for Proving Lower Bounds on VLSI Computations and Optimal Algorithms for Systolic Arrays. - Juraj Hromkovic; Juraj Procházka (MFCS, 1988)

A candidate for nonlinear lower bound on the combinatorial complexity. - Juraj Hromkovic (Bull. EATCS, 1988)

Graph Controlled Table Lindenmayer Systems. - Juraj Hromkovic; Erika Kupková (J. Inf. Process. Cybern., 1988)

The Advantages of a New Approach to Defining the Communication Complexity for VLSI. - Juraj Hromkovic (Theor. Comput. Sci., 1988)

On the Power of Synchronization in Parallel Computations. - Jürgen Dassow; Juraj Hromkovic; Juhani Karhumäki; Branislav Rovan; Anna Slobodová (MFCS, 1989)

The knowledge on information content of problems provides much useful information to circuit designers. - Juraj Hromkovic (Bull. EATCS, 1989)

Lower Bounds for Language Recognition on Two-Dimensional Alternating Multihead Machines. - Juraj Hromkovic; Katsushi Inoue; Itsuo Takanami (J. Comput. Syst. Sci., 1989)

Tradeoffs for Language Recognition on Alternating Machines. - Juraj Hromkovic (Theor. Comput. Sci., 1989)

A Leaf-Size Hierarchy of Two-Dimensional Alternating Turing Machines. - Katsushi Inoue; Itsuo Takanami; Juraj Hromkovic (Theor. Comput. Sci., 1989)

Optimal Algorithms for Dissemination of Information in Some Interconnection Networks (Extended Abstract). - Juraj Hromkovic; Claus-Dieter Jeschke; Burkhard Monien (MFCS, 1990)

Nonlinear Lower Bounds on the Number of Processors of Circuits with Sublinear Separators (Extended Abstract). - Juraj Hromkovic (FCT, 1991)

The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems). - Juraj Hromkovic; Burkhard Monien (MFCS, 1991)

On the power of synchronization in parallel computations. - Juraj Hromkovic; Juhani Karhumäki; Branislav Rovan; Anna Slobodová (Discret. Appl. Math., 1991)

Variable Multihead Machines. - Juraj Hromkovic; Ladislav Janiga; Václav Koubek (J. Inf. Process. Cybern., 1991)

On the power of two-dimensional synchronized alternating finite automata. - Juraj Hromkovic (Fundam. Informaticae, 1991)

Branching programs provide lower bounds on the area of VLSI circuits. - Juraj Hromkovic (Kybernetika, 1991)

On Problems for Which no Oracle Can Help. - Juraj Hromkovic (Math. Syst. Theory, 1991)

Nonlinear Lower Bounds on the Number of Processors of Circuits with Sublinear Separators - Juraj Hromkovic (Inf. Comput., 1991)

The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems). - Juraj Hromkovic; Burkhard Monien (Informatik, 1992)

Optimal Algorithms for Disemination of Information in Generalized Communication Modes. - Rainer Feldmann; Juraj Hromkovic; Seshu Madhavapeddy; Burkhard Monien; Peter Mysliwietz (PARLE, 1992)

On Embedding Interconnection Networks into Rings of Processors. - Juraj Hromkovic; Vladimír Müller; Ondrej Sýkora; Imrich Vrto (PARLE, 1992)

A Nonlinear Lower Bound on the Practical Combinational Complexity. - Xaver Gubás; Juraj Hromkovic; Juraj Waczulík (STACS, 1992)

Topology of Parallel Networks and Computational Complexity (Extended Abstract). - Juraj Hromkovic (WG, 1992)

On the Power of One-Way Synchronized Alternating Machines with Small Space. - Juraj Hromkovic; Katsushi Inoue; Branislav Rovan; Anna Slobodová; Itsuo Takanami; Klaus W. Wagner (Int. J. Found. Comput. Sci., 1992)

Abstract symbol systems - an exercise of the bottom-up approach in artificial intelligence. - Juraj Hromkovic; Jozef Kelemen; Juraj Waczulík (J. Exp. Theor. Artif. Intell., 1992)

Lower Bounds on the Area Complexity of Boolean Circuits. - Juraj Hromkovic; Sergej A. Lozkin; Andrej I. Rybko; Alexander A. Sapozhenko; Nadezda A. Skalikova (Theor. Comput. Sci., 1992)

Branching Programs Provide Lower Bounds on the Areas of Multilective Deterministic and Nondeterministic VLSI-Circuits - Juraj Hromkovic; Matthias Krause 001; Christoph Meinel; Stephan Waack (Inf. Comput., 1992)

Deterministic Versus Nondeterministic Space in Terms of Synchronized Alternating Machines. - Juraj Hromkovic; Branislav Rovan; Anna Slobodová (Developments in Language Theory, 1993)

Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs. - Juraj Hromkovic; Ralf Klasing; Elena Stöhr; Hubert Wagener (ESA, 1993)

Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems. - Juraj Hromkovic; Jarkko Kari 001; Lila Kari (MFCS, 1993)

Gossiping in Vertex-Disjoint Path Mode in Interconnection Networks. - Juraj Hromkovic; Ralf Klasing; Elena Stöhr (WG, 1993)

Optimal Algorithms for Dissemination of Information in Some Interconnection Networks. - Juraj Hromkovic; Claus-Dieter Jeschke; Burkhard Monien (Algorithmica, 1993)

A Note on Realtime One-Way Synchronized Alternating One-Counter Automata. - Juraj Hromkovic; Katsushi Inoue (Theor. Comput. Sci., 1993)

Lower Bounds on Systolic Array Computations and the Optimality of Kung's Convolution Algorithm. - Juraj Hromkovic; Juraj Procházka (Mathematical Aspects of Natural and Formal Languages, 1994)

Comparing Descriptional and Computational Complexity of Infinite Words. - Juraj Hromkovic; Juhani Karhumäki; Arto Lepistö (Results and Trends in Theoretical Computer Science, 1994)

The Complexity of Systolic Dissemination of Information in Interconnection Networks. - Juraj Hromkovic; Ralf Klasing; Walter Unger; Hubert Wagener; Dana Pardubská (Canada-France Conference on Parallel and Distributed Computing, 1994)

Two Lower Bounds on Computational Complexity of Infinite Word Generation. - Juraj Hromkovic; Juhani Karhumäki (IFIP Congress (1), 1994)

A Comparison of Two Lower Bound Methods for Communication Complexity. - Martin Dietzfelbinger; Juraj Hromkovic; Georg Schnitger (MFCS, 1994)

Two Lower Bounds on Distributive Generation of Languages. - Juraj Hromkovic; Jarkko Kari 001; Lila Kari; Dana Pardubská (MFCS, 1994)

Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract). - Juraj Hromkovic; Ralf Klasing; Walter Unger; Hubert Wagener (SWAT, 1994)

Optimal algorithms for dissemination of information in generalized communication modes. - Rainer Feldmann; Juraj Hromkovic; Seshu Madhavapeddy; Burkhard Monien; Peter Mysliwietz (Discret. Appl. Math., 1994)

Note on Optimal Gossiping in Some Weak-Connected Graphs. - Juraj Hromkovic; Claus-Dieter Jeschke; Burkhard Monien (Theor. Comput. Sci., 1994)

On the Communication Complexity of Distributive Language Generation. - Juraj Hromkovic (Developments in Language Theory, 1995)

Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids (Extended Abstract). - Juraj Hromkovic; Ralf Klasing; Dana Pardubská; Walter Unger; Juraj Waczulík; Hubert Wagener (FCT, 1995)

On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks. - Juraj Hromkovic; Krzysztof Lorys; Przemyslawa Kanarek; Ralf Klasing; Walter Unger; Hubert Wagener (STACS, 1995)

On Embeddings in Cycles - Juraj Hromkovic; Vladimír Müller; Ondrej Sýkora; Imrich Vrto (Inf. Comput., 1995)

Nondeterministic Communication with a Limited Number of Advice Bits. - Juraj Hromkovic; Georg Schnitger (STOC, 1996)

Dissemination of Information in Vertex-Disjoint Paths Mode. - Juraj Hromkovic; Ralf Klasing; Elena Stöhr (Comput. Artif. Intell., 1996)

Communication Complexity and Parallel Computing. - Juraj Hromkovic (Springer, 1997)

Two Lower Bounds on Computational Complexity of Infinite Words. - Juraj Hromkovic; Juhani Karhumäki (New Trends in Formal Languages, 1997)

Communication Complexity and Sequential Compuation. - Juraj Hromkovic; Georg Schnitger (MFCS, 1997)

Las Vegas Versus Determinism for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations. - Pavol Duris; Juraj Hromkovic; José D. P. Rolim; Georg Schnitger (STACS, 1997)

Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata. - Juraj Hromkovic; Sebastian Seibert; Thomas Wilke (STACS, 1997)

On the Power of Las Vegas for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations - Pavol Duris; Juraj Hromkovic; José D. P. Rolim; Georg Schnitger (Electron. Colloquium Comput. Complex., 1997)

Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes. - Juraj Hromkovic; Ralf Klasing; Walter Unger; Hubert Wagener (Inf. Comput., 1997)

Complexity: A Language-Theoretic Point of View. - Cristian Calude; Juraj Hromkovic (Handbook of Formal Languages (2), 1997)

Communication Complexity and Lower Bounds on Multilective Computations. - Juraj Hromkovic (MFCS, 1998)

Effective Systolic Algorithms for Gossiping in Cycles. - Juraj Hromkovic; Ralf Klasing; Dana Pardubská; Juraj Waczulík; Hubert Wagener (Parallel Process. Lett., 1998)

Stability of Approximation Algorithms and the Knapsack Problem. - Juraj Hromkovic (Jewels are Forever, 1999)

On the Power of Las Vegas II. Two-Way Finite Automata. - Juraj Hromkovic; Georg Schnitger (ICALP, 1999)

Stability of Approximation Algorithms for Hard Optimization Problems. - Juraj Hromkovic (SOFSEM, 1999)

Some Constributions of the Study of Abstract Communication Complexity to Other Areas of Computer Science. - Juraj Hromkovic (ACM Comput. Surv., 1999)

Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Ralf Klasing; Sebastian Seibert; Walter Unger (CIAC, 2000)

A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition. - Pavol Duris; Juraj Hromkovic; Katsushi Inoue (CCC, 2000)

Measures of Nondeterminism in Finite Automata. - Juraj Hromkovic; Juhani Karhumäki; Hartmut Klauck; Georg Schnitger; Sebastian Seibert (ICALP, 2000)

Introduction: Workshop on Boolean Functions and Applications. - Juraj Hromkovic; Ingo Wegener (ICALP Satellite Workshops, 2000)

An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Ralf Klasing; Sebastian Seibert; Walter Unger (STACS, 2000)

Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs. - Juraj Hromkovic; Martin Sauerhoff (STACS, 2000)

Approximation algorithms for the TSP with sharpened triangle inequality. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Ralf Klasing; Sebastian Seibert; Walter Unger (Inf. Process. Lett., 2000)

Algorithmics for hard problems - introduction to combinatorial optimization, randomization, approximation, and heuristics. - Juraj Hromkovic (Springer, 2001)

Algorithmischen Konzepte der Informatik - Berechenbarkeit, Komplexitätstheorie, Algorithmik, Kryptographie - Juraj Hromkovic (Teubner, 2001)

Descriptional Complexity of Regular Languages (Concepts and Open Problems). - Juraj Hromkovic (DCFS, 2001)

On the Power of Randomized Pushdown Automata. - Juraj Hromkovic; Georg Schnitger (Developments in Language Theory, 2001)

Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. - Juraj Hromkovic; Kathleen Steinhöfel; Peter Widmayer (ICTCS, 2001)

Randomized Communication Protocols (A Survey). - Juraj Hromkovic (SAGA, 2001)

On Multipartition Communication Complexity. - Pavol Duris; Juraj Hromkovic; Stasys Jukna; Martin Sauerhoff; Georg Schnitger (STACS, 2001)

Preface. - Juraj Hromkovic; Ondrej Sýkora (Discret. Appl. Math., 2001)

On the Power of Las Vegas for One-Way Communication Complexity, OBDDs, and Finite Automata. - Juraj Hromkovic; Georg Schnitger (Inf. Comput., 2001)

Translating Regular Expressions into Small -Free Nondeterministic Finite Automata. - Juraj Hromkovic; Sebastian Seibert; Thomas Wilke (J. Comput. Syst. Sci., 2001)

Zufall und zufallsgesteuerte Algorithmen. - Juraj Hromkovic (LOG IN, 2001)

Foreword. - Rusins Freivalds; Juraj Hromkovic; Gheorghe Paun; Walter Unger (Theor. Comput. Sci., 2001)

Algorithmics for Hard Problems - Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics - Juraj Hromkovic (Springer, 2001)

On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality. - Hans-Joachim Böckenhauer; Dirk Bongartz; Juraj Hromkovic; Ralf Klasing; Guido Proietti; Sebastian Seibert; Walter Unger (FSTTCS, 2002)

Communication Complexity Method for Measuring Nondeterminism in Finite Automata. - Juraj Hromkovic; Sebastian Seibert; Juhani Karhumäki; Hartmut Klauck; Georg Schnitger (Inf. Comput., 2002)

Descriptional Complexity of Finite Automata: Concepts and Open Problems. - Juraj Hromkovic (J. Autom. Lang. Comb., 2002)

On k-Edge-Connectivity Problems with Sharpened Triangle Inequality. - Hans-Joachim Böckenhauer; Dirk Bongartz; Juraj Hromkovic; Ralf Klasing; Guido Proietti; Sebastian Seibert; Walter Unger (CIAC, 2003)

Pushdown Automata and Multicounter Machines, a Comparison of Computation Modes. - Juraj Hromkovic; Georg Schnitger (ICALP, 2003)

Nondeterminism versus Determinism for Two-Way Finite Automata: Generalizations of Sipser's Separation. - Juraj Hromkovic; Georg Schnitger (ICALP, 2003)

The Power of Nondeterminism and Randomness for Oblivious Branching Programs. - Juraj Hromkovic; Martin Sauerhoff (Theory Comput. Syst., 2003)

Stability of Approximation in Discrete Optimization. - Juraj Hromkovic (IFIP TCS, 2004)

On multi-partition communication complexity. - Pavol Duris; Juraj Hromkovic; Stasys Jukna; Martin Sauerhoff; Georg Schnitger (Inf. Comput., 2004)

On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata. - Pavol Duris; Juraj Hromkovic; Katsushi Inoue (J. Comput. Syst. Sci., 2004)

Algorithmics for Hard Problems - Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics, Second Edition - Juraj Hromkovic (Springer, 2004)

Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance - Juraj Hromkovic; Ralf Klasing; Andrzej Pelc; Peter Ruzicka; Walter Unger (Springer, 2005)

Communication Complexity Method for Proving Lower Bounds on Descriptional Complexity in Automata and Formal Language Theory. - Juraj Hromkovic; Georg Schnitger (DCFS, 2005)

NFAs With and Without epsilon-Transitions. - Juraj Hromkovic; Georg Schnitger (ICALP, 2005)

On the Stability of Approximation for Hamiltonian Path Problems. - Luca Forlizzi; Juraj Hromkovic; Guido Proietti; Sebastian Seibert (SOFSEM, 2005)

On the power of randomized multicounter machines. - Juraj Hromkovic; Georg Schnitger (Theor. Comput. Sci., 2005)

Design and Analysis of Randomized Algorithms - Introduction to Design Paradigms - Juraj Hromkovic (Springer, 2005)

Sieben Wunder der Informatik - eine Reise an die Grenze des Machbaren mit Aufgaben und Lösungen. - Juraj Hromkovic (Teubner, 2006)

Reusing Optimal TSP Solutions for Locally Modified Input Instances. - Hans-Joachim Böckenhauer; Luca Forlizzi; Juraj Hromkovic; Joachim Kneis; Joachim Kupke 002; Guido Proietti; Peter Widmayer (IFIP TCS, 2006)

Contributing to General Education by Teaching Informatics. - Juraj Hromkovic (ISSEP, 2006)

On the Approximation Hardness of Some Generalizations of TSP. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Joachim Kneis; Joachim Kupke 002 (SWAT, 2006)

Theoretische Informatik - formale Sprachen, Berechenbarkeit, Komplexitätstheorie, Algorithmik, Kommunikation und Kryptographie, 3. Auflage. - Juraj Hromkovic (Teubner, 2007)

Efficient Algorithms for the Spoonerism Problem. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Richard Královic; Tobias Mömke; Kathleen Steinhöfel (FUN, 2007)

On the Approximability of TSP on Local Modifications of Optimally Solved Instances. - Hans-Joachim Böckenhauer; Luca Forlizzi; Juraj Hromkovic; Joachim Kneis; Joachim Kupke 002; Guido Proietti; Peter Widmayer (Algorithmic Oper. Res., 2007)

Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. - Juraj Hromkovic; Tobias Mömke; Kathleen Steinhöfel; Peter Widmayer (Algorithmic Oper. Res., 2007)

The Parameterized Approximability of TSP with Deadlines. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Joachim Kneis; Joachim Kupke 002 (Theory Comput. Syst., 2007)

Comparing the size of NFAs with and without epsilon-transitions. - Juraj Hromkovic; Georg Schnitger (Theor. Comput. Sci., 2007)

Stability of Approximation. - Hans-Joachim Böckenhauer; Sebastian Seibert; Juraj Hromkovic (Handbook of Approximation Algorithms and Metaheuristics, 2007)

Lehrbuch Informatik - Vorkurs Programmieren, Geschichte und Begriffsbildung, Automatenentwurf. - Juraj Hromkovic (Vieweg, 2008)

On the Hardness of Determining Small NFA's and of Proving Lower Bounds on Their Sizes. - Juraj Hromkovic; Georg Schnitger (Developments in Language Theory, 2008)

Creating and Testing Textbooks for Secondary Schools. - Karin Freiermuth; Juraj Hromkovic; Björn Steffen (ISSEP, 2008)

On the Hardness of Reoptimization. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Tobias Mömke; Peter Widmayer (SOFSEM, 2008)

Reoptimization of Steiner Trees. - Davide Bilò; Hans-Joachim Böckenhauer; Juraj Hromkovic; Richard Královic; Tobias Mömke; Peter Widmayer; Anna Zych (SWAT, 2008)

On k-connectivity problems with sharpened triangle inequality. - Hans-Joachim Böckenhauer; Dirk Bongartz; Juraj Hromkovic; Ralf Klasing; Guido Proietti; Sebastian Seibert; Walter Unger (J. Discrete Algorithms, 2008)

Algorithmic Adventures - From Knowledge to Magic. - Juraj Hromkovic (Springer, 2009)

Sieben Wunder der Informatik - Eine Reise an die Grenze des Machbaren mit Aufgaben und Lösungen (2. Aufl.). - Juraj Hromkovic (Teubner, 2009)

Ambiguity and Communication. - Juraj Hromkovic; Georg Schnitger (STACS, 2009)

Lower Bounds on the Size of Sweeping Automata. - Juraj Hromkovic; Georg Schnitger (J. Autom. Lang. Comb., 2009)

On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks. - Juraj Hromkovic; Przemyslawa Kanarek; Ralf Klasing; Krzysztof Lorys; Walter Unger; Hubert Wagener (SIAM J. Discret. Math., 2009)

Reoptimization of Steiner trees: Changing the terminal set. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Richard Královic; Tobias Mömke; Peter Rossmanith (Theor. Comput. Sci., 2009)

On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's. - Juraj Hromkovic; Holger Petersen 001; Georg Schnitger (Theor. Comput. Sci., 2009)

The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality. - Hans-Joachim Böckenhauer; Karin Freiermuth; Juraj Hromkovic; Tobias Mömke; Andreas Sprock; Björn Steffen (CIAC, 2010)

Algorithmics - Is There Hope for a Unified Theory? - Juraj Hromkovic (CSR, 2010)

Information Complexity of Online Problems. - Juraj Hromkovic; Rastislav Královic; Richard Královic (MFCS, 2010)

Preface. - Juraj Hromkovic; Borislav Suster; Eduard Toman (Fundam. Informaticae, 2010)

On probabilistic pushdown automata. - Juraj Hromkovic; Georg Schnitger (Inf. Comput., 2010)

Improved Approximations for Hard Optimization Problems via Problem Instance Classification. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Tobias Mömke (Rainbow of Computer Science, 2011)

Knowing All Optimal Solutions Does Not Help for TSP Reoptimization. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Andreas Sprock (Computation, Cooperation, and Life, 2011)

Why Teaching Informatics in Schools Is as Important as Teaching Mathematics and Natural Sciences. - Juraj Hromkovic; Björn Steffen (ISSEP, 2011)

On the Approximability of Minimum Topic Connected Overlay and Its Special Instances. - Jun Hosoda; Juraj Hromkovic; Taisuke Izumi; Hirotaka Ono 001; Monika Steinová; Koichi Wada 001 (MFCS, 2011)

On the Hardness of Reoptimization with Multiple Given Solutions. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Andreas Sprock (Fundam. Informaticae, 2011)

Editorial. - D. Frank Hsu; Bruce M. Maggs; Howard C. T. Ho; Juraj Hromkovic; Francis C. M. Lau 001; Friedhelm Meyer auf der Heide (J. Interconnect. Networks, 2011)

Fehlerkorrigierende Codes - Ein Unterrichtsbeispiel zum gelenkten entdeckenden Lernen. - Juraj Hromkovic; Lucia Keller; Dennis Komm; Giovanni Serafini; Björn Steffen (LOG IN, 2011)

Einführung in die Programmierung mit LOGO - Lehrbuch für Unterricht und Selbststudium (2. Aufl.). - Juraj Hromkovic (Vieweg+Teubner, 2012)

On the Power of Randomness versus Advice in Online Computation. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Dennis Komm; Richard Královic; Peter Rossmanith (Languages Alive, 2012)

Online Coloring of Bipartite Graphs with and without Advice. - Maria Paola Bianchi; Hans-Joachim Böckenhauer; Juraj Hromkovic; Lucia Keller (COCOON, 2012)

Determinism vs. Nondeterminism for Two-Way Automata - Representing the Meaning of States by Logical Formulæ. - Juraj Hromkovic; Rastislav Královic; Richard Královic; Richard Stefanec (Developments in Language Theory, 2012)

Steiner tree reoptimization in graphs with sharpened triangle inequality. - Hans-Joachim Böckenhauer; Karin Freiermuth; Juraj Hromkovic; Tobias Mömke; Andreas Sprock; Björn Steffen (J. Discrete Algorithms, 2012)

On the approximability and hardness of minimum topic connected overlay and its special instances. - Jun Hosoda; Juraj Hromkovic; Taisuke Izumi; Hirotaka Ono 001; Monika Steinová; Koichi Wada 001 (Theor. Comput. Sci., 2012)

Was ist Informatik? - Juraj Hromkovic; Jürg Kohlas (informatik@gymnasium, 2013)

Die Bildungsziele. - Juraj Hromkovic; Jürg Kohlas (informatik@gymnasium, 2013)

Konzepte und Inhalte eines Fachs Informatik. - Juraj Hromkovic; Jürg Kohlas; Carl August Zehnder (informatik@gymnasium, 2013)

On the Advice Complexity of the Online L(2, 1)-Coloring Problem on Paths and Cycles. - Maria Paola Bianchi; Hans-Joachim Böckenhauer; Juraj Hromkovic; Sacha Krug; Björn Steffen (COCOON, 2013)

The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Dennis Komm; Sacha Krug; Jasmin Smula; Andreas Sprock (COCOON, 2013)

A Technique to Obtain Hardness Results for Randomized Online Algorithms - A Survey. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Dennis Komm (Computing with New Resources, 2014)

On the Power of Advice and Randomization for the Disjoint Path Allocation Problem. - Kfir Barhum; Hans-Joachim Böckenhauer; Michal Forisek; Heidi Gebauer; Juraj Hromkovic; Sacha Krug; Jasmin Smula; Björn Steffen (SOFSEM, 2014)

On the advice complexity of the online L(2, 1)-coloring problem on paths and cycles. - Maria Paola Bianchi; Hans-Joachim Böckenhauer; Juraj Hromkovic; Sacha Krug; Björn Steffen (Theor. Comput. Sci., 2014)

On the Size of Two-Way Reasonable Automata for the Liveness Problem. - Maria Paola Bianchi; Juraj Hromkovic; Ivan Kovác (DLT, 2015)

Homo Informaticus. - Juraj Hromkovic (Bull. EATCS, 2015)

Why the Concept of Computational Complexity is Hard for Verifiable Mathematics. - Juraj Hromkovic (Electron. Colloquium Comput. Complex., 2015)

Corrigendum to "On the approximability and hardness of minimum topic connected overlay and its special instances" [Theoret. Comput. Sci. 429(2012) 144-154]. - Jun Hosoda; Juraj Hromkovic; Taisuke Izumi; Hirotaka Ono 001; Monika Steinová; Koichi Wada 001 (Theor. Comput. Sci., 2015)

Combining the Power of Python with the Simplicity of Logo for a Sustainable Computer Science Education. - Juraj Hromkovic; Tobias Kohn; Dennis Komm; Giovanni Serafini (ISSEP, 2016)

Advice Complexity of the Online Search Problem. - Jhoirene B. Clemente; Juraj Hromkovic; Dennis Komm; Christian Kudahl (IWOCA, 2016)

On the Power of Laconic Advice in Communication Complexity. - Kfir Barhum; Juraj Hromkovic (SOFSEM, 2016)

Online Graph Coloring with Advice and Randomized Adversary - (Extended Abstract). - Elisabet Burjons; Juraj Hromkovic; Xavier Muñoz; Walter Unger (SOFSEM, 2016)

The Complexity of Paging Against a Probabilistic Adversary. - Stefan Dobrev; Juraj Hromkovic; Dennis Komm; Richard Královic; Rastislav Královic; Tobias Mömke (SOFSEM, 2016)

What One Has to Know When Attacking P vs. NP (Extended Abstract). - Juraj Hromkovic; Peter Rossmanith (FCT, 2017)

The Computer Science Way of Thinking in Human History and Consequences for the Design of Computer Science Curricula. - Juraj Hromkovic; Regula Lacher (ISSEP, 2017)

XLogoOnline: A Single-Page, Browser-Based Programming Environment for Schools Aiming at Reducing Cognitive Load on Pupils. - Juraj Hromkovic; Giovanni Serafini; Jacqueline Staub (ISSEP, 2017)

Algorithmic Thinking from the Start. - Juraj Hromkovic; Tobias Kohn; Dennis Komm; Giovanni Serafini (Bull. EATCS, 2017)

How to convince teachers to teach computer science even if informatics was never a part of their own studies. - Juraj Hromkovic; Regula Lacher (Bull. EATCS, 2017)

Reoptimization of Hard Optimization Problems. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Dennis Komm (Handbook of Approximation Algorithms and Metaheuristics (1), 2018)

Stability of Approximation. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Sebastian Seibert (Handbook of Approximation Algorithms and Metaheuristics (1), 2018)

Online Graph Coloring Against a Randomized Adversary. - Elisabet Burjons; Juraj Hromkovic; Rastislav Královic; Richard Královic; Xavier Muñoz; Walter Unger (Int. J. Found. Comput. Sci., 2018)

Bilden wir die Erfinderinnen, Gestalter und Entwicklerinnen digitaler Technologie aus und nicht nur ihre Konsumenten! - Juraj Hromkovic (Inform. Spektrum, 2019)

Informatik im Kontext der allgemeinen Bildung. - Juraj Hromkovic (Inform. Spektrum, 2019)

E-Learning - Erwartungen, Möglichkeiten und Grenzen. - Juraj Hromkovic; Regula Lacher (Wirtschaftsinformatik Manag., 2019)

A Two-Dimensional Classification Model for the Bebras Tasks on Informatics Based Simultaneously on Subfields and Competencies. - Valentina Dagiene; Juraj Hromkovic; Regula Lacher (ISSEP, 2020)

Roots and Powers in Regular Languages: Recognizing Nonregular Properties by Finite Automata. - Fabian Frei; Juraj Hromkovic; Juhani Karhumäki (Fundam. Informaticae, 2020)

What one has to know when attacking P vs. NP. - Juraj Hromkovic; Peter Rossmanith (J. Comput. Syst. Sci., 2020)

Teaching with LOGO Philosophy. - Juraj Hromkovic; Dennis Komm; Regula Lacher; Jacqueline Staub (Encyclopedia of Education and Information Technologies, 2020)

Two-Way Non-uniform Finite Automata. - Fabian Frei; Juraj Hromkovic; Richard Královic; Rastislav Královic (DLT, 2021)

Online Simple Knapsack with Reservation Costs. - Hans-Joachim Böckenhauer; Elisabet Burjons; Juraj Hromkovic; Henri Lotze; Peter Rossmanith (STACS, 2021)

The Problem with Debugging in Current Block-based Programming Environments. - Juraj Hromkovic; Jacqueline Staub (Bull. EATCS, 2021)

Kolmogorov complexity and nondeterminism versus determinism for polynomial time computations. - Juraj Hromkovic (Electron. Colloquium Comput. Complex., 2021)

Designing informatics curriculum for K-12 education: From Concepts to Implementations. - Valentina Dagiene; Juraj Hromkovic; Regula Lacher (Informatics Educ., 2021)

On the advice complexity of the online dominating set problem. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Sacha Krug; Walter Unger (Theor. Comput. Sci., 2021)

Salomaa Prize in Automata Theory, Formal Languages and related topics. - Juraj Hromkovic (Bull. EATCS, 2022)

How Teaching Informatics Can Contribute to Improving Education in General. - Juraj Hromkovic; Regula Lacher (Bull. EATCS, 2023)

Potenzial, das ganze Bildungssystem zu verbessern. - Juraj Hromkovic (Wirksamer Informatikunterricht, 2024)

Teaching Tangible Division Algorithms or Going from Concrete to Abstractions in Math Education by the Genetic Socratic Method. - Juraj Hromkovic; Regula Lacher (CMSC, 2024)

Teaching Design of Algorithms in High Schools by Constructive Induction. - Juraj Hromkovic; Regula Lacher (Bull. EATCS, 2024)

Preface - Designing or Choosing Languages for Teaching Programming. - Juraj Hromkovic; Dennis Komm (Informatics Educ., 2024)

Online Unbounded Knapsack. - Hans-Joachim Böckenhauer; Matthias Gehnen; Juraj Hromkovic; Ralf Klasing; Dennis Komm; Henri Lotze; Daniel Mock; Peter Rossmanith; Moritz Stocker (Theory Comput. Syst., 2025)

A survey of online knapsack problems. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Dennis Komm; Peter Rossmanith; Moritz Stocker (Discret. Appl. Math., 2026)