Format:
Online-Ressource (XXIV, 642 p. 134 illus, online resource)
ISBN:
9783319983554
Series Statement:
Theoretical Computer Science and General Issues 11011
Content:
Automata and Formal Languages -- Algorithmics -- Computer Science Education.
Content:
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.
Additional Edition:
ISBN 9783319983547
Additional Edition:
Erscheint auch als Druck-Ausgabe ISBN 978-3-319-98354-7
Additional Edition:
Erscheint auch als Druck-Ausgabe Adventures between lower bounds and higher altitudes Cham : Springer, 2018 ISBN 9783319983547
Language:
English
Subjects:
Computer Science
Keywords:
Algorithmus
;
Komplexität
;
Festschrift
DOI:
10.1007/978-3-319-98355-4
URL:
Volltext
(lizenzpflichtig)
Author information:
Böckenhauer, Hans-Joachim 1970-
Bookmarklink
