Publications

You can visit DBLP for an overview and electronic versions of some of the papers of Juraj Hromkovič.

A PDF with all publications can be found here.

Navigate to Books, Editorial Work, Journals, Proceedings, Invited Publications.

Monographs, Textbooks, and Chapters in Books

A complete and more detailed list of the books written by Juraj Hromkovič can be found here.

2013

• H.-J. Böckenhauer, J. Hromkovič:
  Formale Sprachen - Endliche Automaten, Grammatiken, lexikalische und syntaktische Analyse.
  Springer Vieweg, 2013, ISBN: 978-3-658-00724-9, 245p.
  

2012

• J. Hromkovič:
  Einführung in die Programmierung mit LOGO.
  Second edition, Springer Vieweg, 2012, ISBN: 978-3-8348-1852-2, 271p.
  
• J. Hromkovič:
  Algorithmik und Informatik.
  In: E. Zeidler (ed.), Springer-Taschenbuch der Mathematik: Begründet von I.N. Bronstein und K.A. Semendjaew, weitergeführt von G. Grosche, V. Ziegler und D. Ziegler, Third edition, Springer Vieweg, 2012, ISBN: 978-3-8351-0123-4, 137p.
  

2011

• J. Hromkovič:
  Berechenbarkeit. Logik, Argumentation, Rechner und Assembler, Unendlichkeit, Grenzen der Automatisierbarkeit.
  Vieweg+Teubner, 2011, ISBN: 978-3-8348-1509-5, 265p.
  
• J. Hromkovič:
  Theoretische Informatik. Formale Sprachen, Berechenbarkeit, Komplexitätstheorie, Algorithmik, Kryptographie.
  Fourth edition, Vieweg+Teubner, 2011, ISBN: 978-3-8348-0650-5, 415p.

2010

• K. Freiermuth, J. Hromkovič, L. Keller, B. Steffen:
  Einführung in die Kryptologie.
  Vieweg+Teubner, 2010, ISBN: 978-3-8348-1005-2, 407p.
  
• J. Hromkovič:
  Теоретическaя информaтикa (Theoretical Computer Science).
  Bhv-Verlag St. Petersburg, 2010, ISBN: 978-5-9775-0406-5 (in Russian).

2009

• J. Hromkovič:
  Algorithmic Adventures. From Knowledge to Magic.
  Springer-Verlag, 2009, ISBN: 978-3-5408-5985-7, 363p.
  
• J. Hromkovič:
  Einführung in die Programmierung in LOGO.
  Vieweg+Teubner, 2009, ISBN: 978-3-8348-1004-5, 272p.
  
• J. Hromkovič:
  Sieben Wunder der Informatik. Eine Reise an die Grenze des Machbaren.
  Second Edition, Vieweg+Teubner, 2009, ISBN: 978-3-8351-0172-3, 360p.
  

2008

• J. Hromkovič:
  Lehrbuch Informatik. Vorkurs Programmieren, Geschichte und Begriffsbildung, Automatenentwurf.
  Vieweg+Teubner, 2008, ISBN: 978-3-8348-0620-8, 512p.

2007

• H-J. Böckenhauer, J. Hromkovič, S. Seibert:
  Stability of Approximation.
  In: T.F. Gonzales (ed.), Handbook on Approximation Algorithms and Metaheuristics, Taylor and Francis Group, 2006, ISBN: 978-1-5848-8550-4.
• J. Hromkovič:
  Theoretische Informatik. Formale Sprachen, Berechenbarkeit, Komplexitätstheorie, Algorithmik, Kryptographie.
  Third edition, B.G. Teubner, 2001, ISBN: 978-3-8351-0043-5, 415p.

2006

• J. Hromkovič:
  Sieben Wunder der Informatik. Eine Reise an die Grenze des Machbaren.
  B.G. Teubner, 2006, ISBN: 978-3-8351-0078-7, 354p.
  

2005

• J. Hromkovič, R. Klasing, A. Pelc, P. Ruzicka, W. Unger:
  Dissemination of Information in Communication Networks. Broadcasting, Gossiping, Leader Election, Fault-Tolerance.
  Springer-Verlag, 2005, ISBN: 978-3-5400-0846-0, 364p.
  
• J. Hromkovič:
  Design and Analysis of Randomized Algorithms. Introduction to Design Paradigms.
  Springer-Verlag, 2005, ISBN: 978-3-5402-3949-9, 274p.
  
• J. Hromkovič:
  計算困難問題に対するアルゴリズム理論  (Algorithmics for Hard Problems).
  Springer Tokyo, 2005, ISBN: 4-431-71182-1 C3041, 577p. (in Japanese).
  

2004

• J. Hromkovič:
  Theoretische Informatik. Berechenbarkeit, Komplexitätstheorie, Algorithmik, Kryptographie. Eine Einführung.
  Second edition, B.G. Teubner, 2001, ISBN: 978-3-5191-0332-5, 339p.
• J. Hromkovič:
  Algorithmics for Hard Problems. Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics.
  Second corrected edition, Springer-Verlag, 2004, ISBN: 3-540-44134-4, 544p.
• J. Hromkovič:
  Randomisierte Algorithmen.
  B.G. Teubner, 2004, ISBN: 3-519-00470-4, 310p.

2003

• J. Hromkovič:
  Theoretical Computer Science. An introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication and Cryptography.
  Springer-Verlag, 2003, ISBN: 3-540-14015-8, 315p.

2002

• J. Hromkovič:
  Algorithmics for Hard Problems. Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics.
  Second enlarged edition, Springer-Verlag, 2002, ISBN: 3-540-44134-4, 544p.

2001

• J. Hromkovič:
  Algorithmics for Hard Problems. Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics.
  Springer-Verlag, 2001, ISBN: 3-540-66860-8, 492p.
• J. Hromkovič:
  Communication Protocols - An Exemplary Study of the Power of Randomness.
  In: P. Pardalos, S. Rajasekaran, J. Reif, J. Rolim (eds.), Handbook of Randomized Computing, Volume II, Chapter 14, Kluwer Academic Publishers, 2001, ISBN: 0-7923-6959-9, pp. 533-596.
• J. Hromkovič:
  Algorithmische Konzepte der Informatik. Berechenbarkeit, Komplexitätstheorie, Algorithmik, Kryptographie. Eine Einführung.
  B.G. Teubner, 2001, ISBN: 3-519-00332-5, 286p.

2000

• J. Hromkovič:
  Communication Complexity and Parallel Computing.
  Beijing World Publishing Corporation, 2000, special edition for People's Republic of China, 336p.

1997

• J. Hromkovič:
  Communication Complexity and Parallel Computing.
  Springer-Verlag, ISBN: 3-540-57459-X, 336p.
• C. Calude, J. Hromkovič:
  Complexity: A Language-Theoretic Point of View.
  In: G. Rozenberg, A. Salomaa (eds.), Handbook of Formal Languages, Volume II. 
  Springer-Verlag, 1997, ISBN: 3-540-61486-9, pp. 3-80.

1995

• J. Hromkovič, R. Klasing, B. Monien, R. Peine:
  Dissemination of Information in Interconnection Networks. Broadcasting and Gossiping.
  In: Frank Hsu, Ding-Zhu Du (eds.), Combinatorial Network Theory, Kluwer Academic Publishers, 1995, ISBN: 0-7923-3777-8, pp. 125-212.
  
  

