J. Hromkovic

发表

Hierarchy of reversal bounded one-way multicounter machines

Juraj Hromkovic, J. Hromkovic, 1986, Kybernetika.

A robust PTAS for maximum independent sets in unit disk graphs

W. Kern, J. Hurink, B. Westfechtel, 2004 .

An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality

Juraj Hromkovic, Hans-Joachim Böckenhauer, Ralf Klasing, 2000, STACS.

The Education Column

J. Hromkovic, M. Steinová, Michal Anderle, 2018 .

Knowing all optimal solutions does not help for TSP reoptimization

Juraj Hromkovič, Hans-Joachim Böckenhauer, Andreas Sprock, 2011 .

Algorithmics for hard problems - introduction to combinatorial optimization, randomization, approximation, and heuristics

Juraj Hromkovic, J. Hromkovic, 2001 .

Series Complexity : A Language-- Theoretic Point of View

Cristian S. Calude, J. Hromkovic, 1995 .

The Steiner tree reoptimization problem with sharpened triangle inequality

J. Hromkovic, Hans-Joachim Böckenhauer, Tobias Mömke, 2010 .

Introduction: Workshop on Boolean Functions and Applications

Juraj Hromkovic, Ingo Wegener, I. Wegener, 2000, ICALP Satellite Workshops.

Teaching with LOGO Philosophy

Jacqueline Staub, J. Hromkovic, D. Komm, 2020, Encyclopedia of Education and Information Technologies.

Proceedings of the 4th International Conference on Informatics in Secondary Schools - Evolution and Perspectives: Teaching Fundamentals Concepts of Informatics

Jan Vahrenhold, Juraj Hromkovič, Richard Královič, 2009 .

Some complexity aspects of VLSI computations. Part 4. VLSI circuits with programs

Juraj Hromkovic, Dana Pardubská, J. Hromkovic, 1988 .

Kolmogorov complexity and nondeterminism versus determinism for polynomial time computations

Juraj Hromkovic, J. Hromkovic, 2021, Electron. Colloquium Comput. Complex..

On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks

Juraj Hromkovic, Przemyslawa Kanarek, Krzysztof Lorys, 1995, STACS.

Dissemination of Information in Interconnection Networks (Broadcasting & Gossiping)

Juraj Hromkovič, Ralf Klasing, Burkhard Monien, 1996 .

On Synchronized Lindenmayer Picture Languages

Juraj Hromkovic, Jürgen Dassow, J. Dassow, 1992 .

Efficient Algorithms for the Spoonerism Problem

Juraj Hromkovic, Hans-Joachim Böckenhauer, Kathleen Steinhöfel, 2007, FUN.

Editorial

Francis C. M. Lau, Bruce M. Maggs, D. Frank Hsu, 2011, J. Nonlinear Sci..

On k-Edge-Connectivity Problems with Sharpened Triangle Inequality

Guido Proietti, Juraj Hromkovic, Hans-Joachim Böckenhauer, 2003, CIAC.

Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem

Juraj Hromkovic, Hans-Joachim Böckenhauer, Ralf Klasing, 2000, CIAC.

On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks

Juraj Hromkovic, Przemyslawa Kanarek, Krzysztof Lorys, 2009, SIAM J. Discret. Math..

Algorithmic Thinking from the Start

Dennis Komm, Juraj Hromkovic, Tobias Kohn, 2017, Bull. EATCS.

Combining the Power of Python with the Simplicity of Logo for a Sustainable Computer Science Education

Dennis Komm, Juraj Hromkovic, Tobias Kohn, 2016, ISSEP.

Homo Informaticus

Juraj Hromkovic, J. Hromkovic, 2015, Bull. EATCS.

Advice Complexity of the Online Search Problem pdf

Dennis Komm, Juraj Hromkovic, Christian Kudahl, 2016, IWOCA.

Online Graph Coloring with Advice and Randomized Adversary - (Extended Abstract)

Elisabet Burjons, Juraj Hromkovic, Walter Unger, 2016, SOFSEM.

On the Power of Advice and Randomization for the Disjoint Path Allocation Problem

Michal Forisek, Juraj Hromkovic, Hans-Joachim Böckenhauer, 2014, SOFSEM.

A Technique to Obtain Hardness Results for Randomized Online Algorithms - A Survey

Dennis Komm, Juraj Hromkovic, Hans-Joachim Böckenhauer, 2014, Computing with New Resources.

On the advice complexity of the online L(2, 1)-coloring problem on paths and cycles

Juraj Hromkovic, Maria Paola Bianchi, Hans-Joachim Böckenhauer, 2013, Theor. Comput. Sci..

Online Coloring of Bipartite Graphs with and without Advice

Lucia Keller, Juraj Hromkovic, Maria Paola Bianchi, 2012, Algorithmica.

