The Centre for Interdisciplinary Research in Computational Algebra (CIRCA) was established in 2000 to foster new and existing collaborative research between members of the Schools of Computer Science and of Mathematics and Statistics in the area of computational abstract algebra.

For more information please visit the Centre for Interdisciplinary Research in Computational Algebra (CIRCA) home page.

Collections in this community

Recent Submissions

  • Statistical issues in first-in-human studies on BIA 10-2474 : neglected comparison of protocol against practice 

    Bird, Sheila M.; Bailey, Rosemary A.; Grieve, Andrew P.; Senn, Stephen (2017-03-15) - Journal article
    By setting the regulatory-approved protocol for a suite of first-in-human studies on BIA 10-2474 against the subsequent French investigations, we highlight six key design and statistical issues which reinforce recommendations ...
  • Sesqui-arrays, a generalisation of triple arrays 

    Bailey, Rosemary Anne; Cameron, Peter Jephson; Nilson, Tomas (2018-02-13) - Journal article
    A triple array is a rectangular array containing letters, each letter occurring equally often with no repeats in rows or columns, such that the number of letters common to two rows, two columns, or a row and a column are ...
  • Knowledge-based interoperability for mathematical software systems 

    Kohlhase, Michael; De Feo, Luca; Müller, Dennis; Pfeiffer, Markus Johannes; Rabe, Florian; Thiéry, Nicolas; Vasilyev, Victor; Wiesing, Tom (Springer, 2017) - Conference item
    There is a large ecosystem of mathematical software systems. Individually, these are optimized for particular domains and functionalities, and together they cover many needs of practical and theoretical mathematics. However, ...
  • Type-based cost analysis for lazy functional languages 

    Jost, Steffen; Vasconcelos, Pedro; Florido, Mário; Hammond, Kevin (2017-06) - Journal article
    We present a static analysis for determining the execution costs of lazily evaluated functional languages, such as Haskell. Time- and space-behaviour of lazy functional languages can be hard to predict, creating a significant ...
  • Relations among partitions 

    Bailey, Rosemary Anne (Cambridge University Press, 2017) - Book item
    Combinatorialists often consider a balanced incomplete-block design to consist of a set of points, a set of blocks, and an incidence relation between them which satisfies certain conditions. To a statistician, such a design ...

View more