Editorial Work

2011

• I. Černa, T. Gyimothy, J. Hromkovič, K. Jeffery, R. Královič, M. Vukolič, S. Wolf:
  Proc. of the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011).
  Lecture Notes in Computer Science 6543, Springer-Verlag, 2011, ISBN: 978-3-6421-18380-5.
  
• D.F. Hsu, B.M. Maggs, H.C.T. Ho, J. Hromkovič, F.C.M. Lau, F. Meyer auf der Heide:
  Journal of Interconnection Networks.
  Volume 12(1-2), 2011.
  

2010

• J. Hromkovič, R. Královič, J. Varenhold:
  Proc. of the 4th International Conference on Informatics in Secondary Schools: Evolution and Perspectives (ISSEP 2010).
  Lecture Notes in Computer Science 5941, Springer-Verlag, 2010, ISBN: 978-3-642-11375-8.
• J. Hromkovič, B. Suster, E. Toman:
  Fundamenta Informaticae.
  Volume 104(3), special issue dedicated to O.B. Lupanov, 2010.
  

2007

• J. Hromkovič, R. Královič, M. Nunkesser, P. Widmayer:
  Proc. of the 4th International Symposium on Stochastic Algorithms: Foundations and Applications (SAGA 2007).
  Lecture Notes in Computer Science 4665, Springer-Verlag, 2007.

2004

• J. Hromkovič, M. Nagl, B. Westfechtel:
  Proc. of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2004).
  Lecture Notes in Computer Science 3353, Springer-Verlag, 2004, ISBN: 978-3-5402-4132-4, 424p.
  

2001

• J.D.P. Rolim, A.Z. Broder, A. Corradini, R. Gorrieri, R. Heckel, J. Hromkovič, U. Vaccaro, J.B. Wells:
  Proc. of the Satellite Workshops of the 27th International Colloquium on Automata, Languages, and Programming (ICALP 2001).
  Carleton Scientific, 2001, ISBN: 1-894145-07-0, 621p.
• R. Freivalds, J. Hromkovič, G. Paun, W. Unger:
  Special issue on MFCS 1998: Communication, molecular computing, and randomized algorithms.
  Theoretical Computer Science 264(1-2), 2001.
• J. Hromkovič, O. Sýkora:
  Special issue of WG 1998.
  Discrete Applied Mathematics 108(1-2), 2001.

1998

• J. Hromkovič, O. Sýkora, W. Unger:
  Preproc. of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 1998).
  Smolenice, June 18-20, 1998, RWTH Press, 1998, 92p.
• J. Hromkovič, W. Unger:
  Proc. of the MFCS 1998 Workshop on Communication.
  RWTH Press, 1998, 119p.
• J. Hromkovič, O. Sýkora:
  Proc. of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 1998).
  Lecture Notes in Computer Science 1517, Springer-Verlag, 1998, ISBN: 3-540-65195-0, 383p.

Publications in Refereed Journals

2012

• J. Hromkovič, F. M. Ablayev:
  Алгоритмы и случайность. Урок 1. Что такое случайность (Algorithms and randomness. Lecture 1: What is randomness).
  Компьютерные инструменты в школе (Computer Tools at School) 1, pp. 24-29, 2012 (in Russian).
  
• J. Hromkovič, F. M. Ablayev:
  Алгоритмы и случайность. Урок 2. Когда случайность может быть полезной (Algorithms and randomness. Lecture 2: When randomness can be useful).
  Компьютерные инструменты в школе (Computer Tools at School) 2, pp. 30-35, 2012 (in Russian).
  
• J. Hromkovič, F. M. Ablayev:
  Алгоритмы и случайность. Урок 3. Анализ протокола WITNESS и его обобщение (Algorithms and randomness. Lecture 3: Analysis of the WITNESS protocol and its generalization).
  Компьютерные инструменты в школе (Computer Tools at School) 3, pp. 39-43, 2012 (in Russian).
  
• J. Hosoda, J. Hromkovič, T. Izumi, H. Ono, M. Steinová, K. Wada:
  On the approximability and hardness of minimum topic connected overlay and its special instances.
  Theoretical Computer Science 429, pp. 144–154, 2012.
• H.-J. Böckenhauer, K. Freiermuth, J. Hromkovič, T. Mömke, A. Sprock, B. Steffen:
  Steiner tree reoptimization in graphs with sharpened triangle inequality.
  Journal of Discrete Algorithms 11, pp. 73-86, 2012.
  

2011

• J. Hromkovič, L. Keller, D. Komm, G. Serafini, B. Steffen:
  Fehlerkorrigierende Codes - Ein Unterrichtsbeispiel zum gelenkten entdeckenden Lernen.
  LOG IN 31(168): pp. 50-55, 2011.
  
• H.-J. Böckenhauer, J. Hromkovič, A. Sprock:
  On the hardness of reoptimization with multiple given solutions.
  Fundamenta Informaticae 110, pp. 59-76, 2011.
• J. Hromkovič, G. Schnitger:
  Ambiguity and Communication.
  Theory of Computing Systems 48(3), pp. 517-534, 2011.

2010

• J. Hromkovič, G. Schnitger:
  On probabilistic pushdown automata.
  Information and Computation 208(8), pp. 982-995, 2010.
  

2009

• J. Hromkovič, H. Petersen, G. Schnitger:
  On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFAs.
  Theoretical Computer Science 410, pp. 2972-2981, 2009.
• H.-J. Böckenhauer, J. Hromkovič, R. Kralovič, T. Mömke, P. Rossmanith:
  Reoptimization of Steiner trees: Changing the terminal set.
  Theoretical Computer Science 410(36), pp. 3428-3435, 2009.
• J. Hromkovič, P. Kanarek, R. Klasing, K. Lorys, W. Unger, H. Wagener:
  On the size of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks.
  SIAM Journal on Discrete Mathematics 23(3), pp. 1612-1645, 2009.
  
• J. Hromkovič, G. Schnitger:
  Lower Bounds on the Size of Sweeping Automata.
  Journal of Automata, Languages and Combinatorics 14(1), pp. 23-31, 2009.

2008

• H.-J. Böckenhauer, D. Bongartz, J. Hromkovič, R. Klasing, G. Proietti, S. Seibert, W. Unger:
  On k-connectivity problems with sharpened triangle inequality.
  Journal of Discrete Algorithms 6(4), pp. 605-617, 2008.

2007

• J. Hromkovič, G. Schnitger:
  NFAs with and without epsilon-transitions.
  Theoretical Computer Science 380, pp. 100-114, 2007.
• J. Hromkovič, T. Mömke, K. Steinhöfel, P. Widmayer:
  Job shop scheduling with unit length tasks: Bounds and algorithms.
  Algorithmic Operations Research 2(1), pp. 1-14, 2007.
• H.-J. Böckenhauer, J. Hromkovič, J. Kneis, J. Kupke:
  The parametrized approximability of TSP with deadlines.
  Theory of Computing Systems 41(3), pp. 431-444, 2007.
• H.-J. Böckenhauer, L. Forlizzi, J. Hromkovič, J. Kneis, J. Kupke, G. Proietti, P. Widmayer:
  On the approximability of TSP on local modifications of optimally solved instances.
  Algorithmic Operations Research 2(2), pp. 83-93, 2007.

2006

