Theoretical Computer Science, Volume 38

Volume 38, 1985

• Marie-Paule Flé, Gérard Roucairol: Maximal Serializability of Iterated Transactions. 1-16
• Klaus Weihrauch: Type 2 Recursion Theory. 17-33
• Christoph Kreitz, Klaus Weihrauch: Theory of Representations. 35-53
• Ingo Wegener: On the Complexity of Slice Functions. 55-68
• Marc Snir: Lower Bounds on Probabilistic Linear Decision Trees. 69-82
• Prakash V. Ramanan, C. L. Liu: Permutation Representation of k-Ary Trees. 83-98
• Catriel Beeri, Moshe Y. Vardi: Formal Systems for Join Dependencies. 99-116
• Michel Leconte: A Characterization of Power-Free Morphisms. 117-122
• Do Long Van: Ensembles Code-Compatibles et une Généralisation du Théorème de Sardinas-Patterson. 123-132
• Ernst L. Leiss: Succinct Representation of Regular Languages by Boolean Automata II. 133-136
• Alain Finkel: Une Généralisation des Théorème de Higman et de Simon aux Mots Infinis. 137-142
• Diana Schmidt: The Recursion-Theoretic Structure of Complexity Classes. 143-156
• Osamu Watanabe: On One-One Polynomial Time Equivalence Relations. 157-165
• Masatosi Imori, Hisao Yamada: Periodic Character Sequences where Identifying two Characters Strictly Reduces the Period. 167-192
• Hans-Dieter Burkhard: An Investigation of Controls for Concurrent Systems Based on Abstract Control Languages. 193-222
• Matthias Jantzen: Extending Regular Expressions with Iterated Shuffle. 223-247
• Takao Asano: An Approach to the Subgraph Homeomorphism Problem. 249-267
• Bhubaneswaru Mishra, Edmund M. Clarke: Hierarchical Verification of Asynchronous Circuits Using Temporal Logic. 269-291
• Teofilo F. Gonzalez: Clustering to Minimize the Maximum Intercluster Distance. 293-306
• David Harel, David Peleg: Process Logic with Regular Formulas. 307-322
• Daniel J. Rosenkrantz, Harry B. Hunt III: Testing for Grammatical Coverings. 323-341
• Nathan Linial, Michael Tarsi: Deciding Hypergraph 2-Colourability by H-Resolution. 343-347