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

  • Single-handed interaction techniques for mobile and wearable computing 

    Yeo, Hui Shyong (University of St Andrews, 2021-06-30) - Thesis
    The past decade has seen the proliferation of mobile and wearable computing devices into our everyday life. Such devices are now used throughout the day for both productivity and entertainment purposes. As a result, it ...
  • Computing normalisers of highly intransitive groups 

    Chang, Mun See (University of St Andrews, 2021-06-30) - Thesis
    We investigate the normaliser problem, that is, given 𝐺, 𝐻 ≤ 𝑆ₙ, compute 𝑁[sub]𝐺(𝐻). The fastest known theoretical algorithm for this problem is simply exponential, but more efficient algorithms are known for some ...
  • Hidden Markov models with variational inference in marketing science 

    Danielson, Matthew (University of St Andrews, 2021-06-30) - Thesis
    Hidden Markov Models (HMMs) are a well known type of model for many varieties of sequen- tial data. There exist several algorithms for learning HMMs: a variant of an expectation- maximization (EM) algorithm known as the ...
  • A grey-box approach to benchmarking and performance modelling of data-intensive applications 

    Ceesay, Sheriffo (University of St Andrews, 2021-06-30) - Thesis
    The advent of big data about a decade ago, coupled with its processing and storage challenges gave rise to the development of a multitude of data-intensive frameworks. These distributed parallel processing frameworks can ...
  • A more effective use of information in search for quantified Boolean formulae 

    Rowley, Andrew G. D. (University of St Andrews, 2006) - Thesis
    The solving of Quantified Boolean Formulae (QBFs) has recently become of great interest. QBFs are an extension of the Satisfiability problem (SAT), which has been studied in depth. Many QBF techniques are built as extensions ...

View more