The string guessing problem as a method to prove lower bounds on the advice complexity

Dennis Komm, Juraj Hromkovic, Hans-Joachim Böckenhauer, 2013, Theor. Comput. Sci..

Information Complexity of Online Problems

Juraj Hromkovic, Richard Královic, Rastislav Kralovic, 2010, MFCS.

Improved Approximations for Hard Optimization Problems via Problem Instance Classification

Juraj Hromkovič, Hans-Joachim Böckenhauer, Tobias Mömke, 2011, Rainbow of Computer Science.

On the Hardness of Reoptimization with Multiple Given Solutions

Juraj Hromkovic, Hans-Joachim Böckenhauer, Andreas Sprock, 2011, Fundam. Informaticae.

On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality

Guido Proietti, Juraj Hromkovic, Hans-Joachim Böckenhauer, 2002, Theor. Comput. Sci..

Complexity: A Language-Theoretic Point of View

Cristian S. Calude, Juraj Hromkovic, J. Hromkovic, 1997, Handbook of Formal Languages.

Pushdown Automata and Multicounter Machines, a Comparison of Computation Modes

Juraj Hromkovic, Georg Schnitger, G. Schnitger, 2003, ICALP.

Randomized Communication Protocols (A Survey)

Juraj Hromkovic, J. Hromkovic, 2001, SAGA.

On the Power of Randomized Pushdown Automata

Juraj Hromkovic, Georg Schnitger, G. Schnitger, 2001, Developments in Language Theory.

On Multipartition Communication Complexity

Juraj Hromkovic, Georg Schnitger, Martin Sauerhoff, 2001, STACS.

Measures of Nondeterminism in Finite Automata

Hartmut Klauck, Juraj Hromkovic, Georg Schnitger, 2000, ICALP.

Some contributions of the study of abstract communication complexity to other areas of computer science

Juraj Hromkovic, J. Hromkovic, 1999, CSUR.

On the power of Las Vegas II: Two-way finite automata

Juraj Hromkovic, Georg Schnitger, G. Schnitger, 1999, Theor. Comput. Sci..

Communication complexity and lower bounds on multilective computations

Juraj Hromkovic, J. Hromkovic, 1998, RAIRO Theor. Informatics Appl..

Communication Complexity and Sequential Compuation

Juraj Hromkovic, Georg Schnitger, G. Schnitger, 1997, MFCS.

On the approximability and hardness of minimum topic connected overlay and its special instances

Monika Steinová, Koichi Wada, Juraj Hromkovic, 2011, Theor. Comput. Sci..

Algorithmics for Hard Problems

Juraj Hromkovic, J. Hromkovic, 2002, Texts in Theoretical Computer Science An EATCS Series.

Communication Complexity Method for Measuring Nondeterminism in Finite Automata

Hartmut Klauck, Juraj Hromkovic, Georg Schnitger, 2002, Inf. Comput..

Branching Programs as a Tool for Proving Lower Bounds on VLSI Computations and Optimal Algorithms for Systolic Arrays

Juraj Hromkovic, Juraj Procházka, J. Hromkovic, 1988, MFCS.

Online Graph Coloring Against a Randomized Adversary

Elisabet Burjons, Juraj Hromkovic, Richard Královic, 2018, Int. J. Found. Comput. Sci..

Reoptimization of Steiner trees: Changing the terminal set

Juraj Hromkovic, Hans-Joachim Böckenhauer, Tobias Mömke, 2009, Theor. Comput. Sci..

Algorithmics for Hard Problems

Juraj Hromkovic, J. Hromkovic, 2004, Texts in Theoretical Computer Science. An EATCS Series.

Creating and Testing Textbooks for Secondary Schools

Juraj Hromkovic, Björn Steffen, Karin Freiermuth, 2008, ISSEP.

Contributing to General Education by Teaching Informatics

Juraj Hromkovic, J. Hromkovic, 2006, ISSEP.

Nondeterminism versus Determinism for Two-Way Finite Automata: Generalizations of Sipser's Separation

Juraj Hromkovic, Georg Schnitger, G. Schnitger, 2003, ICALP.

Descriptional Complexity of Finite Automata: Concepts and Open Problems

Juraj Hromkovic, J. Hromkovic, 2002, J. Autom. Lang. Comb..

Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance

Andrzej Pelc, Juraj Hromkovic, Ralf Klasing, 2005, Texts in Theoretical Computer Science. An EATCS Series.

The Parameterized Approximability of TSP with Deadlines

Juraj Hromkovic, Hans-Joachim Böckenhauer, Joachim Kneis, 2007, Theory of Computing Systems.

Communication Complexity and Parallel Computing

Juraj Hromkovic, J. Hromkovic, 1997, Texts in Theoretical Computer Science An EATCS Series.

Why Teaching Informatics in Schools Is as Important as Teaching Mathematics and Natural Sciences

