Advances in Algorithms, Languages, and Complexity

  • Ding-Zhu Du
  • Ker-I Ko

Table of contents

  1. Front Matter
    Pages i-xxxiv
  2. J. Avenhaus, K. Madlener
    Pages 1-51
  3. José L. Balcázar, Josep Díaz, Ricard Gavaldà, Osamu Watanabe
    Pages 53-72
  4. José L. Balcázar, Ricard Gavaldà, Osamu Watanabe
    Pages 73-91
  5. Helmut Jürgensen, Kai Salomaa
    Pages 111-137
  6. Johannes Köbler, Uwe Schöning
    Pages 139-156
  7. Ming Li, Paul Vitányi
    Pages 157-169
  8. Amy K. Lorentz, Jack H. Lutz
    Pages 171-187
  9. Dieter van Melkebeek, Mitsunori Ogihara
    Pages 191-208
  10. Eljas Soisalon-Soininen, Peter Widmayer
    Pages 267-283
  11. Heribert Vollmer, Klaus W. Wagner
    Pages 285-312
  12. Jie Wang
    Pages 313-378
  13. Peng-Jun Wan, Feng Cao
    Pages 379-396

About this book


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.


algorithms automata complexity complexity theory computation computational complexity computer science grammars Kolmogorov complexity mathematics Monoid network randomness theorem proving theoretical computer science

Editors and affiliations

  • Ding-Zhu Du
    • 1
  • Ker-I Ko
    • 2
  1. 1.University of MinnesotaUSA
  2. 2.State University of New YorkStony BrookUSA

Bibliographic information