Most cited
This page lists all time most cited articles for this title. Please use the publication date filters on the left if you would like to restrict this list to recently published content, for example to articles published in the last three years. The number of times each article was cited is displayed to the right of its title and can be clicked to access a list of all titles this article has been cited by.
- Cited by 6
Quotients of countably based spaces are not closed under sobrification
-
- Published online by Cambridge University Press:
- 17 May 2006, pp. 223-229
-
- Article
- Export citation
- Cited by 6
Concurrent models for Linda with transactions
-
- Published online by Cambridge University Press:
- 20 May 2004, pp. 421-468
-
- Article
- Export citation
- Cited by 6
A categorical generalization of Scott domains
-
- Published online by Cambridge University Press:
- 01 October 1997, pp. 419-443
-
- Article
- Export citation
- Cited by 6
A constructive interpretation of Ramsey's theorem via the product of selection functions
-
- Published online by Cambridge University Press:
- 13 November 2014, pp. 1755-1778
-
- Article
- Export citation
- Cited by 6
Classical linear logic of implications
-
- Published online by Cambridge University Press:
- 14 March 2005, pp. 323-342
-
- Article
- Export citation
- Cited by 6
Quantum algorithms for testing and learning Boolean functions†
-
- Published online by Cambridge University Press:
- 28 February 2013, pp. 386-398
-
- Article
- Export citation
- Cited by 6
Two-level type theory and applications
-
- Published online by Cambridge University Press:
- 30 May 2023, pp. 688-743
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
- Cited by 6
Sketches and computation – I: basic definitions and static evaluation
-
- Published online by Cambridge University Press:
- 04 March 2009, pp. 185-238
-
- Article
- Export citation
- Cited by 6
A formal study of Bernstein coefficients and polynomials†
-
- Published online by Cambridge University Press:
- 01 July 2011, pp. 731-761
-
- Article
- Export citation
- Cited by 6
Event structures and non-orthogonal term graph rewriting
-
- Published online by Cambridge University Press:
- 19 April 2018, pp. 545-578
-
- Article
- Export citation
- Cited by 6
Unary automatic graphs: an algorithmic perspective
-
- Published online by Cambridge University Press:
- 01 February 2009, pp. 133-152
-
- Article
- Export citation
- Cited by 6
Computation with classical sequents
-
- Published online by Cambridge University Press:
- 01 June 2008, pp. 555-609
-
- Article
- Export citation
- Cited by 6
Formal analysis of model transformations based on triple graph grammars
-
- Published online by Cambridge University Press:
- 26 June 2014, 240408
-
- Article
- Export citation
- Cited by 6
Dynamical systems: stability and simulability
-
- Published online by Cambridge University Press:
- 01 April 2007, pp. 247-259
-
- Article
- Export citation
- Cited by 6
The representational adequacy of Hybrid
-
- Published online by Cambridge University Press:
- 30 March 2011, pp. 585-646
-
- Article
- Export citation
- Cited by 6
Type assignment and termination of interaction nets
-
- Published online by Cambridge University Press:
- 01 December 1998, pp. 593-636
-
- Article
- Export citation
- Cited by 6
String diagram rewrite theory II: Rewriting with symmetric monoidal structure
-
- Published online by Cambridge University Press:
- 29 September 2022, pp. 511-541
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
- Cited by 6
Equilibrium and termination II: the case of Petri nets
-
- Published online by Cambridge University Press:
- 28 February 2013, pp. 290-307
-
- Article
- Export citation
- Cited by 6
Abstract and behaviour module specifications
-
- Published online by Cambridge University Press:
- 01 February 1999, pp. 21-62
-
- Article
- Export citation
- Cited by 6
A simple process algebra based on atomic actions with resources
-
- Published online by Cambridge University Press:
- 03 February 2004, pp. 1-55
-
- Article
- Export citation