Juraj Hromkovic, Björn Steffen, J. Hromkovic, 2011, ISSEP.

ICALP Workshops 2000: Proceedings of the Satellite Workshops of the 27th International Colloquium on Automata, Languages, and Programming

J Hromkovic, R Gorrieri, Joe B. Wells, 2000 .

Lower Bounds on Systolic Array Computations and the Optimality of Kung's Convolution Algorithm

Juraj Hromkovic, Juraj Procházka, J. Hromkovic, 1994, Mathematical Aspects of Natural and Formal Languages.

Deterministic versus Nondeterministic Space in Terms of Synchronized Alternating Machines

Anna Slobodová, Juraj Hromkovic, Branislav Rovan, 1994, Theor. Comput. Sci..

One-way multihead deterministic finite automata

Juraj Hromkovic, J. Hromkovic, 1983, Acta Informatica.

Reoptimization of Hard Optimization Problems

Dennis Komm, Juraj Hromkovič, Hans-Joachim Böckenhauer, 2018, Handbook of Approximation Algorithms and Metaheuristics.

Distributed Computing and Education Column Special Issue

S. Schmid, J. Hromkovic, U. Abraham, 2018 .

Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems

Jarkko Kari, Lila Kari, Juraj Hromkovic, 1993, Theor. Comput. Sci..

Why the Concept of Computational Complexity is Hard for Verifiable Mathematics

Juraj Hromkovic, J. Hromkovic, 2015, Electron. Colloquium Comput. Complex..

Approximation algorithms for the TSP with sharpened triangle inequality

Juraj Hromkovic, Hans-Joachim Böckenhauer, Ralf Klasing, 2000, Inf. Process. Lett..

Comparing Descriptional and Computational Complexity of Infinite Words

Juraj Hromkovic, Juhani Karhumäki, Arto Lepistö, 1994, Results and Trends in Theoretical Computer Science.

Two Lower Bounds on Computational Complexity of Infinite Words

Juraj Hromkovic, Juhani Karhumäki, J. Karhumäki, 1997, New Trends in Formal Languages.

Optimal algorithms for dissemination of information in generalized communication modes

Juraj Hromkovic, Burkhard Monien, Rainer Feldmann, 1994, Discret. Appl. Math..

Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs

Juraj Hromkovic, Ralf Klasing, Elena Stöhr, 1993, Inf. Comput..

Optimal Algorithms for Disemination of Information in Generalized Communication Modes

Juraj Hromkovic, Burkhard Monien, Rainer Feldmann, 1992, PARLE.

Dissemination of Information in Vertex-Disjoint Paths Mode

Juraj Hromkovic, Ralf Klasing, Elena Stöhr, 1996, Comput. Artif. Intell..

A Comparison of Two Lower-Bound Methods for Communication Complexity

Martin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger, 1994, Theor. Comput. Sci..

Algorithmics - Is There Hope for a Unified Theory?

Juraj Hromkovic, J. Hromkovic, 2010, CSR.

On the Approximation Hardness of Some Generalizations of TSP

Juraj Hromkovic, Hans-Joachim Böckenhauer, Joachim Kneis, 2006, SWAT.

On the Hardness of Reoptimization

Juraj Hromkovic, Hans-Joachim Böckenhauer, Peter Widmayer, 2008, SOFSEM.

Designing informatics curriculum for K-12 education: From Concepts to Implementations

Valentina DAGIENE, Juraj HROMKOVIC, Regula LACHER, 2021, Informatics Educ..

On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's

Holger Petersen, Juraj Hromkovic, Georg Schnitger, 2009, Theor. Comput. Sci..

Languages Alive

Dennis Komm, Juraj Hromkovic, Hans-Joachim Böckenhauer, 2012, Lecture Notes in Computer Science.

Two Lower Bounds on Distributive Generation of Languages

Jarkko Kari, Lila Kari, Juraj Hromkovic, 1994, Fundam. Informaticae.

Translating Regular Expressions into Small -Free Nondeterministic Finite Automata

J. Hromkovic, Thomas Wilke, Sebastian Seibert, 2001, J. Comput. Syst. Sci..

Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata

Thomas Wilke, Juraj Hromkovic, Sebastian Seibert, 1997, STACS.

The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems)

Juraj Hromkovič, Burkhard Monien, B. Monien, 1991, MFCS.

Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes

Juraj Hromkovic, Ralf Klasing, Walter Unger, 1997, Inf. Comput..

Gossiping in Vertex-Disjoint Path Mode in Interconnection Networks

Juraj Hromkovic, Ralf Klasing, Elena Stöhr, 1993, WG.

Algorithmic aspects of some combinatorial problems in bioinformatics

Juraj Hromkovič, Dirk Bongartz, J. Hromkovic, 2006 .