Adventures Between Lower Bounds and Higher Altitudes [electronic resource] : Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday /

Contributor(s):

Material type: Text

TextSeries: Theoretical Computer Science and General Issues ; 11011Publisher: Cham : Springer International Publishing : Imprint: Springer, 2018Edition: 1st ed. 2018Description: XXIV, 642 p. 134 illus. online resourceContent type:

text

Media type:

computer

Carrier type:

online resource

ISBN:

9783319983554

Subject(s):

Additional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification:

004.0151 23

LOC classification:

QA75.5-76.95

Online resources:

Click here to access online

Contents:

Automata and Formal Languages -- Algorithmics -- Computer Science Education.

In: Springer Nature eBookSummary: 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.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

No physical items for this record

Automata and Formal Languages -- Algorithmics -- Computer Science Education.

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.

There are no comments on this title.

to post a comment.