Theoretical Computer Science

Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.

journal containing

 On the Expressive Power of KLAIM-based Calculi (2006) — Rocco De Nicola, Daniele Gorla, Rosario Pugliese

 Quantitative Information in the Tuple Space Coordination Model (2005) — Mario Bravetti, Roberto Gorrieri, Roberto Lucchi, Gianluigi Zavattaro

 A brief history of process algebra (2005) — Jos C.M. Baeten

 A process algebraic view of Linda coordination primitives (1998) — Nadia Busi, Roberto Gorrieri, Gianluigi Zavattaro

 The Chemical Abstract Machine (1992) — Gérard Berry, Gérard Boudol

 Linear logic (1987) — Jean-Yves Girard

 Automatic inductive theorem proving using Prolog (1987) — Jieh Hsiang, Mandayam Srivas

 Algebra of communicating processes with abstraction (1985) — Jan A. Bergstra, Jan Willem Klop

 The Euclidean travelling salesman problem is NP-complete (1977) — Christos H. Papadimitriou