Please wait while page loads.
SISSA Library . Default .
PageMenu- Main Menu-
Page content

Catalogue Display

Advances in Algorithms, Languages, and Complexity

Advances in Algorithms, Languages, and Complexity
Catalogue Information
Field name Details
Dewey Class 518.1
Title Advances in Algorithms, Languages, and Complexity ([EBook] /) / edited by Ding-Zhu Du, Ker-I Ko.
Added Personal Name Du, Ding-Zhu editor.
Ko, Ker-I. editor.
Other name(s) SpringerLink (Online service)
Publication Boston, MA : : Springer US, , 1997.
Physical Details XXXIV, 396 p. : online resource.
ISBN 9781461333944
Summary Note 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.:
Contents note Theorem Proving in Hierarchical Clausal Specifications -- Algorithms for Learning Finite Automata from Queries: A Unified View -- Coding Complexity: The Computational Complexity of Succinct Descriptions -- Homomorphic Representations of Certain Classes of Languages -- Block-Synchronization Context-Free Grammars -- High Sets for NP -- Average-Case Analysis Using Kolmogorov Complexity -- Genericity and Randomness over Feasible Probability Measures -- Book’s Impact on the Theory of Thue Systems — Abstract -- Sparse Hard Sets for P -- A Survey of Continuous-Time Computation Theory -- Properties of Monoids That Are Presented by Finite Convergent String-Rewriting Systems — A Survey -- Relaxed Balancing in Search Trees -- Measure One Results in Computational Complexity Theory -- Average-Case Intractable NP Problems -- Multichannel Lightwave Networks.
System details note Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
Internet Site
Links to Related Works
Subject References:
Corporate Authors:
Catalogue Information 43693 Beginning of record . Catalogue Information 43693 Top of page .


This item has not been rated.    Add a Review and/or Rating43693
. E-mail This Page
Quick Search