• L. Forlizzi, J. Hromkovič, G. Proietti, S. Seibert:
  On the stability of approximation for Hamiltonian path problems.
  Algorithmic Operations Research 1, pp. 20-34, 2006.

2005

• J. Hromkovič, G. Schnitger:
  On the power of randomized multicounter machines.
  Theoretical Computer Science 330, pp. 135-144, 2005.

2004

• P. Ďuriš, J. Hromkovič, K. Inoue:
  On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata.
  Journal of Computer and System Sciences 68(3), pp. 678-699, 2004.
  
• P. Ďuriš, J. Hromkovič, S. Jukna, M. Sauerhoff, G. Schnitger:
  On multi-partition communication complexity.
  Information and Computation 194, pp. 49-75, 2004.
• H.-J. Böckenhauer, D. Bongartz, J. Hromkovič, R. Klasing, G. Proietti, S. Seibert, W. Unger:
  On the hardness of constructing minimal 2-connected spanning
  subgraphs in complete graphs with sharpened triangle inequality.
  Theoretical Computer Science 326(1-3), pp. 137-153, 2004.

2003

• J. Hromkovič, M. Sauerhoff:
  On the power of nondeterminism and randomness for oblivious branching programms.
  Theory of Computing Systems 36, pp. 159-182, 2003.
• J. Hromkovič, G. Schnitger:
  Nondeterministic communication with a limited number of advice bits.
  SIAM Journal on Computing 33(1), pp. 43-68, 2003.

2002

• J. Hromkovič, J. Karhumäki, H. Klauck, G. Schnitger, S. Seibert:
  Communication complexity method for measuring nondeterminism in finite automata.
  Information and Computation 172, pp. 202-217, 2002.
• H.-J. Böckenhauer, J. Hromkovič, R. Klasing, S. Seibert, W. Unger:
  Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem.
  Theoretical Computer Science 285, pp. 3-24, 2002.
• J. Hromkovič:
  Descriptional complexity of finite automata: Concepts and open problems.
  Journal of Automata, Languages and Combinatorics 7, pp. 519-531, 2002.

2001

• J. Hromkovič:
  Zufall und zufallsgesteuerte Algorithmen.
  LOG IN 21, pp. 14-17, 2001.
• J. Hromkovič, G. Schnitger:
  On the power of Las Vegas II. Two-way finite automata.
  Theoretical Computer Science 262, pp. 1-14, 2001.
• J. Hromkovič, S. Seibert, T. Wilke:
  Translating regular expressions into small epsilon-free nondeterministic finite automata.
  Journal of Computer and System Sciences 62, pp. 565-588, 2001.
• J. Hromkovič, G. Schnitger:
  On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata.
  Information and Computation 169, pp. 284-296, 2001.

2000

• H.-J. Böckenhauer, J. Hromkovič, R. Klasing, S. Seibert, W. Unger:
  Approximation algorithms for the TSP with sharpened triangle inequality.
  Information Processing Letters 75(3), pp. 133-138, 2000.

1999

• J. Hromkovič:
  Communication complexity and lower bounds on multilective computations.
  RAIRO Theoretical Informatics and Applications 33, pp. 193-212, 1999.
• J. Hromkovič:
  Some contributions of the study of abstract communication complexity to other areas of computer science.
  ACM Computing Survey 31(3), pp. 223-226, 1999.
• J. Hromkovič:
  Towards a theory explaining the work of homeopathy or simulated annealing as a method for optimization of the state of health of living beings.
  Journal of the American Institute of Homeopathy 91(4), pp. 307-319, 1988-99.

1998

• J. Hromkovič, R. Klasing, D. Pardubská, J. Waczulík, H. Wagener:
  Effective systolic algorithms for gossiping in cycles.
  Parallel Processing Letters 8, pp. 197-205, 1998.

1997

• J. Hromkovič, R. Klasing, W. Unger, H. Wagener:
  Optimal algorithms for broadcast and gossip in the edge-disjoint path modes.
  Information and Computation 133, pp. 1-33, 1997.

1996

• J. Hromkovič, R. Klasing, E.A. Stör:
  Dissemination of information in vertex-disjoint paths mode.
  Computers and Artificial Inteligence 15, pp. 295-318, 1996.
• J. Hromkovič, J. Kari, L. Kari, D. Pardubská:
  Two lower bounds on distributive generation of languages.
  Fundamenta Informaticae 25, pp. 271-284, 1996.
• M. Dietzfelbinger, J. Hromkovič, G. Schnitger:
  A comparison of two lower bounds methods for communication complexity.
  Theoretical Computer Science 168, pp. 39-51, 1996.

1995

• J. Hromkovič, V. Müller, O. Sýkora, I. Vrt'o:
  On embeddings in cycles.
  Information and Computation 118, pp. 302-305, 1995.
• X. Gubás, J. Hromkovič, J. Waczulík:
  A nonlinear lower bound on the practical combinational complexity.
  Theoretical Computer Science 143, pp. 335-342, 1995.
• J. Hromkovič, R. Klasing, E.A. Stör, H. Wagener:
  Gossiping in vertex-disjoint paths mode in d-dimensional grids and planar graphs.
  Information and Computation 123, pp. 17-28, 1995.

1994

• J. Hromkovič, J. Kari, L. Kari:
  Some hierarchies for the communication complexity measures of cooperating grammar systems.
  Theoretical Computer Science 127, pp. 123-147, 1994.
• J. Hromkovič, R. Klasing, D. Pardubská, W. Unger, H. Wagener:
  The complexity of systolic gossiping in interconnection networks.
  RAIRO Theoretical Informatics and Applications 28, pp. 303-342, 1994.
• J. Hromkovič, C.D. Jeschke, B. Monien:
  Note on optimal gossiping in some weak-connected graphs.
  Theoretical Computer Science 127, pp. 395-402, 1994.
• R. Feldmann, J. Hromkovič, S. Madhavapeddy,  B. Monien, P. Mysliwietz:
  Optimal algorithms for dissemination of information in generalized communication modes.
  Discrete Applied Mathematics 53, pp. 55-78, 1994.
• J. Hromkovič, B. Rovan, A. Slobodová:
  Deterministic versus nondeterministic space in terms of synchronized alternating machines.
  Theoretical Computer Science 132, pp. 319-336, 1994.

1993

• J. Hromkovič, K. Inoue:
  A note on realtime one-way synchronized alternating one-counter automata.
  Theoretical Computer Science 108, pp. 393-400, 1993.
• J. Hromkovič, C.D. Jeschke, B. Monien:
  Optimal algorithms for dissemination of information in some interconnection networks.
  Algorithmica 10, pp. 24-40, 1993.

1992

• J. Hromkovič, J. Kelemen, J. Waczulìk:
  Abstract symbol systems - An exercise of the bottom up approach in artificial intelligence.
  Journal of Experimental and Theoretical Artifical Intelligence 1, pp. 49-58, 1992.
• J. Hromkovič, M. Krause, C. Meinel, S. Waack:
  Branching programs provide lower bounds on the area of multilective deterministic and nondeterministic VLSI-circuits.
  Information and Computation 95(2), pp. 117-128, 1992.
• J. Hromkovič, S.A. Lozkin, A.I. Rybko, A.A. Sapozenko, A.N. Škalikova:
  Lower bounds on the area complexity of Boolean circuits.
  Theoretical Computer Science 97, pp. 285-300, 1992.
