| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996466368303316 |
|
|
Titolo |
Adventures Between Lower Bounds and Higher Altitudes [[electronic resource] ] : Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday / / edited by Hans-Joachim Böckenhauer, Dennis Komm, Walter Unger |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2018.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XXIV, 642 p. 134 illus.) |
|
|
|
|
|
|
Collana |
|
Theoretical Computer Science and General Issues, , 2512-2029 ; ; 11011 |
|
|
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer science |
Artificial intelligence |
Artificial intelligence—Data processing |
Computer science—Mathematics |
Discrete mathematics |
Social sciences—Data processing |
Theory of Computation |
Artificial Intelligence |
Data Science |
Discrete Mathematics in Computer Science |
Computer Application in Social and Behavioral Sciences |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
|
|
|
|
|
Nota di contenuto |
|
Automata and Formal Languages -- Algorithmics -- Computer Science Education. |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
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. |
|
|
|
|
|
| |