Article

Chlebík, Miroslav and Chlebíková, Janka (2014) Connection between conjunctive capacity and structural properties of graphs. Theoretical Computer Science, 544. pp. 109-118. ISSN 0304-3975

Honda, Kohei, Yoshida, Nobuko and Berger, Martin (2014) An observationally complete program logic for imperative higher-order functions. Theoretical Computer Science, 517. pp. 75-101. ISSN 0304-3975

Mackie, Ian (2010) Gödel’s System T Revisited. Theoretical Computer Science, 411 (11-13). pp. 1484-1500. ISSN 03043975

Chlebík, Miroslav and Chlebíková, Janka (2008) The Steiner tree problem on graphs: Inapproximability results. Theoretical Computer Science, 406 (3). pp. 207-214. ISSN 0304-3975

Chlebík, Miroslav and Chlebíková, Janka (2006) Complexity of approximating bounded variants of optimization problems. Theoretical Computer Science, 354 (3). pp. 320-338. ISSN 0304-3975

Laird, James (2006) A calculus of coroutines. Theoretical Computer Science, 350 (2-3). pp. 275-291. ISSN 03043975

Laird, J (2005) Locally Boolean domains. Theoretical Computer Science, 342 (1). pp. 132-148. ISSN 03043975

Laird, James (2005) Game semantics and Linear CPS interpretation. Theoretical Computer Science, 333. pp. 199-224. ISSN 03043975

Sassone, Vladimiro and Sobocinski, Pawel (2005) Locating Reactions using 2-Categories. Theoretical Computer Science, 333 (1-2). pp. 297-327.

Jeffrey, Alan and Rathke, Julian (2005) A fully abstract may testing semantics for concurrent objects. Theoretical Computer Science, 338 (1-3). pp. 17-63. ISSN 0304-3975

Bruni, Roberto, Montanari, Ugo and Sassone, Vladimiro (2005) Observational Congruences for Dynamically Reconfigurable Tile Systems. Theoretical Computer Science, 335 (2-3). pp. 331-372.

Hennessy, Matthew, Merro, Massimo and Rathke, Julian (2004) Towards a behavioural theory of access and mobility control in distributed systems. Theoretical Computer Science, 322 (3). pp. 615-669.

Reus, Bernhard and Streicher, Thomas (2004) Semantics and logic of object calculi. Theoretical Computer Science, 316 (1-3). pp. 191-213. ISSN 0304-3975

Fernández, Maribel and Mackie, Ian (2003) Operational Equivalence for Interaction Nets. Theoretical Computer Science, 297 (1-3). pp. 157-181. ISSN 0304-3975

Ghica, Dan R and McCusker, Guy (2003) The Regular Language Semantics of Second-Order Idealized Algol. Theoretical Computer Science, 309 (1-3). pp. 469-502. ISSN 0304-3975

Pang, Jianxiong and Blair, Lynne (2003) Separating Interaction Concerns from Distributed Feature Components. Theoretical Computer Science, 82 (5). pp. 70-84. ISSN 0304-3975

Hennessy, Matthew, Merro, Massimo and Rathke, Julian (2003) Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems. Theoretical Computer Science, 322 (3). pp. 615-669.

Hennessy, Matthew (2002) A fully abstract denotational semantics for the π-calculus. Theoretical Computer Science, 278 (1-2). pp. 53-89. ISSN 0304-3975

Abramsky, Samson and McCusker, Guy (1999) Full abstraction for Idealized Algol with Passive Expressions. Theoretical Computer Science, 227. pp. 3-42.

Hennessy, M and Rathke, J (1998) Bisimulations for a calculus of broadcasting systems. Theoretical Computer Science, 200 (1-2). pp. 225-260.

Hartonas, Chrysafis and Hennessy, Matthew (1998) Full Abstractness for a Functional/Concurrent Language with Higher-Order Value-Passing. Theoretical Computer Science, 145. pp. 64-106.

Sassone, Vladimiro (1996) An Axiomatization of the Algebra of Petri Net Concatenable Processes. Theoretical Computer Science, 170 (1-2). pp. 277-296. ISSN 03043975

Sassone, Vladimiro, Nielsen, Mogens and Winskel, Glynn (1996) Models for concurrency: Towards a Classification. Theoretical Computer Science, 170 (1-2). pp. 297-348.

Meseguer, José, Montanari, Ugo and Sassone, Vladimiro (1996) Process versus Unfolding Semantics for Place/Transition Petri Nets. Theoretical Computer Science, 153(1-. pp. 171-219. ISSN 0304-3975

Weir, David (1992) A geometric hierarchy beyond context-free languages. Theoretical Computer Science, 104 (2). pp. 235-261. ISSN 0304-3975