• J. Hromkovič, K. Inoue, B. Rovan, A. Slobodová, I. Takanami, K.W. Wagner:
  On the power of one-way synchronized alternating machines with small space.
  International Journal of Foundations of Computer Science 3, pp. 65-79, 1992.

1991

• J. Hromkovič:
  On problems for which no oracle can help.
  Mathematical Systems Theory 24, pp. 41-52, 1991.
• J. Hromkovič:
  Branching programs versus oblivious branching programs.
  Computers and Artificial Intelligence 10(1), pp. 67-74, 1991.
• J. Hromkovič, J. Karhumäki, B. Rovan, A. Slobodová:
  On the power of synchronization in parallel computations.
  Discrete Applied Mathematics 32, pp. 155-182, 1991.
• J. Hromkovič:
  Reversals-space-parallelism tradeoffs for language recognition.
  Mathematica Slovaca 41(2), pp. 121-136, 1991.
• J. Hromkovič, K. Inoue, A. Ito, I. Takanami:
  On the power of two-dimensional synchronized alternating finite automata.
  Fundamenta Informaticae 15, pp. 90-98, 1991.
• J. Hromkovič:
  Nonlinear lower bounds on the number of processors of circuits with sublinear separators.
  Information and Computation 95(2), pp. 117-128, 1991.
• J. Hromkovič, L. Janiga, V. Koubek:
  Variable multihead machines.
  Journal of Information Processing and Cybernetics EIK 27(8), pp. 411-424, 1991.
• J. Hromkovič:
  Branching programs provide lower bound on the area of VLSI circuits.
  Kybernetika 27(6), pp. 542-550, 1991.

1990

• J. Hromkovič, B. Šuster:
  O sootnošeniji sloznostej dvuch vidov ploskich schem iz funkcional'nych elementov (On the gap between the complexities of two types of planar Boolean circuits).
  Diskretnaja Matematika 2(2), pp. 121-126, 1990 (in Russian).

1989

• J. Hromkovič:
  Some complexity aspects of VLSI computations. Part 5. Nondeterministic and probabilistic VLSI circuits.
  Computers and Artificial Intelligence 8(2), pp. 169-188, 1989.
• J. Hromkovič:
  Some complexity aspects of VLSI computations. Part 6. Communication complexity.
  Computers and Artificial Intelligence 8(3), pp. 209-226, 1989.
• J. Hromkovič:
  Tradeoffs for language recognition on alternating machines.
  Theoretical Computer Science 63, pp. 203-221, 1989.
• J. Hromkovič, K. Inoue, I. Takanami:
  Lower bounds for language recognition on two-dimensional alternating multihead machines.
  Journal of Computer and System Sciences 38(3), pp. 431-451, 1989.
• K. Inoue, I. Takanami, J. Hromkovič:
  A leaf size hierarchy of two-dimensional alternating Turing machines.
  Theoretical Computer Science 67, pp. 99-110, 1989.
  
• J. Hromkovič:
  The knowledge on information content of problems provides much useful information to circuit designers.
  Bulletin of the EATCS 39, pp. 154-170, 1989.

1988

• J. Hromkovič:
  The advantages of a new approach to defining the communication complexity of VLSI.
  Theoretical Computer Science 57, pp. 97-111, 1988.
• J. Hromkovič:
  Some complexity aspects of VLSI computations. Part 1. A framework for the study of information transfer in VLSI circuits.
  Computers and Artificial Intelligence 7(3), pp. 229-252, 1988.
• J. Hromkovič:
  Some complexity aspects of VLSI computations. Part 2. Topology of circuits and information transfer.
  Computers and Artificial Intelligence 7(4), pp. 289-302, 1988.
• J. Hromkovič, D. Pardubská:
  Some complexity aspects of VLSI computations. Part 3. On the power of input bit permutation in tree and trellis automata.
  Computers and Artificial Intelligence 7(5), pp. 397-412, 1988.
• J. Hromkovič, D. Pardubská:
  Some complexity aspects of VLSI computations. Part 4. VLSI circuits with programs.
  Computers and Artificial Intelligence 7(6), pp. 481-495, 1988.
• J. Hromkovič, E. Kupková:
  Graph controlled Lindenmayer systems.
  Journal on Information Processing and Cybernetics EIK 24(10), pp. 481-493, 1988.
• J. Hromkovič, J. Kelemen:
  How to define complex symbol systems? A preliminary answer.
  Papers on Automata and Languages 10, pp. 39-47, 1988.
  
• J. Hromkovič:
  A candidate for nonlinear lower bound on the combinatorial complexity.
  Bulletin of the EATCS 36, pp. 126-128, 1988.

1987

• J. Hromkovič:
  Reversal-bounded nondeterministic multicounter machines and complementation.
  Theoretical Computer Science 51, pp. 325-330, 1987.
• P. Ďuriš, J. Hromkovič:
  Zerotesting bounded multicounter machines.
  Kybernetika 23(1), pp. 13-18, 1987.

1986

• J. Hromkovič:
  Hierarchy of reversal bounded one-way multicounter machines.
  Kybernetika 22(2), pp. 200-206, 1986.
• J. Hromkovič, J. Mertan:
  The growth function of stochastic TOL languages.
  Computers and Artificial Intelligence 5(2), pp. 123-132, 1986.
• J. Hromkovič:
  Relation between Chomsky hierarchy and communication complexity hierarchy.
  Acta Mathematica Universitatis Comenianae 48-49, pp. 311-317, 1986.
• J. Hromkovič:
  Communication complexity hierarchy.
  Theoretical Computer Science 48, pp. 109-115, 1986.
• M. Chrobak, J. Hromkovič:
  Open problems in automata theory related to complexity theory.
  Computers and Artificial Intelligence 5(6), pp. 489-492, 1986.

1985

• J. Hromkovič:
  Ratio function analysis.
  Computers and Artificial Intelligence 4(2), pp. 137-142, 1985.
• J. Hromkovič:
  On the number of monotonic functions from two-valued to k-valued logic.
  Kybernetika 21(3), pp. 228-234, 1985.
• M. Ftácnik, J. Hromkovič:
  Nonlinear lower bound for real-time branching programs.
  Computers and Artificial Intelligence 4(3), pp. 353-359, 1985.
• J. Hromkovič:
  Alternating multicounter machines with constant number of reversals.
  Information Processing Letters 21, pp. 7-9, 1985.
• J. Hromkovič:
  Linear lower bound on unbounded fan-in Boolean circuits.
  Information Processing Letters 21, pp. 71-74, 1985.
• J. Hromkovič:
  On the power of alternation in automata theory.
  Journal on Computer and System Sciences 31(1), pp. 28-39, 1985.
• J. Hromkovič:
  Fooling a two-way nondeterministic automaton with reversal number restriction.
  Acta Informatica 22, pp. 589-594, 1985.
• J. Hromkovič:
  Reversal bounded multicounter machines.
  Computers and Artificial Intelligence 4(4), pp. 361-366, 1985.
• J. Hromkovič:
  On one-way two-head deterministic finite state automata.
  Computers and Artificial Intelligence 4(6), pp. 503-526, 1985.
  

1984

• J. Hromkovič:
  On the number of monotonic Boolean functions.
  Computers and Artificial Intelligence 3(3), pp. 319-329, 1984.
