Theoretical Computer Science, Volume 76

Volume 76, Number 1, 1990

• Anthony J. Bonner: Hypothetical Datalog: Complexity and Expressibility. 3-51 , preliminary version: ICDT 1988: 144-160
• Atsushi Ohori: Semantics of Types for Database Objects. 53-91 , preliminary version: ICDT 1988: 239-251
• Dino Karabeg, Victor Vianu: Parallel Update Transactions. 93-114 , preliminary version: ICDT 1988: 307-321
• Udo W. Lipeck: Transformation of Dynamic Integrity Constraints into Transaction Specifications. 115-142 , preliminary version: ICDT 1988: 322-337
• Guozhu Dong, Seymour Ginsburg: On the Decomposition of Datalog Program Mappings. 143-177 , preliminary version: ICDT 1988: 87-101

Volume 76, Numbers 2-3, 1990

• Joost N. Kok, Jan J. M. M. Rutten: Contractions in Comparing Concurrency Semantics. 179-222
• Yasubumi Sakakibara: Learning Context-Free Grammars from Structural Data in Polynomial Time. 223-242
• Erick Timmerman: The Three Subfamilies of Rational omega-Languages Closed under omega-Transduction. 243-250
• Pascal Weil: Products of Languages with Counter. 251-260
• S. Tirri: The Congruence Theory of Closure Properties of Regular Tree Languages. 261-271
• Kosaburo Hashiguchi, H. Yoo: Extended Regular Expressions of Star Degree at Most Two. 273-284
• Antoine Petit: Distribution and Synchronized Automata. 285-308
• S. Yamasaki: Recursion Equation Sets Computing Logic Programs. 309-322
• Tao Jiang: On the Complexity of 1-Tape ATMs and Off-line 1-Tape ATMs Running in Constant Reversals. 323-330
• Ethan Gannett, Suresh C. Kothari, Hsu-Chun Yen: On Optimal Parallelization of Sorting Networks. 331-341
• R. Sarnath, Xin He: A P-Complete Graph Partition Problem. 343-351