All of our academic staff are research active, working with a team of post-graduate and post-doctoral researchers and a lively population of research students. Our research focuses on core themes of theoretical and practical computer science: artificial intelligence and symbolic computation, networked and distributed systems, systems engineering, and human computer interaction.

For more information please visit the School of Computer science home page.

Sub-communities within this community

Recent Submissions

  • 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 ...
  • Mobility as a first class function 

    Phoomikiatissak, D.; Bhatti, S. N. (IEEE, 2015-12-04) - Conference item
    Seamless host mobility has been a desirable feature for a long time, but was not part of the original design of the Internet architecture or protocols. Current approaches to network-layer mobility typically require additional ...
  • Client-side energy costs of video streaming 

    Ejembi, Oche; Bhatti, Saleem N. (Institute of Electrical and Electronics Engineers Inc., 2016-02-01) - Conference item
    Through measurements on our testbed, we show how users of Netflix could make energy savings of up to 34% by adjusting video quality settings. We estimate the impacts of these quality settings on the energy consumption of ...
  • HPC-GAP : engineering a 21st-century High-Performance Computer algebra system 

    Behrends, Reimer; Hammond, Kevin; Janjic, Vladimir; Konovalov, Alexander; Linton, Stephen Alexander; Loidl, Hans-Wolfgang; Maier, Patrick; Trinder, Philip (2016-09-10) - Journal article
    Symbolic computation has underpinned a number of key advances in Mathematics and Computer Science. Applications are typically large and potentially highly parallel, making them good candidates for parallel execution at a ...
  • Transition-based dependency parsing as latent-variable constituent parsing 

    Nederhof, Mark Jan (Association for Computational Linguistics, 2016-08-12) - Conference item
    We provide a theoretical argument that a common form of projective transition-based dependency parsing is less powerful than constituent parsing using latent variables. The argument is a proof that, under reasonable ...

View more