Theoretical Computer Science, Volume 71

Volume 71, Number 1, 1990

Alok Aggarwal, Ashok K. Chandra, Marc Snir: Communication Complexity of PRAMs. 3-28
Karel Culik II: New Techniques for Proving the Decidability of Equivalence Problems. 29-45
Jozef Gruska: Synthesis, Structure and Power of Systolic Computations. 47-77
Juris Hartmanis: New Developments in Structural Complexity Theory. 79-93
Clyde P. Kruskal, Larry Rudolph, Marc Snir: A Complexity Theory of Efficient Parallel Algorithms. 95-132
P. S. Thiagarajan: Some Behavioural Aspects of Net Theory. 133-153
W. P. Weijland: Semantics for Logic Programs Without Occur Check. 155-174

Jean-Paul Arcangeli, Christian Pomian: Principles of Plasma Pattern and Alternative Structure Compilation. 177-191
Michel Billaud: Simple Operational and Denotational Semantics for Prolog with Cut. 193-208
Mikhail A. Bulyonkov: Mixed Computation and Compilation: New Approaches to Old Problems. 209-226
Didier Galmiche: Constructive System for Automatic Program Synthesis. 227-239
Jaan Penjam: Computational and Attribute Models of Formal Languages. 241-264
Viktor K. Sabelfeld: An Algorithm Deciding Functional Equivalence in a New Class of Program Schemes. 265-279

Géraud Sénizergues: Some Decision Problems about Controlled Rewriting Systems. 281-346
Hartmut Ehrig, Francesco Parisi-Presicce, Paul Boehm, Catharina Rieckhoff, Christian Dimitrovici, Martin Große-Rhode: Combining Data Type and Recursive Process Specifications Using Projection Algebras. 347-380
Serge Dulucq, Dominique Gouyou-Beauchamps: Sur les Facteurs des Suites de Sturm. 381-400
Alan Gibbons, Wojciech Rytter: Optimally Edge-Colouring Outerplanar Graphs is in NC. 401-411
Ernest G. Manes: A Transformational Characterization of if-then-else. 413-417
Marek Chrobak, Tomasz Szymacha, Adam Krawczyk: A Data Structure Useful for Finding Hamiltonian Cycles. 419-424
Kostas Skandalis: Non-Recursiveness of the Operations on Real Numbers. 425-429