• J. Hromkovič:
  Normed protocols and communication complexity.
  Computers and Artificial Intelligence 3(5), pp. 415-422, 1984.
• J. Hromkovič:
  A note on the "Comunication Complexity" paper by Papadimitriou and Sipser.
  Bulletin of the EATCS 22, p. 20, 1984.
• J. Hromkovič:
  On the power of Yao-Rivest technique.
  Bulletin of the EATCS 23, pp. 33-34, 1984.

1983

• J. Hromkovič:
  One-way multihead deterministic finite automata.
  Acta Informatica 19, pp. 377-384, 1983.
• P. Ďuriš, J. Hromkovič:
  One-way simple multihead finite automata are not closed under concatenation.
  Theoretical Computer Science 27, pp. 121-125, 1983.

Publications in Refereed Books and Proceedings

2013

• H.-J. Böckenhauer, J. Hromkovič, D. Komm, S. Krug, J. Smula, A. Sprock:
  The string guessing problem as a method to prove lower bounds on the advice complexity.
  In: Proc. of the 19th Annual International Computing and Combinatorics Conference (COCOON 2013), Lecture Notes in Computer Science 7936, Springer-Verlag, pp. 493-505, 2013.
  
• M. P. Bianchi, H.-J. Böckenhauer, J. Hromkovič, S. Krug, B. Steffen:
  On the advice complexity of the online L(2,1)-coloring problem on paths and cycles.
  In: Proc. of the 19th Annual International Computing and Combinatorics Conference (COCOON 2013), Lecture Notes in Computer Science 7936, Springer-Verlag, pp. 53-64, 2013.

2012

• P. Bianchi, H.-J. Böckenhauer, J. Hromkovič, L. Keller:
  Online coloring of bipartite graphs with and without advice.
  In: Proc. of the 18th Annual International Conference on Computing and Combinatorics (COCOON 2012), Lecture Notes in Computer Science 7434, Springer-Verlag, pp. 519-530, 2012.
  

2011

• J. Hosoda, J. Hromkovič, T. Izumi, H. Ono, M. Steinová, K. Wada:
  On the approximability of minimum topic connected overlay and its special instances.
  In: Proc. of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS 2011), Lecture Notes in Computer Science 6907, Springer-Verlag, pp. 376-387, 2011.

2010

• H.-J. Böckenhauer, K. Freiermuth, J. Hromkovič, T. Mömke, A. Sprock, B. Steffen:
  The Steiner tree reoptimization problem with sharpened triangle inequality.
  In: Proc. of the 7th International Conference on Algorithms and Complexity (CIAC 2010), Lecture Notes in Computer Science 6078, Springer-Verlag, pp. 180-191, 2010.

2009

• J. Hromkovič, G. Schnitger:
  Ambiguity and communication.
  In: Proc. of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009), LIPIcs 09001, Schloss Dagstuhl, pp. 553-564, 2009.

2008

• D. Bilo, H.-J. Böckenhauer, J. Hromkovič, R. Královič, T. Mömke, P. Widmayer, A. Zych:
  Reoptimization of Steiner trees.
  In: Proc. of the 11th Scandinavian Workshop on Algorithm Theory (SWAT 2008), Lecture Notes in Computer Science 5124, Springer-Verlag, pp. 258-269, 2008.

2007

• H.-J. Böckenhauer, J. Hromkovič, R. Královič, T. Mömke, K. Steinhöfel:
  Efficient algorithms for the spoonerism problem.
  In: Proc. of the 4th International Conference on Fun with Algorithms (FUN 2007), Lecture Notes in Computer Science 4475, Springer-Verlag, pp. 78-92, 2007.
  

2006

• H.-J. Böckenhauer, L. Forlizzi, J. Hromkovič, J. Kneis, J. Kupke, G. Proietti, P. Widmayer:
  Reusing optimal TSP solutions for locally modified input instances (extended abstract).
  In: Proc. of the 4th IFIP International Conference on Theoretical Computer Science (IFIP TCS 2006), Springer-Verlag, pp. 251-270, 2006.
• H.-J. Böckenhauer, J. Hromkovič, J. Kneis, J. Kupke:
  On the approximation hardness of some generalizations of TSP (extended abstract).
  In: Proc. of the 10th Scandinavian Workshop on Algorithm Theory (SWAT 2006), Lecture Notes in Computer Science 4059, Springer-Verlag, pp. 184-195, 2006.
• J. Hromkovič:
  Contributing to general education by teaching informatics.
  In: Proc. of the 2nd International Conference in Informatics in Secondary Schools: Evolution and Perspectives (ISSEP 2006), Lecture Notes in Computer Science 4426, Springer-Verlag, pp. 25-37, 2006.

2005

• J. Hromkovič, G. Schnitger:
  NFAs with and without epsilon-transitions.
  In: Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005), Lecture Notes in Computer Science 3580, Springer-Verlag, pp. 135-144, 2005.
• L. Forlizzi, J. Hromkovič, G. Proietti, S. Seibert:
  On the stability of approximation for Hamiltonian path problems.
  In: Proc. of the 31st Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2005), Lecture Notes in Computer Science 3381, Springer-Verlag, pp. 147–156, 2005.

2003

• H.-J. Böckenhauer, D. Bongartz, J. Hromkovič, R. Klasing, G. Proietti, S. Seibert, W. Unger:
  K-Edge-Connectivity problems with sharpened triangle inequality.
  In: Proc. of the 5th Italian Conference on Algorithms and Complexity (CIAC 2003), Lecture Notes in Computer Science 2653, Springer-Verlag, pp. 189-200, 2003.
• J. Hromkovič, G. Schnitger:
  Nondeterminism versus determinism for two-way finite automata: Generalizations of Sipser's separation.
  In: Proc. of the 30th International Colloquium on Automata, Languages and Programming (ICALP 2003), Lecture Notes in Computer Science 2719, Springer-Verlag, pp. 439-451, 2003.
• J. Hromkovič, G. Schnitger:
  Pushdown automata and multicounter machines, a comparison of computation modes.
  In: Proc. of the 30th International Colloquium on Automata, Languages and Programming (ICALP 2003), Lecture Notes in Computer Science 2719, Springer-Verlag, pp. 66-80, 2003.

2002

• H.-J. Böckenhauer, D. Bongartz, J. Hromkovič, R. Klasing, G. Proietti, S. Seibert, W. Unger:
  On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharped triangle inequality.
  In: Proc. of the 22nd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2002), Lecture Notes in Computer Science 2556, Springer-Verlag, pp. 59-70, 2002.

2001

• J. Hromkovič, G. Schnitger,:
  On the power of randomized pushdown automata.
  In: Proc. of the 5th International Conference on Developments in Language Theory (DLT 2001), Lecture Notes in Computer Science 2295, Springer-Verlag, pp. 262-271, 2001.
• P. Duriš, J. Hromkovič, S. Jukna, M. Sauerhoff, G. Schnitger:
  Multipartition communication and the impact of non-obliviousness.
  In: Proc. of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2001), Lecture Notes in Computer Science 2010, Springer-Verlag, pp. 206-217, 2001.
• J. Hromkovič, K. Steinhöfel, P. Widmayer:
  Job shop scheduling with unit length tasks: Bounds and algorithms.
  In: Proc. of the 7th Italian Conference on Theoretical Computer Science (ICTCS 2001), Lecture Notes in Computer Science 2202, Springer-Verlag, pp. 90-106, 2001.

