+612 9045 4394
 
CHECKOUT
Advances in Algorithms, Languages, and Complexity - Ding-Zhu Du

Advances in Algorithms, Languages, and Complexity

By: Ding-Zhu Du (Editor), Ker-I Ko (Editor)

Hardcover

Published: 28th February 1997
Ships: 7 to 10 business days
7 to 10 business days
RRP $892.99
$618.35
31%
OFF
or 4 easy payments of $154.59 with Learn more

Other Available Formats (Hide)

  • Paperback View Product Published: 12th October 2011
    $372.80

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.

Foreword
A Summary of R.V. Book's Scientific Research. R.V. Book's Students and Postgraduate Research Fellows
List of R.V. Book's Publications
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
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
Table of Contents provided by Publisher. All Rights Reserved.

ISBN: 9780792343967
ISBN-10: 0792343964
Audience: Professional
Format: Hardcover
Language: English
Number Of Pages: 396
Published: 28th February 1997
Publisher: Springer
Country of Publication: NL
Dimensions (cm): 23.5 x 15.5  x 3.18
Weight (kg): 1.73