Juraj Hromkovic

246 papers A* 9A 12B 30C 11Misc 5Journal 121Unranked 31
YearRankTypeTitle / Venue / Authors
2026 J jnl
A survey of online knapsack problems.
Discret. Appl. Math.
Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Peter Rossmanith, Moritz Stocker
2025 J jnl
Online Unbounded Knapsack.
Theory Comput. Syst.
Hans-Joachim Böckenhauer, Matthias Gehnen, Juraj Hromkovic, Ralf Klasing, Dennis Komm, Henri Lotze, Daniel Mock, Peter Rossmanith, Moritz Stocker
2024 J jnl
Kolmogorov complexity and nondeterminism versus determinism for polynomial time computations.
Theor. Comput. Sci.
Juraj Hromkovic
2024 J jnl
Online Unbounded Knapsack.
CoRR
Hans-Joachim Böckenhauer, Matthias Gehnen, Juraj Hromkovic, Ralf Klasing, Dennis Komm, Henri Lotze, Daniel Mock, Peter Rossmanith, Moritz Stocker
2024 — ch.
Potenzial, das ganze Bildungssystem zu verbessern.
Wirksamer Informatikunterricht
Juraj Hromkovic
2024 J jnl
Preface - Designing or Choosing Languages for Teaching Programming.
Informatics Educ.
Juraj Hromkovic, Dennis Komm
2024 J jnl
Teaching Design of Algorithms in High Schools by Constructive Induction.
Bull. EATCS
Juraj Hromkovic, Regula Lacher
2024 — conf
Teaching Tangible Division Algorithms or Going from Concrete to Abstractions in Math Education by the Genetic Socratic Method.
CMSC
Juraj Hromkovic, Regula Lacher
2023 J jnl
How Teaching Informatics Can Contribute to Improving Education in General.
Bull. EATCS
Juraj Hromkovic, Regula Lacher
2023 J jnl
Two-Way Non-Uniform Finite Automata.
Int. J. Found. Comput. Sci.
Fabian Frei, Juraj Hromkovic, Rastislav Královic, Richard Královic
2022 J jnl
Salomaa Prize in Automata Theory, Formal Languages and related topics.
Bull. EATCS
Juraj Hromkovic
2021 J jnl
Designing informatics curriculum for K-12 education: From Concepts to Implementations.
Informatics Educ.
Valentina Dagiene, Juraj Hromkovic, Regula Lacher
2021 J jnl
Kolmogorov complexity and nondeterminism versus determinism for polynomial time computations.
Electron. Colloquium Comput. Complex.
Juraj Hromkovic
2021 J jnl
On the advice complexity of the online dominating set problem.
Theor. Comput. Sci.
Hans-Joachim Böckenhauer, Juraj Hromkovic, Sacha Krug, Walter Unger
2021 A conf
Online Simple Knapsack with Reservation Costs.
STACS
Hans-Joachim Böckenhauer, Elisabet Burjons, Juraj Hromkovic, Henri Lotze, Peter Rossmanith
2021 J jnl
The Problem with Debugging in Current Block-based Programming Environments.
Bull. EATCS
Juraj Hromkovic, Jacqueline Staub
2021 C conf
Two-Way Non-uniform Finite Automata.
DLT
Fabian Frei, Juraj Hromkovic, Richard Královic, Rastislav Královic
2020 — conf
A Two-Dimensional Classification Model for the Bebras Tasks on Informatics Based Simultaneously on Subfields and Competencies.
ISSEP
Valentina Dagiene, Juraj Hromkovic, Regula Lacher
2020 J jnl
Online Simple Knapsack with Reservation Costs.
CoRR
Hans-Joachim Böckenhauer, Elisabet Burjons, Juraj Hromkovic, Henri Lotze, Peter Rossmanith
2020 J jnl
Roots and Powers in Regular Languages: Recognizing Nonregular Properties by Finite Automata.
Fundam. Informaticae
Fabian Frei, Juraj Hromkovic, Juhani Karhumäki
2020 — ch.
Teaching with LOGO Philosophy.
Encyclopedia of Education and Information Technologies
Juraj Hromkovic, Dennis Komm, Regula Lacher, Jacqueline Staub
2020 J jnl
What one has to know when attacking P vs. NP.
J. Comput. Syst. Sci.
Juraj Hromkovic, Peter Rossmanith
2019 J jnl
Bilden wir die Erfinderinnen, Gestalter und Entwicklerinnen digitaler Technologie aus und nicht nur ihre Konsumenten!
Inform. Spektrum
Juraj Hromkovic
2019 J jnl
E-Learning - Erwartungen, Möglichkeiten und Grenzen.
Wirtschaftsinformatik Manag.
Juraj Hromkovic, Regula Lacher
2019 J jnl
Informatik im Kontext der allgemeinen Bildung.
Inform. Spektrum
Juraj Hromkovic
2018 J jnl
On the Size of Two-Way Reasonable Automata for the Liveness Problem.
Int. J. Found. Comput. Sci.
Maria Paola Bianchi, Juraj Hromkovic, Ivan Kovác
2018 J jnl
Online Graph Coloring Against a Randomized Adversary.
Int. J. Found. Comput. Sci.
Elisabet Burjons, Juraj Hromkovic, Rastislav Královic, Richard Královic, Xavier Muñoz, Walter Unger
2018 — ch.
Reoptimization of Hard Optimization Problems.
Handbook of Approximation Algorithms and Metaheuristics (1)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm
2018 — ch.
Stability of Approximation.
Handbook of Approximation Algorithms and Metaheuristics (1)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Sebastian Seibert
2017 J jnl
Algorithmic Thinking from the Start.
Bull. EATCS
Juraj Hromkovic, Tobias Kohn, Dennis Komm, Giovanni Serafini
2017 J jnl
How to convince teachers to teach computer science even if informatics was never a part of their own studies.
Bull. EATCS
Juraj Hromkovic, Regula Lacher
2017 — conf
The Computer Science Way of Thinking in Human History and Consequences for the Design of Computer Science Curricula.
ISSEP
Juraj Hromkovic, Regula Lacher
2017 B conf
What One Has to Know When Attacking P vs. NP (Extended Abstract).
FCT
Juraj Hromkovic, Peter Rossmanith
2017 — conf
XLogoOnline: A Single-Page, Browser-Based Programming Environment for Schools Aiming at Reducing Cognitive Load on Pupils.
ISSEP
Juraj Hromkovic, Giovanni Serafini, Jacqueline Staub
2016 C conf
Advice Complexity of the Online Search Problem.
IWOCA
Jhoirene B. Clemente, Juraj Hromkovic, Dennis Komm, Christian Kudahl
2016 J jnl
Advice Complexity of the Online Search Problem.
CoRR
Jhoirene B. Clemente, Juraj Hromkovic, Dennis Komm, Christian Kudahl
2016 — conf
Combining the Power of Python with the Simplicity of Logo for a Sustainable Computer Science Education.
ISSEP
Juraj Hromkovic, Tobias Kohn, Dennis Komm, Giovanni Serafini
2016 B conf
On the Power of Laconic Advice in Communication Complexity.
SOFSEM
Kfir Barhum, Juraj Hromkovic
2016 B conf
Online Graph Coloring with Advice and Randomized Adversary - (Extended Abstract).
SOFSEM
Elisabet Burjons, Juraj Hromkovic, Xavier Muñoz, Walter Unger
2016 B conf
The Complexity of Paging Against a Probabilistic Adversary.
SOFSEM
Stefan Dobrev, Juraj Hromkovic, Dennis Komm, Richard Královic, Rastislav Královic, Tobias Mömke
2015 J jnl
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.
Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada
2015 J jnl
Homo Informaticus.
Bull. EATCS
Juraj Hromkovic
2015 C conf
On the Size of Two-Way Reasonable Automata for the Liveness Problem.
DLT
Maria Paola Bianchi, Juraj Hromkovic, Ivan Kovác
2015 J jnl
Why the Concept of Computational Complexity is Hard for Verifiable Mathematics.
Electron. Colloquium Comput. Complex.
Juraj Hromkovic
2014 — conf
A Technique to Obtain Hardness Results for Randomized Online Algorithms - A Survey.
Computing with New Resources
Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm
2014 B conf
On the Power of Advice and Randomization for the Disjoint Path Allocation Problem.
SOFSEM
Kfir Barhum, Hans-Joachim Böckenhauer, Michal Forisek, Heidi Gebauer, Juraj Hromkovic, Sacha Krug, Jasmin Smula, Björn Steffen
2014 J jnl
On the advice complexity of the online L(2, 1)-coloring problem on paths and cycles.
Theor. Comput. Sci.
Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Sacha Krug, Björn Steffen
2014 J jnl
Online Coloring of Bipartite Graphs with and without Advice.
Algorithmica
Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Lucia Keller
2014 J jnl
The string guessing problem as a method to prove lower bounds on the advice complexity.
Theor. Comput. Sci.
Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Sacha Krug, Jasmin Smula, Andreas Sprock
2013 J jnl
Determinism vs. Nondeterminism for Two-Way Automata: Representing the Meaning of States by Logical Formulæ.
Int. J. Found. Comput. Sci.
Juraj Hromkovic, Rastislav Královic, Richard Královic, Richard Stefanec
2013 — ch.
Die Bildungsziele.
informatik@gymnasium
Juraj Hromkovic, Jürg Kohlas
2013 — ch.
Konzepte und Inhalte eines Fachs Informatik.
informatik@gymnasium
Juraj Hromkovic, Jürg Kohlas, Carl August Zehnder
2013 Misc conf
On the Advice Complexity of the Online
COCOON
Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Sacha Krug, Björn Steffen
2013 Misc conf
The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity.
COCOON
Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Sacha Krug, Jasmin Smula, Andreas Sprock
2013 — ch.
Was ist Informatik?
informatik@gymnasium
Juraj Hromkovic, Jürg Kohlas
2012 C conf
Determinism vs. Nondeterminism for Two-Way Automata - Representing the Meaning of States by Logical Formulæ.
Developments in Language Theory
Juraj Hromkovic, Rastislav Královic, Richard Královic, Richard Stefanec
2012 — book
Einführung in die Programmierung mit LOGO - Lehrbuch für Unterricht und Selbststudium (2. Aufl.).
Juraj Hromkovic
2012 — conf
On the Power of Randomness versus Advice in Online Computation.
Languages Alive
Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Richard Královic, Peter Rossmanith
2012 J jnl
On the approximability and hardness of minimum topic connected overlay and its special instances.
Theor. Comput. Sci.
Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada
2012 Misc conf
Online Coloring of Bipartite Graphs with and without Advice.
COCOON
Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Lucia Keller
2012 J jnl
Steiner tree reoptimization in graphs with sharpened triangle inequality.
J. Discrete Algorithms
Hans-Joachim Böckenhauer, Karin Freiermuth, Juraj Hromkovic, Tobias Mömke, Andreas Sprock, Björn Steffen
2012 J jnl
The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity.
Electron. Colloquium Comput. Complex.
Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Sacha Krug, Jasmin Smula, Andreas Sprock
2011 J jnl
Ambiguity and Communication.
Theory Comput. Syst.
Juraj Hromkovic, Georg Schnitger
2011 J jnl
Editorial.
J. Interconnect. Networks
D. Frank Hsu, Bruce M. Maggs, Howard C. T. Ho, Juraj Hromkovic, Francis C. M. Lau, Friedhelm Meyer auf der Heide
2011 J jnl
Fehlerkorrigierende Codes - Ein Unterrichtsbeispiel zum gelenkten entdeckenden Lernen.
LOG IN
Juraj Hromkovic, Lucia Keller, Dennis Komm, Giovanni Serafini, Björn Steffen
2011 — conf
Improved Approximations for Hard Optimization Problems via Problem Instance Classification.
Rainbow of Computer Science
Hans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke
2011 — conf
Knowing All Optimal Solutions Does Not Help for TSP Reoptimization.
Computation, Cooperation, and Life
Hans-Joachim Böckenhauer, Juraj Hromkovic, Andreas Sprock
2011 J jnl
On the Approximability and Hardness of Minimum Topic Connected Overlay and Its Special Instances
CoRR
Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada
2011 B conf
On the Approximability of Minimum Topic Connected Overlay and Its Special Instances.
MFCS
Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada
2011 J jnl
On the Hardness of Reoptimization with Multiple Given Solutions.
Fundam. Informaticae
Hans-Joachim Böckenhauer, Juraj Hromkovic, Andreas Sprock
2011 B ed.
SOFSEM 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 22-28, 2011. Proceedings
SOFSEM
Ivana Cerná, Tibor Gyimóthy, Juraj Hromkovic, Keith G. Jeffery, Rastislav Královic, Marko Vukolic, Stefan Wolf
2011 — conf
Why Teaching Informatics in Schools Is as Important as Teaching Mathematics and Natural Sciences.
ISSEP
Juraj Hromkovic, Björn Steffen
2010 Misc conf
Algorithmics - Is There Hope for a Unified Theory?
CSR
Juraj Hromkovic
2010 B conf
Information Complexity of Online Problems.
MFCS
Juraj Hromkovic, Rastislav Královic, Richard Královic
2010 J jnl
On probabilistic pushdown automata.
Inf. Comput.
Juraj Hromkovic, Georg Schnitger
2010 J jnl
Preface.
Fundam. Informaticae
Juraj Hromkovic, Borislav Suster, Eduard Toman
2010 — ed.
Teaching Fundamentals Concepts of Informatics, 4th International Conference on Informatics in Secondary Schools - Evolution and Perspectives, ISSEP 2010, Zurich, Switzerland, January 13-15, 2010. Proceedings
ISSEP
Juraj Hromkovic, Richard Královic, Jan Vahrenhold
2010 C conf
The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality.
CIAC
Hans-Joachim Böckenhauer, Karin Freiermuth, Juraj Hromkovic, Tobias Mömke, Andreas Sprock, Björn Steffen
2009 — book
Algorithmic Adventures - From Knowledge to Magic.
Juraj Hromkovic
2009 J jnl
Ambiguity and Communication
CoRR
Juraj Hromkovic, Georg Schnitger
2009 A conf
Ambiguity and Communication.
STACS
Juraj Hromkovic, Georg Schnitger
2009 J jnl
Lower Bounds on the Size of Sweeping Automata.
J. Autom. Lang. Comb.
Juraj Hromkovic, Georg Schnitger
2009 J jnl
On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks.
SIAM J. Discret. Math.
Juraj Hromkovic, Przemyslawa Kanarek, Ralf Klasing, Krzysztof Lorys, Walter Unger, Hubert Wagener
2009 J jnl
On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's.
Theor. Comput. Sci.
Juraj Hromkovic, Holger Petersen, Georg Schnitger
2009 J jnl
Reoptimization of Steiner trees: Changing the terminal set.
Theor. Comput. Sci.
Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Rossmanith
2009 — book
Sieben Wunder der Informatik - Eine Reise an die Grenze des Machbaren mit Aufgaben und Lösungen (2. Aufl.).
Juraj Hromkovic
2008 — conf
Creating and Testing Textbooks for Secondary Schools.
ISSEP
Karin Freiermuth, Juraj Hromkovic, Björn Steffen
2008 — book
Lehrbuch Informatik - Vorkurs Programmieren, Geschichte und Begriffsbildung, Automatenentwurf.
Juraj Hromkovic
2008 J jnl
On k-connectivity problems with sharpened triangle inequality.
J. Discrete Algorithms
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
2008 C conf
On the Hardness of Determining Small NFA's and of Proving Lower Bounds on Their Sizes.
Developments in Language Theory
Juraj Hromkovic, Georg Schnitger
2008 B conf
On the Hardness of Reoptimization.
SOFSEM
Hans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke, Peter Widmayer
2008 — conf
Reoptimization of Steiner Trees.
SWAT
Davide Bilò, Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Widmayer, Anna Zych
2007 J jnl
Comparing the size of NFAs with and without epsilon-transitions.
Theor. Comput. Sci.
Juraj Hromkovic, Georg Schnitger
2007 Misc conf
Efficient Algorithms for the Spoonerism Problem.
FUN
Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Kathleen Steinhöfel
2007 J jnl
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms.
Algorithmic Oper. Res.
Juraj Hromkovic, Tobias Mömke, Kathleen Steinhöfel, Peter Widmayer
2007 J jnl
On the Approximability of TSP on Local Modifications of Optimally Solved Instances.
Algorithmic Oper. Res.
Hans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovic, Joachim Kneis, Joachim Kupke, Guido Proietti, Peter Widmayer
2007 — ch.
Stability of Approximation.
Handbook of Approximation Algorithms and Metaheuristics
Hans-Joachim Böckenhauer, Sebastian Seibert, Juraj Hromkovic
2007 — ed.
Stochastic Algorithms: Foundations and Applications, 4th International Symposium, SAGA 2007, Zurich, Switzerland, September 13-14, 2007, Proceedings
SAGA
Juraj Hromkovic, Richard Královic, Marc Nunkesser, Peter Widmayer
2007 J jnl
The Parameterized Approximability of TSP with Deadlines.
Theory Comput. Syst.
Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke
2007 — book
Theoretische Informatik - formale Sprachen, Berechenbarkeit, Komplexitätstheorie, Algorithmik, Kommunikation und Kryptographie, 3. Auflage.
Juraj Hromkovic
2006 — conf
Contributing to General Education by Teaching Informatics.
ISSEP
Juraj Hromkovic
2006 — conf
On the Approximation Hardness of Some Generalizations of TSP.
SWAT
Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke
2006 J jnl
On the Stability of Approximation for Hamiltonian Path Problems.
Algorithmic Oper. Res.
Luca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert
2006 — conf
Reusing Optimal TSP Solutions for Locally Modified Input Instances.
IFIP TCS
Hans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovic, Joachim Kneis, Joachim Kupke, Guido Proietti, Peter Widmayer
2006 — book
Sieben Wunder der Informatik - eine Reise an die Grenze des Machbaren mit Aufgaben und Lösungen.
Juraj Hromkovic
2005 — conf
Communication Complexity Method for Proving Lower Bounds on Descriptional Complexity in Automata and Formal Language Theory.
DCFS
Juraj Hromkovic, Georg Schnitger
2005 — book
Design and Analysis of Randomized Algorithms - Introduction to Design Paradigms
Juraj Hromkovic
2005 — book
Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance
Juraj Hromkovic, Ralf Klasing, Andrzej Pelc, Peter Ruzicka, Walter Unger
2005 A* conf
NFAs With and Without
ICALP
Juraj Hromkovic, Georg Schnitger
2005 B conf
On the Stability of Approximation for Hamiltonian Path Problems.
SOFSEM
Luca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert
2005 J jnl
On the power of randomized multicounter machines.
Theor. Comput. Sci.
Juraj Hromkovic, Georg Schnitger
2004 — book
Algorithmics for Hard Problems - Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics, Second Edition
Juraj Hromkovic
2004 B ed.
Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers
WG
Juraj Hromkovic, Manfred Nagl, Bernhard Westfechtel
2004 J jnl
On multi-partition communication complexity.
Inf. Comput.
Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger
2004 J jnl
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality.
Theor. Comput. Sci.
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
2004 J jnl
On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata.
J. Comput. Syst. Sci.
Pavol Duris, Juraj Hromkovic, Katsushi Inoue
2004 — conf
Stability of Approximation in Discrete Optimization.
IFIP TCS
Juraj Hromkovic
2003 A* conf
Nondeterminism versus Determinism for Two-Way Finite Automata: Generalizations of Sipser's Separation.
ICALP
Juraj Hromkovic, Georg Schnitger
2003 J jnl
Nondeterministic Communication with a Limited Number of Advice Bits.
SIAM J. Comput.
Juraj Hromkovic, Georg Schnitger
2003 C conf
On k-Edge-Connectivity Problems with Sharpened Triangle Inequality.
CIAC
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
2003 A* conf
Pushdown Automata and Multicounter Machines, a Comparison of Computation Modes.
ICALP
Juraj Hromkovic, Georg Schnitger
2003 J jnl
The Power of Nondeterminism and Randomness for Oblivious Branching Programs.
Theory Comput. Syst.
Juraj Hromkovic, Martin Sauerhoff
2002 J jnl
Communication Complexity Method for Measuring Nondeterminism in Finite Automata.
Inf. Comput.
Juraj Hromkovic, Sebastian Seibert, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger
2002 J jnl
Descriptional Complexity of Finite Automata: Concepts and Open Problems.
J. Autom. Lang. Comb.
Juraj Hromkovic
2002 — conf
On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality.
FSTTCS
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
2002 J jnl
Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem.
Theor. Comput. Sci.
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
2001 — book
Algorithmics for Hard Problems - Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics
Juraj Hromkovic
2001 — book
Algorithmics for hard problems - introduction to combinatorial optimization, randomization, approximation, and heuristics.
Juraj Hromkovic
2001 — book
Algorithmischen Konzepte der Informatik - Berechenbarkeit, Komplexitätstheorie, Algorithmik, Kryptographie
Juraj Hromkovic
2001 — conf
Descriptional Complexity of Regular Languages (Concepts and Open Problems).
DCFS
Juraj Hromkovic
2001 J jnl
Foreword.
Theor. Comput. Sci.
Rusins Freivalds, Juraj Hromkovic, Gheorghe Paun, Walter Unger
2001 — conf
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms.
ICTCS
Juraj Hromkovic, Kathleen Steinhöfel, Peter Widmayer
2001 J jnl
On Multipartition Communication Complexity
Electron. Colloquium Comput. Complex.
Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger
2001 A conf
On Multipartition Communication Complexity.
STACS
Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger
2001 J jnl
On the Power of Las Vegas for One-Way Communication Complexity, OBDDs, and Finite Automata.
Inf. Comput.
Juraj Hromkovic, Georg Schnitger
2001 C conf
On the Power of Randomized Pushdown Automata.
Developments in Language Theory
Juraj Hromkovic, Georg Schnitger
2001 J jnl
On the power of Las Vegas II: Two-way finite automata.
Theor. Comput. Sci.
Juraj Hromkovic, Georg Schnitger
2001 J jnl
Preface.
Discret. Appl. Math.
Juraj Hromkovic, Ondrej Sýkora
2001 — conf
Randomized Communication Protocols (A Survey).
SAGA
Juraj Hromkovic
2001 J jnl
Translating Regular Expressions into Small -Free Nondeterministic Finite Automata.
J. Comput. Syst. Sci.
Juraj Hromkovic, Sebastian Seibert, Thomas Wilke
2001 J jnl
Zufall und zufallsgesteuerte Algorithmen.
LOG IN
Juraj Hromkovic
2000 J jnl
A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition
Electron. Colloquium Comput. Complex.
Pavol Duris, Juraj Hromkovic, Katsushi Inoue
2000 A conf
A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition.
CCC
Pavol Duris, Juraj Hromkovic, Katsushi Inoue
2000 A conf
An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality.
STACS
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
2000 J jnl
Approximation algorithms for the TSP with sharpened triangle inequality.
Inf. Process. Lett.
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
2000 — ed.
ICALP Workshops 2000, Proceedings of the Satelite Workshops of the 27th International Colloquium on Automata, Languages and Programming, Geneva, Switzerland, July 9-15, 2000
José D. P. Rolim, Andrei Z. Broder, Andrea Corradini, Roberto Gorrieri, Reiko Heckel, Juraj Hromkovic, Ugo Vaccaro, J. B. Wells
2000 — conf
Introduction: Workshop on Boolean Functions and Applications.
ICALP Satellite Workshops
Juraj Hromkovic, Ingo Wegener
2000 J jnl
Measures of Nondeterminism in Finite Automata
Electron. Colloquium Comput. Complex.
Juraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert
2000 A* conf
Measures of Nondeterminism in Finite Automata.
ICALP
Juraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert
2000 C conf
Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem.
CIAC
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
2000 A conf
Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs.
STACS
Juraj Hromkovic, Martin Sauerhoff
1999 J jnl
Communication complexity and lower bounds on multilective computations.
RAIRO Theor. Informatics Appl.
Juraj Hromkovic
1999 A* conf
On the Power of Las Vegas II. Two-Way Finite Automata.
ICALP
Juraj Hromkovic, Georg Schnitger
1999 J jnl
On the Power of Las Vegas II: Two-Way Finite Automata
Electron. Colloquium Comput. Complex.
Juraj Hromkovic, Georg Schnitger
1999 J jnl
Some Constributions of the Study of Abstract Communication Complexity to Other Areas of Computer Science.
ACM Comput. Surv.
Juraj Hromkovic
1999 — conf
Stability of Approximation Algorithms and the Knapsack Problem.
Jewels are Forever
Juraj Hromkovic
1999 B conf
Stability of Approximation Algorithms for Hard Optimization Problems.
SOFSEM
Juraj Hromkovic
1999 J jnl
Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem
Electron. Colloquium Comput. Complex.
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
1998 B conf
Communication Complexity and Lower Bounds on Multilective Computations.
MFCS
Juraj Hromkovic
1998 J jnl
Effective Systolic Algorithms for Gossiping in Cycles.
Parallel Process. Lett.
Juraj Hromkovic, Ralf Klasing, Dana Pardubská, Juraj Waczulík, Hubert Wagener
1998 B ed.
Graph-Theoretic Concepts in Computer Science, 24th International Workshop, WG '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings
WG
Juraj Hromkovic, Ondrej Sýkora
1997 — book
Communication Complexity and Parallel Computing.
Juraj Hromkovic
1997 B conf
Communication Complexity and Sequential Compuation.
MFCS
Juraj Hromkovic, Georg Schnitger
1997 — ch.
Complexity: A Language-Theoretic Point of View.
Handbook of Formal Languages (2)
Cristian Calude, Juraj Hromkovic
1997 A conf
Las Vegas Versus Determinism for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations.
STACS
Pavol Duris, Juraj Hromkovic, José D. P. Rolim, Georg Schnitger
1997 J jnl
On the Power of Las Vegas for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations
Electron. Colloquium Comput. Complex.
Pavol Duris, Juraj Hromkovic, José D. P. Rolim, Georg Schnitger
1997 J jnl
Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes.
Inf. Comput.
Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener
1997 A conf
Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata.
STACS
Juraj Hromkovic, Sebastian Seibert, Thomas Wilke
1997 — conf
Two Lower Bounds on Computational Complexity of Infinite Words.
New Trends in Formal Languages
Juraj Hromkovic, Juhani Karhumäki
1996 J jnl
A Comparison of Two Lower-Bound Methods for Communication Complexity.
Theor. Comput. Sci.
Martin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger
1996 J jnl
Dissemination of Information in Vertex-Disjoint Paths Mode.
Comput. Artif. Intell.
Juraj Hromkovic, Ralf Klasing, Elena Stöhr
1996 A* conf
Nondeterministic Communication with a Limited Number of Advice Bits.
STOC
Juraj Hromkovic, Georg Schnitger
1996 J jnl
Two Lower Bounds on Distributive Generation of Languages.
Fundam. Informaticae
Juraj Hromkovic, Jarkko Kari, Lila Kari, Dana Pardubská
1995 J jnl
A Nonlinear Lower Bound on the Practical Combinational Complexity.
Theor. Comput. Sci.
Xaver Gubás, Juraj Hromkovic, Juraj Waczulík
1995 B conf
Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids (Extended Abstract).
FCT
Juraj Hromkovic, Ralf Klasing, Dana Pardubská, Walter Unger, Juraj Waczulík, Hubert Wagener
1995 J jnl
Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs.
Inf. Comput.
Juraj Hromkovic, Ralf Klasing, Elena Stöhr, Hubert Wagener
1995 J jnl
On Embeddings in Cycles
Inf. Comput.
Juraj Hromkovic, Vladimír Müller, Ondrej Sýkora, Imrich Vrto
1995 C conf
On the Communication Complexity of Distributive Language Generation.
Developments in Language Theory
Juraj Hromkovic
1995 A conf
On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks.
STACS
Juraj Hromkovic, Krzysztof Lorys, Przemyslawa Kanarek, Ralf Klasing, Walter Unger, Hubert Wagener
1994 B conf
A Comparison of Two Lower Bound Methods for Communication Complexity.
MFCS
Martin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger
1994 — conf
Comparing Descriptional and Computational Complexity of Infinite Words.
Results and Trends in Theoretical Computer Science
Juraj Hromkovic, Juhani Karhumäki, Arto Lepistö
1994 J jnl
Deterministic versus Nondeterministic Space in Terms of Synchronized Alternating Machines.
Theor. Comput. Sci.
Juraj Hromkovic, Branislav Rovan, Anna Slobodová
1994 — ch.
Lower Bounds on Systolic Array Computations and the Optimality of Kung's Convolution Algorithm.
Mathematical Aspects of Natural and Formal Languages
Juraj Hromkovic, Juraj Procházka
1994 J jnl
Note on Optimal Gossiping in Some Weak-Connected Graphs.
Theor. Comput. Sci.
Juraj Hromkovic, Claus-Dieter Jeschke, Burkhard Monien
1994 — conf
Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract).
SWAT
Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener
1994 J jnl
Optimal algorithms for dissemination of information in generalized communication modes.
Discret. Appl. Math.
Rainer Feldmann, Juraj Hromkovic, Seshu Madhavapeddy, Burkhard Monien, Peter Mysliwietz
1994 J jnl
Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems.
Theor. Comput. Sci.
Juraj Hromkovic, Jarkko Kari, Lila Kari
1994 — conf
The Complexity of Systolic Dissemination of Information in Interconnection Networks.
Canada-France Conference on Parallel and Distributed Computing
Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener, Dana Pardubská
1994 J jnl
The Complexity of Systolic Dissemination of Information in Interconnection Networks.
RAIRO Theor. Informatics Appl.
Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener, Dana Pardubská
1994 — conf
Two Lower Bounds on Computational Complexity of Infinite Word Generation.
IFIP Congress (1)
Juraj Hromkovic, Juhani Karhumäki
1994 B conf
Two Lower Bounds on Distributive Generation of Languages.
MFCS
Juraj Hromkovic, Jarkko Kari, Lila Kari, Dana Pardubská
1993 J jnl
A Note on Realtime One-Way Synchronized Alternating One-Counter Automata.
Theor. Comput. Sci.
Juraj Hromkovic, Katsushi Inoue
1993 C conf
Deterministic Versus Nondeterministic Space in Terms of Synchronized Alternating Machines.
Developments in Language Theory
Juraj Hromkovic, Branislav Rovan, Anna Slobodová
1993 B conf
Gossiping in Vertex-Disjoint Path Mode in Interconnection Networks.
WG
Juraj Hromkovic, Ralf Klasing, Elena Stöhr
1993 A conf
Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs.
ESA
Juraj Hromkovic, Ralf Klasing, Elena Stöhr, Hubert Wagener
1993 J jnl
Optimal Algorithms for Dissemination of Information in Some Interconnection Networks.
Algorithmica
Juraj Hromkovic, Claus-Dieter Jeschke, Burkhard Monien
1993 B conf
Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems.
MFCS
Juraj Hromkovic, Jarkko Kari, Lila Kari
1992 A conf
A Nonlinear Lower Bound on the Practical Combinational Complexity.
STACS
Xaver Gubás, Juraj Hromkovic, Juraj Waczulík
1992 J jnl
Abstract symbol systems - an exercise of the bottom-up approach in artificial intelligence.
J. Exp. Theor. Artif. Intell.
Juraj Hromkovic, Jozef Kelemen, Juraj Waczulík
1992 J jnl
Branching Programs Provide Lower Bounds on the Areas of Multilective Deterministic and Nondeterministic VLSI-Circuits
Inf. Comput.
Juraj Hromkovic, Matthias Krause, Christoph Meinel, Stephan Waack
1992 J jnl
Lower Bounds on the Area Complexity of Boolean Circuits.
Theor. Comput. Sci.
Juraj Hromkovic, Sergej A. Lozkin, Andrej I. Rybko, Alexander A. Sapozhenko, Nadezda A. Skalikova
1992 — conf
On Embedding Interconnection Networks into Rings of Processors.
PARLE
Juraj Hromkovic, Vladimír Müller, Ondrej Sýkora, Imrich Vrto
1992 J jnl
On the Power of One-Way Synchronized Alternating Machines with Small Space.
Int. J. Found. Comput. Sci.
Juraj Hromkovic, Katsushi Inoue, Branislav Rovan, Anna Slobodová, Itsuo Takanami, Klaus W. Wagner
1992 — conf
Optimal Algorithms for Disemination of Information in Generalized Communication Modes.
PARLE
Rainer Feldmann, Juraj Hromkovic, Seshu Madhavapeddy, Burkhard Monien, Peter Mysliwietz
1992 — ch.
The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems).
Informatik
Juraj Hromkovic, Burkhard Monien
1992 B conf
Topology of Parallel Networks and Computational Complexity (Extended Abstract).
WG
Juraj Hromkovic
1991 J jnl
Branching programs provide lower bounds on the area of VLSI circuits.
Kybernetika
Juraj Hromkovic
1991 J jnl
Nonlinear Lower Bounds on the Number of Processors of Circuits with Sublinear Separators
Inf. Comput.
Juraj Hromkovic
1991 B conf
Nonlinear Lower Bounds on the Number of Processors of Circuits with Sublinear Separators (Extended Abstract).
FCT
Juraj Hromkovic
1991 J jnl
On Problems for Which no Oracle Can Help.
Math. Syst. Theory
Juraj Hromkovic
1991 J jnl
On the power of synchronization in parallel computations.
Discret. Appl. Math.
Juraj Hromkovic, Juhani Karhumäki, Branislav Rovan, Anna Slobodová
1991 J jnl
On the power of two-dimensional synchronized alternating finite automata.
Fundam. Informaticae
Juraj Hromkovic
1991 B conf
The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems).
MFCS
Juraj Hromkovic, Burkhard Monien
1991 J jnl
Variable Multihead Machines.
J. Inf. Process. Cybern.
Juraj Hromkovic, Ladislav Janiga, Václav Koubek
1990 B conf
Optimal Algorithms for Dissemination of Information in Some Interconnection Networks (Extended Abstract).
MFCS
Juraj Hromkovic, Claus-Dieter Jeschke, Burkhard Monien
1989 J jnl
A Leaf-Size Hierarchy of Two-Dimensional Alternating Turing Machines.
Theor. Comput. Sci.
Katsushi Inoue, Itsuo Takanami, Juraj Hromkovic
1989 J jnl
Lower Bounds for Language Recognition on Two-Dimensional Alternating Multihead Machines.
J. Comput. Syst. Sci.
Juraj Hromkovic, Katsushi Inoue, Itsuo Takanami
1989 B conf
On the Power of Synchronization in Parallel Computations.
MFCS
Jürgen Dassow, Juraj Hromkovic, Juhani Karhumäki, Branislav Rovan, Anna Slobodová
1989 J jnl
The knowledge on information content of problems provides much useful information to circuit designers.
Bull. EATCS
Juraj Hromkovic
1989 J jnl
Tradeoffs for Language Recognition on Alternating Machines.
Theor. Comput. Sci.
Juraj Hromkovic
1988 J jnl
A candidate for nonlinear lower bound on the combinatorial complexity.
Bull. EATCS
Juraj Hromkovic
1988 B conf
Branching Programs as a Tool for Proving Lower Bounds on VLSI Computations and Optimal Algorithms for Systolic Arrays.
MFCS
Juraj Hromkovic, Juraj Procházka
1988 J jnl
Graph Controlled Table Lindenmayer Systems.
J. Inf. Process. Cybern.
Juraj Hromkovic, Erika Kupková
1988 J jnl
The Advantages of a New Approach to Defining the Communication Complexity for VLSI.
Theor. Comput. Sci.
Juraj Hromkovic
1987 A conf
Reversal Complexity of Multicounter and Multihead Machines.
STACS
Juraj Hromkovic
1987 J jnl
Reversal-Bounded Nondeterministic Multicounter Machines and Complementation.
Theor. Comput. Sci.
Juraj Hromkovic
1987 J jnl
Zerotesting bounded one-way multicounter machines.
Kybernetika
Pavol Duris, Juraj Hromkovic
1986 B conf
A New Approach to Defining the Complexity for VLSI.
MFCS
Juraj Hromkovic
1986 J jnl
Communication Complexity Hierarchy.
Theor. Comput. Sci.
Juraj Hromkovic
1986 J jnl
Hierarchy of reversal bounded one-way multicounter machines.
Kybernetika
Juraj Hromkovic
1986 — conf
Lower bound techniques for VLSI algorithms.
IMYCS
Juraj Hromkovic
1986 A* conf
Tradeoffs for Language Recognition on Parallel Computing Models.
ICALP
Juraj Hromkovic
1985 J jnl
Alternating Multicounter Machines with Constant Number of Reversals.
Inf. Process. Lett.
Juraj Hromkovic
1985 J jnl
Fooling a Two-Way Nondeterministic Multihead Automaton with Reversal Number Restriction.
Acta Informatica
Juraj Hromkovic
1985 J jnl
Linear Lower Bounds on Unbounded Fan-In Boolean Circuits.
Inf. Process. Lett.
Juraj Hromkovic
1985 J jnl
On the Power of Alternation in Automata Theory.
J. Comput. Syst. Sci.
Juraj Hromkovic
1985 J jnl
On the number of monotonic functions from two-valued logic to k-valued logic.
Kybernetika
Juraj Hromkovic
1984 J jnl
A note on the "Comuunication Complexity" paper by Papadimitriou and Sipser.
Bull. EATCS
Juraj Hromkovic
1984 A* conf
Communication Complexity.
ICALP
Juraj Hromkovic
1984 B conf
Hierarchy of Reversal and Zerotesting Bounded Multicounter Machines.
MFCS
Juraj Hromkovic
1984 B conf
On the Power of Alternation in Finite Automata.
MFCS
Juraj Hromkovic
1984 J jnl
On the power of Yao-Rivest technique.
Bull. EATCS
Juraj Hromkovic
1983 J jnl
On-Way Multihead Deterministic Finite Automata.
Acta Informatica
Juraj Hromkovic
1983 J jnl
One-Way Simple Multihead Finite Automata are not Closed Under Concatenation.
Theor. Comput. Sci.
Pavol Duris, Juraj Hromkovic
1982 A* conf
Multihead Finite State Automata and Concatenation.
ICALP
Pavol Duris, Juraj Hromkovic
1981 B conf
Closure Properties of the Family of Languages Recognized by One-Way Two-Head Deterministic Finite State Automata.
MFCS
Juraj Hromkovic