2000

• H.-J. Böckenhauer, J. Hromkovič, R. Klasing, S. Seibert, W. Unger:
  An improved lower bound on the approximability of metric TSP and approximation algorithms for the TSP with sharpened triangle inequality.
  In: Proc. 17th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2000), Lecture Notes in Computer Science 1770, Springer-Verlag, pp. 382-394, 2000.
• J. Hromkovič, M. Sauerhoff:
  Tradeoffs between nondeterminism and complexity for communication protocols and branching programs.
  In: Proc. 17th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2000), Lecture Notes in Computer Science 1770, Springer-Verlag, pp. 145-156, 2000.
• H.-J. Böckenhauer, J. Hromkovič, R. Klasing, S. Seibert, W. Unger:
  Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem.
  In: Proc. 4th Italian Conference on Algorithms and Complexity (CIAC 2000), Lecture Notes in Computer Science 1767, Springer-Verlag 2000, pp. 72-86.
• P. Duris, J. Hromkovič, K. Inoue:
  A separation of determinism, Las Vegas and nondeterminism for picture recognition.
  In: Proc. of the 15th Annual IEEE Conference on Computational Complexity, IEEE, pp. 214-228, 2000.
• J. Hromkovič, J. Karhumäki, H. Klauck, S. Seibert, G. Schnitger:
  Measures on nondeterminism in finite automata.
  In: 27th International Colloquium on Automata, Languages and Programming (ICALP 2000), Lecture Notes in Computer Science 1853, Springer-Verlag, pp. 199-210, 2000.

1999

• J. Hromkovič, G. Schnitger:
  On the power of Las Vegas II: Two-way finite automata.
  In: Proc. of the 26th International Colloquium on Automata, Languages and Programming (ICALP 1999), Lecture Notes in Computer Science 1644 , Springer-Verlag, pp. 433-443, 1999.

1998

• J. Hromkovič:
  Communication complexity and lower bounds on multilective computations.
  In: Proc. of the 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS 1998), Lecture Notes in Computer Science 1450, Springer-Verlag, pp.789-797, 1998.

1997

• P. Duris, J. Hromkovič, J.D.P. Rolim, G. Schnitger:
  Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations.
  In: Proc. 22nd International Symposium on Mathematical Foundations of Computer Science (STACS 1997), Lecture Notes in Computer Science 1200, Springer-Verlag, pp. 117-128, 1997.
• J. Hromkovič, S. Seibert, T. Wilke:
  Translating regular expressions into small epsilon-free nondeterministic finite automata.
  In: Proc. 22nd International Symposium on Mathematical Foundations of Computer Science (STACS 1997), Lecture Notes in Computer Science 1200, Springer-Verlag, pp. 55-66, 1997.

1996

• J. Hromkovič, G. Schnitger:
  Nondeterministic communication with a limited number of advice bits.
  In: Proc. of the 28th Annual ACM Symposium on the Theory of Computing (STOC 1996), pp. 551-560 1996.

1995

• J. Hromkovič. P. Kanarek, R. Klasing, K. Lorys, W. Unger, H. Wagener:
  On the size of permutation networks.
  In: Proc. of the 12th Annual Symposium on Theoretical Aspects of Computer Science (STACS 1995), Lecture Notes in Computer Science 900, Springer-Verlag 1995, pp. 255-266.
• J. Hromkovič, R. Klasing, D. Pardubská, W. Unger, J. Waczulík, H. Wagener:
  Effektive systolic algorithms for gossiping in cycles and two-dimensional grids.
  In: Proc. of the 10th International Symposium on Fundamentals of Computation Theory (FCT 1995), Lecture Notes in Computer Science 965, Springer-Verlag, pp. 273-282, 1995.

1994

• J. Hromkovič, R. Klasing, D. Pardubská, W. Unger, H. Wagener:
  The complexity of systolic dissemination of information in interconnection networks.
  In: Proc. of the 1st Canada-France Conference on Parallel and Distributed Computing (CFCP 1994), Lecture Notes in Computer Science 805, Springer-Verlag, pp. 235-249, 1994.
• J. Hromkovič, R. Klasing, W. Unger, H. Wagener:
  Optimal algorithms for broadcast and gossip in the edge-disjoint path modes.
  In: Proc. 4th Scandinavian Workshop on Algorithm Theory (SWAT 1994), Lecture Notes in Computer Science 824, Springer-Verlag, pp. 219-230, 1994.
• M. Dietzfelbinger, J. Hromkovič, G. Schnitger:
  A comparison of two lower bounds methods for communication complexity.
  In: Proc. of the 19th International Symposium on Mathematical Foundations of Computer Science (MFCS 1994), Lecture Notes in Computer Science 841, Springer-Verlag, pp. 326-335, 1994.
• J. Hromkovič, J. Kari, L. Kari, D. Pardubská:
  Two lower bounds on distributive generation of languages.
  In: Proc. of the 19th International Symposium on Mathematical Foundations of Computer Science (MFCS 1994), Lecture Notes in Computer Science 841, Springer-Verlag, pp. 423-432, 1994.
• J. Hromkovič, J. Karhumäki:
  Two lower bounds on computational complexity of infinite word generation.
  In: Proc. of the 13th World Computer Congress (IFIP Congress 1994), Volume I, IFIP, pp. 479-484, 1994.

1993

• J. Hromkovič, J. Kari, L. Kari:
  Some hierarchies for the communication complexity measures of cooperating grammar systems.
  In: Proc. 18th International Symposium on Mathematical Foundations of Computer Science (MFCS 1993), Lecture Notes in Computer Science 711, Springer-Verlag, pp. 495-505, 1993.
• J. Hromkovič, R. Klasing, E.A. Stöhr, H. Wagener:
  Gossiping in vertex-disjoint path mode in d-dimensional grids and planar graphs.
  In: Proc. of the 1st Annual European Symposium on Algorithms (ESA 1993), Lecture Notes in Computer Science 726, Springer-Verlag, pp. 200-211, 1993.
• J. Hromkovič, R. Klasing, E.A. Stöhr:
  Gossiping in vertex-disjoint paths mode in interconnection networks.
  In: Proc. of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 1993), Lecture Notes in Computer Science 790, Springer-Verlag, pp. 288-300, 1993.
• J. Hromkovič, B. Rovan, A. Slobodová:
  Deterministic versus nondeterministic space in terms of synchronized alternating machines.
  In: Proc. of the 1st Conference on Developments in Language Theory (DLT 1993), World Scientific Publishing, pp. 314-325, 1993.

1992

• J. Hromkovič:
  Topology of parallel networks and computational complexity.
  In: Proc. of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 1992), Lecture Notes in Computer Science 657, Springer-Verlag, pp. 70-77, 1992.

• X. Gubáš, J. Hromkovič, J. Waczulik:
  A nonlinear lower bound on the practical combinatorial complexity.
  In: Proc of the 9th Annual Symposium on Theoretical Aspects of Computer Science, (STACS 1992), Lecture Notes in Computer Science 577, Springer-Verlag, pp. 281-292, 1992.
