Research Article
Signed Chip Firing Games and symmetric Sandpile Models on thecycles∗
-
- Published online by Cambridge University Press:
- 31 October 2012, pp. 133-146
-
- Article
- Export citation
Abelian periods, partial words, and an extension of a theoremof Fine and Wilf∗
-
- Published online by Cambridge University Press:
- 25 April 2013, pp. 215-234
-
- Article
- Export citation
Editorial
Preface
-
- Published online by Cambridge University Press:
- 06 December 2012, pp. 1-2
-
- Article
-
- You have access
- Export citation
Research Article
Minimal 2-dominating sets in trees∗
-
- Published online by Cambridge University Press:
- 08 July 2013, pp. 235-240
-
- Article
- Export citation
On Core XPath with Inflationary Fixed Points∗
-
- Published online by Cambridge University Press:
- 19 December 2012, pp. 3-23
-
- Article
- Export citation
On the hardness of game equivalence under localisomorphism∗
-
- Published online by Cambridge University Press:
- 05 November 2012, pp. 147-169
-
- Article
- Export citation
A tight bound for exhaustive key search attacks against MessageAuthentication Codes
-
- Published online by Cambridge University Press:
- 06 November 2012, pp. 171-180
-
- Article
- Export citation
Strong functors and interleaving fixpoints in gamesemantics∗
-
- Published online by Cambridge University Press:
- 10 January 2013, pp. 25-68
-
- Article
- Export citation
Factoring and testing primes in small space∗
-
- Published online by Cambridge University Press:
- 30 July 2013, pp. 241-259
-
- Article
- Export citation
Cutwidth of iterated caterpillars∗
-
- Published online by Cambridge University Press:
- 11 March 2013, pp. 181-193
-
- Article
- Export citation
On characteristic formulae for Event-Recording Automata∗
-
- Published online by Cambridge University Press:
- 10 January 2013, pp. 69-96
-
- Article
- Export citation
New applications of the wreath product of forest algebras∗
-
- Published online by Cambridge University Press:
- 30 July 2013, pp. 261-291
-
- Article
- Export citation
Analysis of a near-metric TSP approximation algorithm∗
-
- Published online by Cambridge University Press:
- 06 August 2013, pp. 293-314
-
- Article
- Export citation
Some results on complexity of μ-calculusevaluation in the black-box model∗
-
- Published online by Cambridge University Press:
- 10 January 2013, pp. 97-109
-
- Article
- Export citation
A note on constructing infinite binary words with polynomial subword complexity∗
-
- Published online by Cambridge University Press:
- 25 April 2013, pp. 195-199
-
- Article
- Export citation
A non-uniform finitary relational semantics of systemT∗
-
- Published online by Cambridge University Press:
- 10 January 2013, pp. 111-132
-
- Article
- Export citation
Decidability of the HD0L ultimateperiodicity problem
-
- Published online by Cambridge University Press:
- 25 April 2013, pp. 201-214
-
- Article
- Export citation