Algorithms, Complexity, Optimisation group photo

Algorithms, complexity theory & optimisation

The question “What can be (efficiently) automated?” is one of the most inspiring philosophical and practical questions. The group is led by Professor Igor Potapov.

This group works on fundamental questions about what can be computed in principle (computability theory) and what amount of computational resources such as time and space are required to perform those computations (computational complexity theory), together with the broad area of algorithms and optimisation and their applications.

The algorithms section is involved in a state of the art software lab, in cooperation with the School of Electrical Engineering, Electronics and Computer Science initiative NeST (Network Sciences and Technologies). The lab is equipped with several servers, several software platforms, a network of tiny devices (arduinos) and several high-speed connections. The lab aims to apply algorithms to create modern and efficient software and has already produced some software products in cooperation with local industry.  

People

Academic staff members of this group are:

PhD Students

Research students active within the group are:

  • Duncan Adamson
  • Emmanouil Bakopoulos
  • Matthew Connor
  • Martin Guest
  • Richard Klima
  • Elektra Kypridemou
  • Jaroslaw Mirek
  • Marco Mosca
  • Grzegorz Muszynski
  • George Skretas
  • Philip Smith
  • Emese Thamo
  • Michail Theofilatos
  • Nan Zhi
  • Theofilos Triommatis
  • Antonia Tsili

Back to: Department Of Computer Science