• R. Feldmann, J. Hromkovič, S. Madhavapeddy, B. Monien, P. Mysliwietz:
  Optimal algorithms for dissemination of information in generalized communication modes.
  In: Proc. of the 4th International Conference on Parallel Architectures and Languages Europe (PARLE 1992), Lecture Notes in Computer Science 605, Springer-Verlag, pp. 115-130, 1992.
• J. Hromkovič, V. Müller, O. Sýkora, I. Vrt'o:
  On embeddings in cycles.
  In: Proc. of the 4th International Conference on Parallel Architectures and Languages Europe (PARLE 1992), Lecture Notes in Computer Science 605, Springer-Verlag, pp. 53-62, 1992.

1991

• J. Hromkovič, B. Monien:
  The bisection problem for graphs of degree four (Configuring transputer systems).
  In: Proc. of the 16th International Symposium on Mathematical Foundations of Computer Science (MFCS 1991), Lecture Notes in Computer Science 520, Springer-Verlag, pp. 211-220, 1991.
• J. Hromkovič:
  Nonlinear lower bounds on the number of processors of circuits with sublinear separators.
  In: Proc. of the 8th International Symposium on Fundamentals of Computation Theory (FCT 1991), Lecture Notes in Computer Science 529, Springer-Verlag, pp. 240-247, 1991.
  

1990

• J. Hromkovič, C.D. Jeschke, B. Monien:
  Optimal algorithms for dissemination of information in some interconnection networks.
  In: Proc. of the 15th International Symposium on Mathematical Foundations of Computer Science (MFCS 1990), Lecture Notes in Computer Science 452, Springer-Verlag, pp. 337-346, 1990.

1989

• J. Dassow, J. Hromkovič, J. Karhumäki, B. Rovan, A.Slobodová:
  On the power of synchronization in parallel computations.
  In: Proc. of the 14th International Symposium on Mathematical Foundations of Computer Science (MFCS 1989), Lecture Notes in Computer Science 379, Springer-Verlag, pp. 196-206, 1989.

1988

• J. Hromkovič, J. Procházka:
  Branching programs as a tool for proving lower bounds on VLSI computations and optimal algorithms for systolic arrays.
  In: Proc. of the 13th International Symposium on Mathematical Foundations of Computer Science (MFCS 1988), Lecture Notes in Computer Science 324, Springer-Verlag, pp. 360-370, 1988.
• J. Hromkovič, L. Janiga, V. Koubek:
  On automata with variable number of heads.
  In: Proc. of the 5th International Meeting of Young Computer Scientists (IMYCS 1988), Computer and Automaton Institute of the Hungarian Academy of Sciences, pp. 145-152, 1988.
• S.A. Lozkin, A.I. Rybko, A.A. Sapozenko, J. Hromkovič, N.A. Škalikova:
  Ob odnon podchode k ocenke prostranstvennoj sloznosti schem iz funkcional'nych elementov (On an approach to a bound for the area complexity of Boolean circuits).
  In: Mathematical Problems in Computation Theory, Banach Center Publications 21, Polish Scientific Publishers, pp. 503-512, 1988.

1987

• J. Hromkovič:
  Reversal complexity of multicounter and multihead machines.
  In: Proc. of the 4th Annual Symposium on Theoretical Aspects of Computer Science (STACS 1987), Lecture Notes in Computer Science 247, Springer-Verlag, pp. 159-168, 1987.
  

1986

• J. Hromkovič:
  Tradeoffs for language recognition on parallel computing models.
  In: Proc. of the 13th International Colloquium on Automata, Languages and Programming (ICALP 1986), Lecture Notes in Computer Science 226, Springer-Verlag, pp. 157-166, 1986.
• J. Hromkovič:
  A new approach to defining the communication complexity for VLSI.
  In: Proc. of the 12th International Symposium on Mathematical Foundations of Computer Science (MFCS 1986), Lecture Notes in Computer Science 223, Springer-Verlag, pp. 431-439, 1986.

1984

• J. Hromkovič:
  Communication complexity.
  In: Proc. of the 11th Colloquium on Automata, Languages and Programming (ICALP 1984), Lecture Notes in Computer Science 172, Springer-Verlag, pp. 235-246, 1984.
• J. Hromkovič:
  Hierarchy of reversal and zerotesting bounded multicounter machines.
  In: Proc. of the 11th International Symposium on Mathematical Foundations of Computer Science (MFCS 1984), Lecture Notes in Computer Science 176, Springer-Verlag, pp. 312-321, 1984.
• J. Hromkovič:
  On the power of alternation in finite automata.
  In: Proc. of the 11th International Symposium on Mathematical Foundations of Computer Science (MFCS 1984), Lecture Notes in Computer Science 176, Springer-Verlag, pp. 322-329, 1984.
• E. Braunsteinerová, J. Hromkovič:
  Graphic controlled table Lindenmayer systems.
  In: Proc. of the 3rd International Meeting of Young Computer Scientists (IMYCS 1984), Computer and Automaton Institute of the Hungarian Academy of Sciences, pp. 53-59, 1984.
• J. Hromkovič, J. Mertan:
  Stochastic Table Lindenmayer system.
  In: Proc. of the 3rd International Meeting of Young Computer Scientists (IMYCS 1984), Computer and Automaton Institute of the Hungarian Academy of Sciences, pp. 96-105, 1984.

1982

• P. Duriš, J. Hromkovič:
  Multihead finite state automata and concatenation.
  In: Proc. of the 9th Colloquium on Automata, Languages and Programming (ICALP 1982), Lecture Notes in Computer Science 140, Springer-Verlag, pp. 176-186, 1982.
• J. Hromkovič, A. Kelemenová:
  On kinetic models of cell population.
  In: Proc. of the 3rd Praguer Symposium on Simulation of Systems in Biology and Medicine, E12, E14, F1-F2, 1982.

1981

• J. Hromkovič:
  Closure properties of the family of languages recognized by one-way two-head deterministic finite state automata.
  In: Proc. of the 10th International Symposium on Mathematical Foundations of Computer Science (MFCS 1981), Lecture Notes in Computer Science 118, Springer-Verlag, pp. 304-313, 1981.

Invited Contributions in Books and Proceedings

2012

• J. Hromkovič, R. Královič, R. Královič, R. Stefanec:
  Determinism vs. nondeterminism for two-way automata - Representing the meaning of states by logical formulae.
  In: Proc. of the 16th International Conference on Developments in Language Theory (DLT 2012), Lecture Notes in Computer Science 7410, Springer-Verlag, pp. 24-39, 2012.
  
• H.-J. Böckenhauer, J. Hromkovič, D. Komm, R. Královič, P. Rossmanith:
  On the power of randomness versus advice in online computation.
  In: H. Bordihn, M. Kutrib, B. Truthe (eds.), Languages Alive, Essays Dedicated to Jürgen Dassow on the Occasion of His 65th Birthday, Lecture Notes in Computer Science 7300, Springer-Verlag, pp. 30-43, 2012.

2011

• H.-J. Böckenhauer, J. Hromkovič, A. Sprock:
  Knowing all optimal solutions does not help for TSP reoptimization.
  In: J. Kelemen, A. Kelemenová (eds.), Computation, Cooperation and Life - Essays Dedicated to Gheorghe Păun on the Occasion of His 60th Birthday, Lecture Notes in Computer Science 6610, Springer-Verlag, pp. 7-15, 2011.
  
