| 2021 | DLT | Two-Way Non-uniform Finite Automata. | Fabian Frei, Juraj Hromkovic, Richard Krlovic, Rastislav Krlovic |
| 2021 | STACS | Online Simple Knapsack with Reservation Costs. | Hans-Joachim Bckenhauer, Elisabet Burjons, Juraj Hromkovic, Henri Lotze, Peter Rossmanith |
| 2017 | FCT | What One Has to Know When Attacking P vs. NP (Extended Abstract). | Juraj Hromkovic, Peter Rossmanith |
| 2016 | IWOCA | Advice Complexity of the Online Search Problem. | Jhoirene B. Clemente, Juraj Hromkovic, Dennis Komm, Christian Kudahl |
| 2016 | SOFSEM | On the Power of Laconic Advice in Communication Complexity. | Kfir Barhum, Juraj Hromkovic |
| 2016 | SOFSEM | Online Graph Coloring with Advice and Randomized Adversary - (Extended Abstract). | Elisabet Burjons, Juraj Hromkovic, Xavier Muoz, Walter Unger |
| 2016 | SOFSEM | The Complexity of Paging Against a Probabilistic Adversary. | Stefan Dobrev, Juraj Hromkovic, Dennis Komm, Richard Krlovic, Rastislav Krlovic, Tobias Mmke |
| 2015 | DLT | On the Size of Two-Way Reasonable Automata for the Liveness Problem. | Maria Paola Bianchi, Juraj Hromkovic, Ivan Kovc |
| 2014 | SOFSEM | On the Power of Advice and Randomization for the Disjoint Path Allocation Problem. | Kfir Barhum, Hans-Joachim Bckenhauer, Michal Forisek, Heidi Gebauer, Juraj Hromkovic, Sacha Krug, Jasmin Smula, Bjrn Steffen |
| 2013 | COCOON | On the Advice Complexity of the Online | Maria Paola Bianchi, Hans-Joachim Bckenhauer, Juraj Hromkovic, Sacha Krug, Bjrn Steffen |
| 2013 | COCOON | The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity. | Hans-Joachim Bckenhauer, Juraj Hromkovic, Dennis Komm, Sacha Krug, Jasmin Smula, Andreas Sprock |
| 2012 | COCOON | Online Coloring of Bipartite Graphs with and without Advice. | Maria Paola Bianchi, Hans-Joachim Bckenhauer, Juraj Hromkovic, Lucia Keller |
| 2012 | DLT | Determinism vs. Nondeterminism for Two-Way Automata - Representing the Meaning of States by Logical Formul. | Juraj Hromkovic, Rastislav Krlovic, Richard Krlovic, Richard Stefanec |
| 2011 | MFCS | On the Approximability of Minimum Topic Connected Overlay and Its Special Instances. | Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinov, Koichi Wada |
| 2010 | CIAC | The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality. | Hans-Joachim Bckenhauer, Karin Freiermuth, Juraj Hromkovic, Tobias Mmke, Andreas Sprock, Bjrn Steffen |
| 2010 | CSR | Algorithmics - Is There Hope for a Unified Theory? | Juraj Hromkovic |
| 2010 | MFCS | Information Complexity of Online Problems. | Juraj Hromkovic, Rastislav Krlovic, Richard Krlovic |
| 2009 | STACS | Ambiguity and Communication. | Juraj Hromkovic, Georg Schnitger |
| 2008 | DLT | On the Hardness of Determining Small NFA's and of Proving Lower Bounds on Their Sizes. | Juraj Hromkovic, Georg Schnitger |
| 2008 | SOFSEM | On the Hardness of Reoptimization. | Hans-Joachim Bckenhauer, Juraj Hromkovic, Tobias Mmke, Peter Widmayer |
| 2007 | FUN | Efficient Algorithms for the Spoonerism Problem. | Hans-Joachim Bckenhauer, Juraj Hromkovic, Richard Krlovic, Tobias Mmke, Kathleen Steinhfel |
| 2005 | ICALP | NFAs With and Without | Juraj Hromkovic, Georg Schnitger |
| 2005 | SOFSEM | On the Stability of Approximation for Hamiltonian Path Problems. | Luca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert |
| 2003 | CIAC | On k-Edge-Connectivity Problems with Sharpened Triangle Inequality. | Hans-Joachim Bckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger |
| 2003 | ICALP | Pushdown Automata and Multicounter Machines, a Comparison of Computation Modes. | Juraj Hromkovic, Georg Schnitger |
| 2003 | ICALP | Nondeterminism versus Determinism for Two-Way Finite Automata: Generalizations of Sipser's Separation. | Juraj Hromkovic, Georg Schnitger |
| 2001 | DLT | On the Power of Randomized Pushdown Automata. | Juraj Hromkovic, Georg Schnitger |
| 2001 | STACS | On Multipartition Communication Complexity. | Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger |
| 2000 | CIAC | Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem. | Hans-Joachim Bckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger |
| 2000 | ICALP | Measures of Nondeterminism in Finite Automata. | Juraj Hromkovic, Juhani Karhumki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert |
| 2000 | ICALP | Introduction: Workshop on Boolean Functions and Applications. | Juraj Hromkovic, Ingo Wegener |
| 2000 | STACS | An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality. | Hans-Joachim Bckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger |
| 2000 | STACS | Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs. | Juraj Hromkovic, Martin Sauerhoff |
| 1999 | ICALP | On the Power of Las Vegas II. Two-Way Finite Automata. | Juraj Hromkovic, Georg Schnitger |
| 1999 | SOFSEM | Stability of Approximation Algorithms for Hard Optimization Problems. | Juraj Hromkovic |
| 1998 | MFCS | Communication Complexity and Lower Bounds on Multilective Computations. | Juraj Hromkovic |
| 1997 | MFCS | Communication Complexity and Sequential Compuation. | Juraj Hromkovic, Georg Schnitger |
| 1997 | STACS | 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 |
| 1997 | STACS | Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata. | Juraj Hromkovic, Sebastian Seibert, Thomas Wilke |
| 1996 | STOC | Nondeterministic Communication with a Limited Number of Advice Bits. | Juraj Hromkovic, Georg Schnitger |
| 1995 | DLT | On the Communication Complexity of Distributive Language Generation. | Juraj Hromkovic |
| 1995 | FCT | Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids (Extended Abstract). | Juraj Hromkovic, Ralf Klasing, Dana Pardubsk, Walter Unger, Juraj Waczulk, Hubert Wagener |
| 1995 | STACS | 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 |
| 1994 | MFCS | A Comparison of Two Lower Bound Methods for Communication Complexity. | Martin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger |
| 1994 | MFCS | Two Lower Bounds on Distributive Generation of Languages. | Juraj Hromkovic, Jarkko Kari, Lila Kari, Dana Pardubsk |
| 1993 | DLT | Deterministic Versus Nondeterministic Space in Terms of Synchronized Alternating Machines. | Juraj Hromkovic, Branislav Rovan, Anna Slobodov |
| 1993 | ESA | Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs. | Juraj Hromkovic, Ralf Klasing, Elena Sthr, Hubert Wagener |
| 1993 | MFCS | Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems. | Juraj Hromkovic, Jarkko Kari, Lila Kari |
| 1993 | WG | Gossiping in Vertex-Disjoint Path Mode in Interconnection Networks. | Juraj Hromkovic, Ralf Klasing, Elena Sthr |
| 1992 | STACS | A Nonlinear Lower Bound on the Practical Combinational Complexity. | Xaver Gubs, Juraj Hromkovic, Juraj Waczulk |
| 1992 | WG | Topology of Parallel Networks and Computational Complexity (Extended Abstract). | Juraj Hromkovic |
| 1991 | FCT | Nonlinear Lower Bounds on the Number of Processors of Circuits with Sublinear Separators (Extended Abstract). | Juraj Hromkovic |
| 1991 | MFCS | The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems). | Juraj Hromkovic, Burkhard Monien |
| 1990 | MFCS | Optimal Algorithms for Dissemination of Information in Some Interconnection Networks (Extended Abstract). | Juraj Hromkovic, Claus-Dieter Jeschke, Burkhard Monien |
| 1989 | MFCS | On the Power of Synchronization in Parallel Computations. | Jrgen Dassow, Juraj Hromkovic, Juhani Karhumki, Branislav Rovan, Anna Slobodov |
| 1988 | MFCS | Branching Programs as a Tool for Proving Lower Bounds on VLSI Computations and Optimal Algorithms for Systolic Arrays. | Juraj Hromkovic, Juraj Prochzka |
| 1987 | STACS | Reversal Complexity of Multicounter and Multihead Machines. | Juraj Hromkovic |
| 1986 | ICALP | Tradeoffs for Language Recognition on Parallel Computing Models. | Juraj Hromkovic |
| 1986 | MFCS | A New Approach to Defining the Complexity for VLSI. | Juraj Hromkovic |
| 1984 | ICALP | Communication Complexity. | Juraj Hromkovic |
| 1984 | MFCS | Hierarchy of Reversal and Zerotesting Bounded Multicounter Machines. | Juraj Hromkovic |
| 1984 | MFCS | On the Power of Alternation in Finite Automata. | Juraj Hromkovic |
| 1982 | ICALP | Multihead Finite State Automata and Concatenation. | Pavol Duris, Juraj Hromkovic |
| 1981 | MFCS | Closure Properties of the Family of Languages Recognized by One-Way Two-Head Deterministic Finite State Automata. | Juraj Hromkovic |