Advances in Algorithms, Languages, and Complexity

Ding-Zhu Du (Editor) / Ker-I Ko (Editor)

ISBN 10: 1461333962 / ISBN 13: 9781461333968

Edité par Springer, 2012

A propos de cet article

reprint edition. 432 pages. 9.45x6.30x0.99 inches. In Stock.

N° de réf. du vendeur x-1461333962

Détails bibliographiques

• Titre: Advances in Algorithms, Languages, and Complexity
• Éditeur: Springer
• Date de parution: 2012
• Langue: anglais
• ISBN à 10 chiffres: 1461333962
• ISBN à 13 chiffres: 9781461333968
• Reliure: Paperback
• État de l'article: Brand New

A propos de ce titre

Synopsis

This book contains a collection of survey papers in the areas of algorithms, lan- guages and complexity, the three areas in which Professor Ronald V. Book has made significant contributions. As a fonner student and a co-author who have been influenced by him directly, we would like to dedicate this book to Professor Ronald V. Book to honor and celebrate his sixtieth birthday. Professor Book initiated his brilliant academic career in 1958, graduating from Grinnell College with a Bachelor of Arts degree. He obtained a Master of Arts in Teaching degree in 1960 and a Master of Arts degree in 1964 both from Wesleyan University, and a Doctor of Philosophy degree from Harvard University in 1969, under the guidance of Professor Sheila A. Greibach. Professor Book's research in discrete mathematics and theoretical com- puter science is reflected in more than 150 scientific publications. These works have made a strong impact on the development of several areas of theoretical computer science. A more detailed summary of his scientific research appears in this volume separately.

Présentation de l'éditeur

This book contains a collection of sixteen survey papers on recent developments in algorithms, formal languages, and computational complexity. These are the three areas in which Professor Ronald V. Book has made significant contributions, and the objective of the editors and the contributors is to honor Professor Book on his sixtieth birthday. Audience: Researchers and graduate students with interests in design and analysis of algorithms, in language theory, and in computational complexity.