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 5
First order in Ludics
-
- Published online by Cambridge University Press:
- 17 March 2004, pp. 189-213
-
- Article
- Export citation
- Cited by 5
Simply typed fixpoint calculus and collapsible pushdown automata
-
- Published online by Cambridge University Press:
- 18 March 2015, pp. 1304-1350
-
- Article
- Export citation
- Cited by 5
Least fixpoints of endofunctors of cartesian closed categories
-
- Published online by Cambridge University Press:
- 04 March 2009, pp. 229-257
-
- Article
- Export citation
- Cited by 5
A proof-irrelevant model of Martin-Löf's logical framework
-
- Published online by Cambridge University Press:
- 17 January 2003, pp. 771-795
-
- Article
- Export citation
- Cited by 5
Petri nets based on Lawvere theories
-
- Published online by Cambridge University Press:
- 09 November 2020, pp. 833-864
-
- Article
-
- You have access
- Open access
- Export citation
- Cited by 5
On the status of perturbation theory
-
- Published online by Cambridge University Press:
- 01 April 2007, pp. 277-288
-
- Article
- Export citation
- Cited by 5
Non-cupping, measure and computably enumerable splittings
-
- Published online by Cambridge University Press:
- 01 February 2009, pp. 25-43
-
- Article
- Export citation
- Cited by 5
Characterizing co-NL by a group action
-
- Published online by Cambridge University Press:
- 05 December 2014, pp. 606-638
-
- Article
- Export citation
- Cited by 5
Fast circular dictionary-matching algorithm
-
- Published online by Cambridge University Press:
- 11 May 2015, pp. 143-156
-
- Article
-
- You have access
- Open access
- Export citation
- Cited by 5
Efficient algorithms for isomorphisms of simple types
-
- Published online by Cambridge University Press:
- 04 October 2005, pp. 917-957
-
- Article
- Export citation
- Cited by 5
Maurer computers for pipelined instruction processing†
-
- Published online by Cambridge University Press:
- 01 April 2008, pp. 373-409
-
- Article
- Export citation
- Cited by 5
Coinductive characterizations of applicative structures
-
- Published online by Cambridge University Press:
- 01 August 1999, pp. 403-435
-
- Article
- Export citation
- Cited by 5
A solution of the uniform word problem for ortholattices
-
- Published online by Cambridge University Press:
- 27 May 2010, pp. 625-638
-
- Article
- Export citation
- Cited by 5
A denotational semantics for the symmetric interaction combinators
-
- Published online by Cambridge University Press:
- 01 June 2007, pp. 527-562
-
- Article
- Export citation
- Cited by 5
Classical logic as limit completion
-
- Published online by Cambridge University Press:
- 28 January 2005, pp. 167-200
-
- Article
- Export citation
- Cited by 5
Quantum attacks on pseudorandom generators†
-
- Published online by Cambridge University Press:
- 20 December 2012, pp. 608-634
-
- Article
- Export citation
- Cited by 5
Breaking symmetries†
-
- Published online by Cambridge University Press:
- 12 November 2014, pp. 1054-1106
-
- Article
- Export citation
- Cited by 5
Quantifying over events in probability logic: an introduction
-
- Published online by Cambridge University Press:
- 29 June 2016, pp. 1581-1600
-
- Article
- Export citation
- Cited by 5
Property-oriented semantics of structured specifications†
-
- Published online by Cambridge University Press:
- 08 October 2013, e240205
-
- Article
- Export citation
- Cited by 5
Deciding reachability problems in Turing-complete fragments of Mobile Ambients
-
- Published online by Cambridge University Press:
- 04 December 2009, pp. 1223-1263
-
- Article
- Export citation