Shortcuts
Top of page (Alt+0)
Page content (Alt+9)
Page menu (Alt+8)
Your browser does not support javascript, some WebOpac functionallity will not be available.
.
Default
.
PageMenu
-
Main Menu
-
Simple Search
.
Advanced Search
.
Journal Search
.
Refine Search Results
.
Preferences
.
Search Menu
Simple Search
.
Advanced Search
.
New Items Search
.
Journal Search
.
Refine Search Results
.
Bottom Menu
Help
Italian
.
English
.
German
.
New Item Menu
New Items Search
.
New Items List
.
Links
SISSA Library
.
ICTP library
.
Italian National web catalog (SBN)
.
Trieste University web catalog
.
Udine University web catalog
.
© LIBERO v6.4.1sp220816
Page content
You are here
:
>
Browse Journal List
Catalogue Tag Display
Catalogue Tag Display
MARC 21
Advances in Algorithms, Languages, and Complexity
Tag
Description
020
$a9781461333944$9978-1-4613-3394-4
082
$a518.1$223
099
$aOnline resource: Springer
245
$aAdvances in Algorithms, Languages, and Complexity$h[EBook] /$cedited by Ding-Zhu Du, Ker-I Ko.
260
$aBoston, MA :$bSpringer US,$c1997.
300
$aXXXIV, 396 p.$bonline resource.
336
$atext$btxt$2rdacontent
337
$acomputer$bc$2rdamedia
338
$aonline resource$bcr$2rdacarrier
505
$a
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.
520
$a
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.
538
$aOnline access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
700
$aDu, Ding-Zhu.$eeditor.
700
$aKo, Ker-I.$eeditor.
710
$aSpringerLink (Online service)
856
$u
http://dx.doi.org/10.1007/978-1-4613-3394-4
Quick Search
Search for