Teaching

Computability, Complexity and Algorithms (Undergraduate)

A theoretical course, which concerned with the theoretical core of Computer Science. The course covers some of the most successful algorithms as well as some of the most central decision problems. A large part of the course will focus on the NP versus P problem as well as other famous unsolved problem in Computer Science. To understand this problem we consider the issue of how one programming problem can be disguised as another apparently very different problem. This idea is very important in designing algorithms and plays a crucial role in the theory of NP-completeness.

Logic and Discrete Structures (Undergraduate)

The module consists of two parts, each of fundamental importance for any serious approach to Computer Science: Logic and Discrete Structures. Logic has been called the Calculus of Computer Science. It plays a very important role in computer architecture (logic gates), software engineering (specification and verification), programming languages (semantics, logic programming), databases (relational algebra and SQL the standard computer language for accessing and manipulating databases), artificial intelligence (automatic theorem proving), algorithms (complexity and expressiveness), and theory of computation (general notions of computability). Computer scientists use Discrete Mathematics to think about their subject and to communicate their ideas independently of particular computers and programs. They expect other computer scientists to be fluent in the language and methods of Discrete Mathematics. In the module we consider Propositional logic as well as Predicate Calculus. We will treat Propositional Logic and Predicate Calculus as formal systems. You will learn how to produce and annotate formal proofs. As application we will briefly consider the programming language Prolog. This module will also cover a variety of standard representations, operations, properties, constructions and applications associated with selected structures from Discrete Mathematics (sets, relations, functions, directed graphs, orders).

Research

Research Interests:

Publications

• Baber R, Christofides D, Dang AN et al. (2016). Graph Guessing Games and Non-Shannon Information Inequalities. nameOfConference

  10.1109/TIT.2016.2628819

  http://qmro.qmul.ac.uk/xmlui/handle/123456789/11052
• Gadouleau M, Riis S (2015). Memoryless computation: New results, constructions, and extensions. nameOfConference

  10.1016/j.tcs.2014.09.040

  http://qmro.qmul.ac.uk/xmlui/handle/123456789/11879
• Riis S, Martin U, Woodhouse N (2015). Ada Lovelace, a scientist in the archives.. nameOfConference

  10.1145/2867731.2867747

  qmroHref
• Gadouleau M, Richard A, Riis S (2015). FIXED POINTS OF BOOLEAN NETWORKS, GUESSING GRAPHS, AND CODING THEORY. nameOfConference

  10.1137/140988358

  http://qmro.qmul.ac.uk/xmlui/handle/123456789/25117
• Riis S (2014). What makes a chess program original? Revisiting the Rybka case. nameOfConference

  10.1016/j.entcom.2014.04.004

  http://qmro.qmul.ac.uk/xmlui/handle/123456789/11880
• Cameron PJ, Dang NA, Riis S (2014). Guessing Games on Triangle-free Graphs.. nameOfConference

  doi

  http://qmro.qmul.ac.uk/xmlui/handle/123456789/11893
• RIIS SM, Barber, R, Christofides, D et al. (2013). Multiple unicasts, graph guessing games, and non-Shannon inequalities. 2013 International Symposium on Network Coding (NetCod)

  10.1109/NetCod.2013.6570823

  qmroHref
• Williams H, McOwan P, Riis S (2012). Making magic: applying artificial intelligence methods to design a psychophysically compelling illusion. nameOfConference

  doi

  qmroHref
• RIIS SM, Gadouleau M (2011). Graph theoretical constructions for Graph Entropy and Network Coding Based Communications. nameOfConference

  10.1109/TIT.2011.2155618

  http://qmro.qmul.ac.uk/xmlui/handle/123456789/22923
• Cameron PJ, Gadouleau M, Riis S (2011). Combinatorial representations. nameOfConference

  10.1016/j.jcta.2012.12.002

  http://qmro.qmul.ac.uk/xmlui/handle/123456789/3153
• RIIS SM, Gadouleau M (2011). Network Coding Theorem for Dynamic Communication Networks. Network Coding (NetCod), 2011 International Symposium

  10.1109/ISNETCOD.2011.5979085

  qmroHref
• Riis S, Gadouleau M, IEEE (2011). A Dispersion Theorem for Communication Networks Based on Term Sets. nameOfConference

  10.1109/ISIT.2011.6034198

  qmroHref
• Gadouleau M, Riis S (2011). Computing without memory. nameOfConference

  doi

  qmroHref
• Gadouleau M, Riis S, IEEE (2011). Max-Flow Min-Cut Theorem for Renyi Entropy in Communication Networks. nameOfConference

  doi

  qmroHref
• Gadouleau M, Riis S (2010). Graph-theoretical Constructions for Graph Entropy and Network Coding Based Communications. nameOfConference

  doi

  qmroHref
• Gadouleau M, Riis S (2010). Max-Flow Min-Cut Theorems for Communication Networks Based on Equational Logic. nameOfConference

  doi

  http://qmro.qmul.ac.uk/xmlui/handle/123456789/3199
• Wu T, Cameron P, Riis S (2009). On the guessing number of shift graphs. nameOfConference

  10.1016/j.jda.2008.09.009

  qmroHref
• RIIS SM (2009). On the asymptotic Nullstellensatz and Polynomial Calculus proof complexity. nameOfConference

  doi

  qmroHref
• Riis S (2008). On the asymptotic Nullstellensatz and Polynomial calculus proof complexity. nameOfConference

  10.1109/LICS.2008.30

  qmroHref
• RIIS SM (2007). "Graph Entropy, Network Coding and Guessing games". nameOfConference

  doi

  http://qmro.qmul.ac.uk/xmlui/handle/123456789/3110
• Riis S (2007). Reversible and irreversible information networks. nameOfConference

  10.1109/TIT.2007.907345

  qmroHref
• Riis S (2007). Information flows, graphs and their guessing numbers. nameOfConference

  doi

  qmroHref
• Riis S (2006). Information flows, graphs and their guessing numbers. nameOfConference

  doi

  qmroHref
• Riis S, Ahlswede R (2006). Problems in network coding and error correcting codes appended by a draft version of S Riis "utilising public information in network coding". nameOfConference

  doi

  qmroHref
• RIIS SM (2004). Linear versus non-linear Boolean functions in Network Flow. 38th Annual Conference on Information Sciences and Systems (CISS)

  doi

  qmroHref
• Dantchev SS, Riis S (2003). On Relativisation and Complexity Gap.. nameOfConference

  doi

  qmroHref
• Dantchev S, Riis S (2003). On relativisation and complexity gap for resolution-based proof systems. nameOfConference

  doi

  qmroHref
• Riis S, Sitharam M (2001). Uniformly generated submodules of permutation modules - Over fields of characteristic 0. nameOfConference

  10.1016/S0022-4049(00)00069-4

  qmroHref
• Dantchev S, Riis S (2001). "Planar" tautologies hard for Resolution. nameOfConference

  10.1109/SFCS.2001.959896

  qmroHref
• Riis S (2001). A complexity gap for tree resolution. nameOfConference

  10.1007/s00037-001-8194-y

  qmroHref
• Dantchev S, Riis S (2000). Tree resolution proofs of the weak Pigeon-Hole Principle. nameOfConference

  10.1109/CCC.2001.933873

  qmroHref