Centre for Interdisciplinary Research in Computational Algebra (CIRCA) Research

 

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.

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Recent Submissions

  • Towards semi-automatic data-type translation for parallelism in Erlang 

    Barwell, Adam David; Brown, Christopher Mark; Castro, David; Hammond, Kevin (ACM Press - Association for Computing Machinery, 2016-09-23) - Conference item
    As part of our ongoing research programme into programmer-in-the-loop parallelisation, we are studying the problem of introducing alternative data structures to support parallelism. Automated support for data structure ...

  • Cloud benchmarking for maximising performance of scientific applications 

    Varghese, Blesson; Akgun, Ozgur; Miguel, Ian James; Thai, Long Thanh; Barker, Adam David (2016) - Journal article
    How can applications be deployed on the cloud to achieve maximum performance? This question is challenging to address with the availability of a wide variety of cloud Virtual Machines (VMs) with different performance ...

  • POSIX lexing with derivatives of regular expressions (proof pearl) 

    Ausaf, Fahad; Dyckhoff, Roy; Urban, Christian (Springer, 2016) - Conference item
    Brzozowski introduced the notion of derivatives for regular expressions. They can be used for a very simple regular expression matching algorithm. Sulzmann and Lu cleverly extended this algorithm in order to deal with POSIX ...

  • Exploiting short supports for improved encoding of arbitrary constraints into SAT 

    Akgün, Özgur; Gent, Ian Philip; Jefferson, Christopher Anthony; Miguel, Ian James; Nightingale, Peter William (Springer, 2016) - Conference item
    Encoding to SAT and applying a highly efficient modern SAT solver is an increasingly popular method of solving finite-domain constraint problems. In this paper we study encodings of arbitrary constraints where unit propagation ...

  • Automatically generating streamlined constraint models with ESSENCE and CONJURE 

    Wetter, James; Akgün, Özgür; Miguel, Ian (Springer International Publishing, 2015-08-13) - Conference item
    Streamlined constraint reasoning is the addition of uninferred constraints to a constraint model to reduce the search space, while retaining at least one solution. Previously, effective streamlined models have been constructed ...

View more