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: 2011 | 2010 | 2008 | 2005 | 2002
Number of items: 7.

2011

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.

2010

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.

2008

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

2005

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

2002

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 Wed Nov 26 21:46:50 2014 GMT.

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340   general-enquiries@open.ac.uk