default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID60th Birthday: Ronald V. Book, 1997
- Ding-Zhu Du, Ker-I Ko:
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. Advances in Algorithms, Languages, and Complexity 1997: 1-51 - José L. Balcázar, Josep Díaz, Ricard Gavaldà:
Algorithms for Learning Finite Automata from Queries: A Unified View. Advances in Algorithms, Languages, and Complexity 1997: 53-72 - José L. Balcázar, Ricard Gavaldà, Osamu Watanabe:
Coding Complexity: The Computational Complexity of Succinct Descriptions. Advances in Algorithms, Languages, and Complexity 1997: 73-91 - Franz-Josef Brandenburg:
Homomorphic Representations of Certain Classes of Languages. Advances in Algorithms, Languages, and Complexity 1997: 93-110 - Helmut Jürgensen, Kai Salomaa:
Block-Synchronization Context-Free Grammars. Advances in Algorithms, Languages, and Complexity 1997: 111-137 - Johannes Köbler, Uwe Schöning:
High Sets for NP. Advances in Algorithms, Languages, and Complexity 1997: 139-156 - Ming Li, Paul M. B. Vitányi:
Average-Case Analysis Using Kolmogorov Complexity. Advances in Algorithms, Languages, and Complexity 1997: 157-169 - Amy K. Lorentz, Jack H. Lutz:
Genericity and Randomness over Feasible Probability Measures. Advances in Algorithms, Languages, and Complexity 1997: 171-187 - Robert McNaughton:
Book's Impact on the Theory of Thue Systems - Abstract. Advances in Algorithms, Languages, and Complexity 1997: 189-190 - Dieter van Melkebeek, Mitsunori Ogihara:
Sparse Hard Sets for P. Advances in Algorithms, Languages, and Complexity 1997: 191-208 - Pekka Orponen:
A Survey of Continous-Time Computation Theory. Advances in Algorithms, Languages, and Complexity 1997: 209-224 - Friedrich Otto, Yuji Kobayashi:
Properties of Monoids That Are Presented by Finite Convergent String-Rewriting Systems - A Survey. Advances in Algorithms, Languages, and Complexity 1997: 225-266 - Eljas Soisalon-Soininen, Peter Widmayer:
Relaxed Balancing in Search Trees. Advances in Algorithms, Languages, and Complexity 1997: 267-283 - Heribert Vollmer, Klaus W. Wagner:
Measure One Results in Computational Complexity Theory. Advances in Algorithms, Languages, and Complexity 1997: 285-312 - Jie Wang:
Average-Case Intractable NP Problems. Advances in Algorithms, Languages, and Complexity 1997: 313-378 - Peng-Jun Wan, Feng Cao:
Multichannel Lightwave Networks. Advances in Algorithms, Languages, and Complexity 1997: 379-396
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-08 20:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
