Office of Academic Resources
Chulalongkorn University
Chulalongkorn University

Home / Help

TitleAdvances in Algorithms, Languages, and Complexity [electronic resource] / edited by Ding-Zhu Du, Ker-I Ko
ImprintBoston, MA : Springer US, 1997
Connect tohttp://dx.doi.org/10.1007/978-1-4613-3394-4
Descript XXXIV, 396 p. online resource

SUMMARY

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


CONTENT

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โ{128}{153}s Impact on the Theory of Thue Systems โ{128}{148} 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 โ{128}{148} A Survey -- Relaxed Balancing in Search Trees -- Measure One Results in Computational Complexity Theory -- Average-Case Intractable NP Problems -- Multichannel Lightwave Networks


Mathematics Computers Group theory Algorithms Mathematics Algorithms Theory of Computation Group Theory and Generalizations



Location



Office of Academic Resources, Chulalongkorn University, Phayathai Rd. Pathumwan Bangkok 10330 Thailand

Contact Us

Tel. 0-2218-2929,
0-2218-2927 (Library Service)
0-2218-2903 (Administrative Division)
Fax. 0-2215-3617, 0-2218-2907

Social Network

  line

facebook   instragram