• H.-J. Böckenhauer, J. Hromkovič, T. Mömke:
  Improved approximations for hard optimization problems via problem instance classification.
  In: C. S. Calude, G. Rozenberg, A. Salomaa (eds.), Rainbow of Computer Science - Essays Dedicated to Hermann Maurer on the Occasion of His 70th Birthday, Lecture Notes in Computer Science 6570, Springer-Verlag, pp. 3-19, 2011.
  
• J. Hromkovič, B. Steffen:
  Why teaching informatics in schools is as important as teaching mathematics and natural sciences.
  In: Proc. of the 5th International Conference on Informatics in Schools: Situation, Evolution and Perspectives (ISSEP 2011), Lecture Notes in Computer Science 7013, Springer-Verlag, pp. 21-30, 2011.

2010

• J. Hromkovič:
  Algorithmics - Is there hope for a unified theory.
  In: Proc. of the 5th International Computer Science Symposium in Russia (CSR 2010), Lecture Notes in Computer Science 6072, Springer-Verlag, pp. 181-194, 2010.
  
• J. Hromkovič, R. Královič, R. Královič:
  Information complexity of online problems.
  In: Proc. of the 35th International Symposium on Mathematical Foundations of Computer Science (MFCS 2010), Lecture Notes in Computer Science 6281, Springer-Verlag, pp. 24-36, 2010.

2008

• H.-J. Böckenhauer, J. Hromkovič, T. Mömke, P. Widmayer:
  On the hardness of reoptimization.
  In: Proc. of the 34th Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM2008), Lecture Notes in Computer Science 4910, Springer-Verlag, pp. 50-65, 2008.
• K. Freiermuth, J. Hromkovič, B. Steffen:
  Creating and testing textbooks for secondary schools.
  Proc. of the 3rd International Conference on Informatics in Secondary Schools: Evolution and Perspectives (ISSEP 2008), Lecture Notes in Computer Science 5090, Springer-Verlag, pp. 216-228, 2008.

2007

• H.-J. Böckenhauer, J. Hromkovič:
  Stability of approximation algorithms or parameterization of the approximation ratio.
  In: Proc. of the 9th International Symposium on Operations Research in Slovenia (SOR2007), Slovenian Society Informatika - Section for Operational Research, pp. 23-28, 2007.

2006

• J. Hromkovič:
  OPEN CLASS - Sieben Wunder der Informatik. Welche Themen der Informatik sind in der Mittelschulen vermittelbar?
  In: Proc. of Informatics in Schools, Evolution and Perspectives (DIDINFO2006), pp. 11-15, 2006.
  
• J. Hromkovič:
  Informatik und allgemeine Bildung.
  In: Proc. of Informatics in Schools, Evolution and Perspectives (DIDINFO2006), pp. 7-10, 2006.
• J. Hromkovič:
  Randomness as a source of efficiency (Tutorial).
  In: Tutorial for the 2nd International Conference in Informatics in Secondary Schools: Evolution and Perspectives (ISSEP 2006), pp. 696-697, 2006.
• J. Hromkovič:
  Informatik und allgemeine Bildung.
  VSMP Bulletin 102, pp. 12-17, 2006.
  

2004

• J. Hromkovič:
  Stability of approximation in discrete optimization.
  In: Proc. of the 8th World Computer Congress (IFIP TCS 2004), pp. 3-18, 2004.
  

2001

• J. Hromkovič:
  On the descriptional complexity of regular languages (Concepts and open problems).
  In: Proc. of the 3rd International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures (DCAGRS 2001), pp. 11-13, 2001.
  
• J. Hromkovič:
  Randomized communication complexity.
  In: Proc. of the 1st International Symposium on Stochastic Algorithms: Foundations and Applications (SAGA 2001), Lecture Notes in Computer Science 2264, Springer-Verlag, pp. 1-32, 2001.

1999

• J. Hromkovič:
  Stability of approximation algorithms and the knapsack problem.
  In: J. Karhumäki, H. Maurer, G. Paun, G. Rozenberg (eds.), Jewels are Forever, Springer-Verlag, pp. 238-249, 1999.
  
• J. Hromkovič:
  Stability of approximation algorithms for hard optimization problems.
  In: Proc. of the 26th Conference on Current Trends in Theory and Practice of Informatics (SOFSEM 1999), Lecture Notes in Computer Science 1725, Springer-Verlag, pp. 29-46, 1999.
  

1997

• J. Hromkovič, J. Karhumäki:
  Two lower bounds on computational complexity of infinite words.
  In: G. Paun, A. Salomaa (eds.), New Trends in Formal Languages, Lecture Notes in Computer Science 1218, Springer-Verlag, pp. 366-376, 1997.
• J. Hromkovič, G. Schnitger:
  Communication complexity and sequential computations.
  In: Proc. of the 22nd International Symposium on Mathematical Foundations of Computer Science (MFCS 1997), Lecture Notes in Computer Science 1295, Springer-Verlag, pp. 71-84, 1997.

1996

• J. Hromkovič:
  Descriptional and computational complexity measures for distributive generation of languages.
  In: J. Dassow, G. Rozenberg, A. Salomaa (eds.), Developments in Language Theory II, World Scientific Publishing, pp. 237-246, 1996.

1995

• J. Hromkovič, D. Wierzchula:
  Note on nondeterministic linear time, real time, and parallel communicating grammar systems.
  In: G. Paun (ed.), Mathematical Linguistics and Related Topics, Editura Academiei Romane, pp. 184-190, 1990.

1994

• J. Hromkovič, J. Karhumäki, A. Lepisto:
  Comparing descriptional and computational complexity of infinite words.
  In: Results and Trends in Theoretical Computer Science, Lecture Notes in Theoretical Computer Science 812, Springer-Verlag, pp. 169-182, 1994.
• J. Hromkovič, J. Procházka:
  Lower bounds on systolic array computations and the optimality of Kung's convolution algorithm.
  In: G. Paun (ed.), Mathematical Aspects of Natural and Formal Languages Series on Computer Science Vol. 43, World Scientific Publishing, pp. 151-164, 1994.

1992

• J. Hromkovič, B. Monien:
  The bisection problem for graphs of degree 4. (Configuring transputer systems)
  In: J. Buchmann, H. Ganzinger, W.J. Paul (eds.), Festschrift zum 60. Geburtstag von Günter Hotz, B.G. Teubner, pp. 215-234, 1992.
• J. Dassow, J. Hromkovič:
  On synchronized Lindenmayer picture languages.
  In: G. Rozenberg, A. Salomaa (eds.), Lindenmayer Systems, Springer-Verlag, pp. 253-262, 1992.
  

1990

• J. Hromkovič:
  Some new characterizations of fundamental complexity classes by synchronized alternation.
  In: Proc. of the Toyohashi Symposium on Theoretical Computer Science, Toyohashi University, pp. 103-107, 1990.

1987

• K. Inoue, I. Takanami, J. Hromkovič:
  A leaf-size hierarchy of two dimensional alternating Turing machines.
  In: Proc. of the Japan-US Joint Seminar, Perspectives in Computing, Vol. 15, Academic Press, pp. 389-404, 1987.
• J. Hromkovič:
  Lower bound techniques for VLSI algorithms.
  In: A. Kelemenová, J. Kelemen (eds.), Trends, Techniques, and Problems in Theoretical Computer Science, Lecture Notes in Computer Science 281, Springer-Verlag, pp. 2-25, 1987.