Skip to content

Research at St Andrews

Stephen Alexander Linton

Person

  1. Published

    Formal Methods for Extensions to CAS

    Dunstan, MN., Kelsey, T. W., Linton, S. A. & Martin, U., 1999, Proceedings of Formal Methods 1999. Springer-Verlag, p. 1758-1777 (Lecture Notes in Computer Science; vol. 1709).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  2. Published

    Lightweight Formal Methods for Computer Algebra Systems

    Martin, U. H. M., Dunstan, MN., Kelsey, T. W. & Linton, S. A., 1998, Proceedings of the International Symposium on Symbolic and Algebraic Computation. ACM, p. 80-87 8 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  3. Published

    An efficient programming model for memory-intensive recursive algorithms using parallel disks

    Slavici, V., Kunkle, D., Cooperman, G. & Linton, S. A., 2012, ISSAC 2012: Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation . New York: ACM, p. 327-334 8 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  4. Published

    Casimir forces for inhomogeneous planar media

    Xiong, C., Kelsey, T., Linton, S. A. & Leonhardt, U., 25 Jan 2013, Journal of Physics: Conference Series. 1 ed. Vol. 401. 6 p. (Journal of Physics: Conference Series; vol. 410, no. 1).

    Research output: Chapter in Book/Report/Conference proceedingChapter

  5. Published

    Conditional symmetry breaking

    Gent, I. P., Kelsey, T., Linton, S. A., McDonald, I., Miguel, I. & Smith, B. M., Oct 2005, Principles and practice of constraint programming--CP 2005: 11th international conference, CP 2005, Sitges, Spain, October 1-5, 2005 : Proceedings . Van Beek, P. (ed.). Springer, p. 256-270 15 p. (Lecture notes in computer science; vol. 3709).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  6. Published

    Constructive Recognition of a Black Box Group Isomorphic to GL(n,2)

    Cooperman, G., Finkelstein, L. & Linton, S. A., 1997, Groups and Computation II (New Brunswick, NJ, 1995), vol 28. Finkelstein, L. & Kantor, W. (eds.). American Mathematical Society, p. 85-100

    Research output: Chapter in Book/Report/Conference proceedingChapter

  7. Published

    Easy composition of symbolic computation software: a new lingua franca for symbolic computation

    Linton, S., Hammond, K., Konovalov, A., Al Zain, A. D., Trinder, P., Horn, P. & Roozemond, D., 2010, Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation. ACM, p. 339-346 8 p. (ISSAC '10).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  8. Published

    Equivalence relations of permutations generated by constrained transpositions

    Linton, S., Propp, J., Roby, T. & West, J., 2010, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010). Nancy: Assoc. Discrete Math. Theor. Comput. Sci., Nancy, p. 909-920 12 p. (Discrete Math. Theor. Comput. Sci. Proc., AN).

    Research output: Chapter in Book/Report/Conference proceedingOther contribution

  9. Published

    GAPLex: Generalised Static Symmetry Breaking

    Jefferson, C. A., Kelsey, T. W., Linton, S. A. & Petrie, K., 2007, Trends in Constraint Programming. Benhamou, F., Jussien, N. & O'Sullivan, B. (eds.). ISTE, p. 187-201

    Research output: Chapter in Book/Report/Conference proceedingChapter

  10. Published

    Generalizations of the Todd-Coxeter Algorithm

    Linton, S. A., 1995, Computational Algebra and Number Theory (Sydney, 1992). Kluwer, p. 29-51

    Research output: Chapter in Book/Report/Conference proceedingChapter

Previous 1 2 3 Next
Top