Theoretical Computer Science, Volume 165

Volume 165, Number 1, 30 September 1996

Michel Bidoit, Rolf Hennicker:
Behavioural Theories and the Proof of Behavioural Properties. 3-55
Michael Codish, Grigory Mashevitzky:
Proving Implications by Algebraic Approximation. 57-74
Sergio Antoy, Aart Middeldorp:
A Sequential Reduction Strategy. 75-95
Bernhard Gramlich:
On Termination and Confluence Properties of Disjoint and Constructor-Sharing Conditional Rewrite Systems. 97-131
María Alpuente, Moreno Falaschi, Germán Vidal:
A Compositional Semantic Basis for the Analysis of Equational Horn Programs. 133-169
Frank Teusink:
Three-Valued Completion for Abductive Logic Programs. 171-200
Dale Miller:
Forum: A Multiple-Conclusion Specification Logic. 201-232

Campbell Fraser:
Consistent Subsequences and Supersequences. 233-246
Françoise Maurin:
Exact Complexity Bounds for Ordinal Addition. 247-273
Laurent Pélecq:
Automorphism Groups of Context-Free Graphs. 275-293
Valérie Berthé:
Fréquences des facteurs des suites sturmiennes. 295-309
J. Ian Munro, Venkatesh Raman:
Selection from Read-Only Memory and Sorting with Minimum Data Movement. 311-323
Michelle Morcrette:
Sur l'équivalence de descriptions de figures itérées. 325-354
Sulekha R. Kulkarni, Priti Shankar:
Linear Time Parsers for Classes of Non Context Free Languages. 355-390
Michel Habib, Lhouari Nourine:
Tree Structure for Distributive Lattices and its Applications. 391-405
Carlo Blundo, Antonella Cresti, Alfredo De Santis, Ugo Vaccaro:
Fully Dynamic Secret Sharing Schemes. 407-440
Vincenzo Auletta, Domenico Parente, Giuseppe Persiano:
Dynamic and Static Algorithms for Optimal Placement of Resources in a Tree. 441-461
Sorina Dumitrescu:
Nonreturning PC Grammar Systems Can Be Simulated By Returning Systems. 463-474
Katsunobu Imai, Kenichi Morita:
Firing Squad Synchronization Problem in Reversible Cellular Automata. 475-482
Valentin E. Brimkov, Bruno Codenotti, Mauro Leoncini, Giovanni Resta:
Strong NP-Completeness of a Matrix Similarity Problem. 483-490