© 2018

Adventures Between Lower Bounds and Higher Altitudes

Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday

  • Hans-Joachim Böckenhauer
  • Dennis Komm
  • Walter Unger

Part of the Lecture Notes in Computer Science book series (LNCS, volume 11011)

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 11011)

Table of contents

  1. Front Matter
    Pages I-XXIV
  2. Automata and Formal Languages

    1. Front Matter
      Pages 1-1
    2. Pavol Ďuriš, Rafael Korbaš, Rastislav Královič, Richard Královič
      Pages 3-16
    3. Michal Hospodár, Galina Jirásková, Peter Mlynárčik
      Pages 17-32
    4. Juhani Karhumäki, Markus A. Whiteland
      Pages 49-62
    5. Jetty Kleijn, Maciej Koutny, Łukasz Mikulski, Grzegorz Rozenberg
      Pages 63-84
    6. Branislav Rovan, Šimon Sádovský
      Pages 85-99
    7. Georg Schnitger
      Pages 113-126
  3. Algorithmics

    1. Front Matter
      Pages 127-127
    2. Farid Ablayev, Marat Ablayev, Kamil Khadiev, Alexander Vasiliev
      Pages 129-155
    3. Annalisa D’Andrea, Luca Forlizzi, Guido Proietti
      Pages 156-171
    4. Hans-Joachim Böckenhauer, Lucia Di Caro, Walter Unger
      Pages 172-190
    5. Kateřina Böhmová, Jérémie Chalopin, Matúš Mihalák, Guido Proietti, Peter Widmayer
      Pages 191-215
    6. Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
      Pages 216-230
    7. Elisabet Burjons, Fabian Frei, Jasmin Smula, David Wehner
      Pages 231-256
    8. Shogo Ehara, Kazuo Iwama, Junichi Teruyama
      Pages 280-296
    9. Josep Fàbrega, Xavier Muñoz
      Pages 297-310

About this book


This Festschrift volume is published in honor of Juraj Hromkovič on the occasion of his 60th birthday. Juraj Hromkovič is a leading expert in the areas of automata and complexity theory, algorithms for hard problems, and computer science education.
The contributions in this volume reflect the breadth and impact of his work. The volume contains 35 full papers related to Juraj Hromkovič’s research. They deal with various aspects of the complexity of finite automata, the information content of online problems, stability of approximation algorithms, reoptimization algorithms, computer science education, and many other topics within the fields of algorithmics and complexity theory. Moreover, the volume contains a prologue and an epilogue of laudatios from several collaborators, colleagues, and friends.


Artificial intelligence Automata theory Databases Education Finite automata Graph theory Robotics Semantics Software engineering

Editors and affiliations

  • Hans-Joachim Böckenhauer
    • 1
  • Dennis Komm
    • 2
  • Walter Unger
    • 3
  1. 1.ETH ZürichZürichSwitzerland
  2. 2.ETH ZürichZürichSwitzerland
  3. 3.RWTH Aachen UniversityAachenGermany

Bibliographic information

Industry Sectors
IT & Software
Consumer Packaged Goods
Finance, Business & Banking