Dr Soren Riis
Reader
Email: s.riis@qmul.ac.uk
Telephone: +44 20 7882 6284
Room Number: Peter Landin, CS 420
Website: http://www.eecs.qmul.ac.uk/~smriis
Office Hours: Monday 11:3013:00, Thursday 11:3013:00
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 NPcompleteness.
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:
Mathematical Logic, Complexity Theory, Proof Complexity, Algebraic Proof Complexity, Information Theory, Network Coding, Combinatorics and Reinforced Learning.Publications

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

Gadouleau M, Riis S (2015). Memoryless computation: New results, constructions, and extensions. nameOfConference

Riis S, Martin U, Woodhouse N (2015). Ada Lovelace, a scientist in the archives.. nameOfConference

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

Riis S (2014). What makes a chess program original? Revisiting the Rybka case. nameOfConference

Cameron PJ, Dang NA, Riis S (2014). Guessing Games on Trianglefree Graphs.. nameOfConference

RIIS SM, Barber, R, Christofides, D et al. (2013). Multiple unicasts, graph guessing games, and nonShannon inequalities. 2013 International Symposium on Network Coding (NetCod)

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

Cameron PJ, Gadouleau M, Riis S (2011). Combinatorial representations. nameOfConference

RIIS SM, Gadouleau M (2011). Network Coding Theorem for Dynamic Communication Networks. Network Coding (NetCod), 2011 International Symposium

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

Gadouleau M, Riis S (2010). MaxFlow MinCut Theorems for Communication Networks Based on Equational Logic. nameOfConference

Wu T, Cameron P, Riis S (2009). On the guessing number of shift graphs. nameOfConference

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

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

Riis S (2007). Reversible and irreversible information networks. nameOfConference

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

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

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

Dantchev S, Riis S (2000). Tree resolution proofs of the weak PigeonHole Principle. nameOfConference