The Open UniversitySkip to content

Browse by Journal

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0 [Create Shortened URL] SURL
Group by: Published Date | Item Type | No Grouping
Jump to: 2012 | 2011 | 2010 | 2008 | 2005 | 2002
Number of items: 8.


Lladser, Manuel E.; Potočnik, Primož; Širáň, Jozef and WIlson, Mark C. (2012). Random Cayley digraphs of diameter 2 and given degree. Discrete Mathematics and Theoretical Computer Science, 14(2) pp. 83–90.


Korpelainen, Nicholas; Lozin, Vadim V.; Malyshev, Dmitriy S. and Tiskin, Alexander (2011). Boundary properties of graphs for algorithmic graph problems. Theoretical Computer Science, 412(29) pp. 3545–3554.


Duchamp, Gerard H. E.; Poinsot, Laurent; Solomon, Allan I.; Penson, Karol A.; Blasiak, Pawel and Horzela, Andrzej (2010). Ladder operators and endomorphisms in combinatorial Physics. Discrete Mathematics & Theoretical Computer Science, 12(2) pp. 23–46.

Penson, Karol A.; Blasiak, Pawel; Duchamp, Gerard H. E.; Horzela, Andrzej and Solomon, Allan I. (2010). On certain non-unique solutions of the Stieltjes moment problem. Discrete Mathematics & Theoretical Computer Science, 12(2) pp. 295–306.


Brignall, Robert; Ruškuc, Nik and Vatter, Vincent (2008). Simple permutations: Decidability and unavoidable substructures. Theoretical Computer Science, 391(1-2) pp. 150–163.


Hilton, Adrian and Hall, Jon G. (2005). Developing critical systems with PLD components. In: 10th International Workshop on Formal Methods for Safety Critical Systems, 2005, pp. 385–395.

Oliveira, Cristóvão; Wermelinger, Michel; Fiadeiro, José Luiz and Lopes, Antónia (2005). Modelling the GSM handover protocol in CommUnity. Electronic Notes in Theoretical Computer Science, 141(3) pp. 3–25. file


Hiltont, Adrian and Hall, Jon G. (2002). Refining specifications to programmable logic. Electronic Notes in Theoretical Computer Science, 70(3) pp. 385–395.

This list was generated on Tue Nov 24 21:54:28 2015 GMT.

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340