60. Birthday: Ronald V. Book, 1997

Ding-Zhu Du, Ker-I Ko (Eds.): Advances in Algorithms, Languages, and Complexity - In Honor of Ronald V. Book. Kluwer, 1997, ISBN 0-7923-4396-4

Jürgen Avenhaus, Klaus Madlener: Theorem Proving in Hierarchical Causal Specifications. 1-51 BibTeX
José L. Balcázar, Josep Díaz, Ricard Gavaldà: Algorithms for Learning Finite Automata from Queries: A Unified View. 53-72 BibTeX
José L. Balcázar, Ricard Gavaldà, Osamu Watanabe: Coding Complexity: The Computational Complexity of Succinct Descriptions. 73-91 BibTeX
Franz-Josef Brandenburg: Homomorphic Representations of Certain Classes of Languages. 93-110 BibTeX
Helmut Jürgensen, Kai Salomaa: Block-Synchronization Context-Free Grammars. 111-137 BibTeX
Johannes Köbler, Uwe Schöning: High Sets for NP. 139-156 BibTeX
Ming Li, Paul M. B. Vitányi: Average-Case Analysis Using Kolmogorov Complexity. 157-169 BibTeX
Amy K. Lorentz, Jack H. Lutz: Genericity and Randomness over Feasible Probability Measures. 171-187 BibTeX
Robert McNaughton: Book's Impact on the Theory of Thue Systems - Abstract. 189-190 BibTeX
Dieter van Melkebeek, Mitsunori Ogihara: Sparse Hard Sets for P. 191-208 BibTeX
Pekka Orponen: A Survey of Continous-Time Computation Theory. 209-224 BibTeX
Friedrich Otto, Yuji Kobayashi: Properties of Monoids That Are Presented by Finite Convergent String-Rewriting Systems - A Survey. 225-266 BibTeX
Eljas Soisalon-Soininen, Peter Widmayer: Relaxed Balancing in Search Trees. 267-283 BibTeX
Heribert Vollmer, Klaus W. Wagner: Measure One Results in Computational Complexity Theory. 285-312 BibTeX
Jie Wang: Average-Case Intractable NP Problems. 313-378 BibTeX
Peng-Jun Wan, Feng Cao: Multichannel Lightwave Networks. 379-396 BibTeX