Adventures Between Lower Bounds and Higher Altitudes
Redigert av Dennis Komm, Hans-Joachim Böckenhauer, Walter Unger, 2018.Del av serien Lecture Notes in Computer Science.
Essays Dedicated to Juraj Hromkovic on the Occasion of His 60th Birthday
This Festschrift volume is published in honor of Juraj Hromkovic on the occasion of his 60th birthday. Juraj Hromkovic 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 Hromkovic'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.
Ikke tilgjengelig for Klikk&Hent
Midlertidig tomt på lager
Bestillingsvare. Forventes sendt om ca 20 dager
Adventures Between Lower Bounds and Higher Altitudes
Redigert av Dennis Komm, Hans-Joachim Böckenhauer, Walter Unger, 2018.Del av serien Lecture Notes in Computer Science.
Essays Dedicated to Juraj Hromkovic on the Occasion of His 60th Birthday
This Festschrift volume is published in honor of Juraj Hromkovic on the occasion of his 60th birthday. Juraj Hromkovic 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 Hromkovic'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.
Ikke tilgjengelig for Klikk&Hent
Midlertidig tomt på lager
Bestillingsvare. Forventes sendt om ca 20 dager
Ved å fullføre kjøpet aksepterer du kjøpsvilkårene.
