JCSS, Volume 35

Volume 35, Number 1, August 1987

Joachim Biskup, Renate Meyer: Design of Relational Database Schemes by Deleting Attributes in the Canonical Decomposition. 1-22
David Peleg: Communication in Concurrent Dynamic Logic. 23-58
Robert P. Kurshan: Complementing Deterministic Büchi Automata in Polynomial Time. 59-71
Francesco Parisi-Presicce: Union and Actualization of Module Specifications: Some Compatibility Results. 72-95
Toshimasa Watanabe, Akira Nakamura: Edge-Connectivity Augmentation Problems. 96-144

Seinosuke Toda: Sigma_2 SPACE(n) is Closed under Complement. 145-152
László Babai, Péter Hajnal, Endre Szemerédi, György Turán: A Lower Bound for Read-Once-Only Branching Programs. 153-162
Gheorghe Stefanescu: On Flowchart Theories. I. The Deterministic Case. 163-191
Michael G. Main, Grzegorz Rozenberg: Handle NLC Grammars and R.E. Languages. 192-205
Józef Winkowski, Andrea Maggiolo-Schettini: An Algebra of Processes. 206-228
Vera Trnková, Jan Reiterman: Dynamic Algebras with Test. 229-242
Jean-Michel Autebert, Luc Boasson, Géraud Sénizergues: Groups and NTS Languages. 243-267

Michael L. Fredman, Thomas H. Spencer: Refined Complexity Analysis for Heap Operations. 269-284
Friedrich Otto: On Deciding the Confluence of a Finite String-Rewriting System on a Given Congruence Class. 285-310
Joffroy Beauquier, Meera Blattner, Michel Latteux: On Commutative Context-Free Languages. 311-320
Nicole Bidoit: The Verso Algebra or How to Answer Queries with Fewer Joins. 321-364
David B. Benson, Irène Guessarian: Algebraic Solutions to Recursion Schemes. 365-400