School of EECS

Søren Riis

Reader in Computer Science

Portrait photo of Søren Riis

I am a Reader in Computer Science in the School of Electronic Engineering and Computer Science (EECS), Queen Mary University of London.

Affiliation
Centre for Fundamentals of AI and Computational Theory · Theory Group
Email
s.riis@qmul.ac.uk
Office
Peter Landin Building, Mile End Campus
CV (HTML) CV (PDF) Featured paper Featured video Research demos (6) Google Scholar DBLP ORCID LinkedIn

Featured work

Drift and selection in LLM text ecosystems

A new preprint on recursive public text environments, separating neutral drift from normative selection, with direct links to the paper and video overview.

Read the preprint (PDF) Watch the video

This paper also appears below in the preprint list.

About

My research focuses on the foundations of computer science, particularly the interplay between logic, complexity theory, and algorithms. I am interested in understanding fundamental limits of computation and the structure of mathematical proofs.

This page is designed to be easy to extend: add new sections, links to slides, videos, project pages, etc. (You can search for “TODO” in the HTML to find the main extension points.)

Research

Research interests

Logic and Proof Complexity Computational Complexity Algorithms and Combinatorics Foundations of Computer Science

Current projects

  • Information about current projects and collaborations.

Selected research demos

Interactive demonstrations and teaching tools.

Publications

Full publication list: DBLP · Google Scholar

Recent unpublished preprints

All publications

The list below is loaded from DBLP (with light de-duplication of preprint/journal variants).

  1. Loading…

Teaching

I teach undergraduate and postgraduate modules at Queen Mary University of London.

  • ECS407U: Introduction to Logic and discrete Structures
  • ECS651U: Complexity and Computation

Talks & presentations

I plan to add slides and recordings here (seminar talks, conference presentations, teaching videos, etc.).

2020s

  • Coin racing and waiting-time paradoxes: why fair coins are exceptional
    DIMAP Seminar, University of Warwick – 26 Jan 2026
    Slides (PDF)

2010s

  • Ada Lovelace, a scientist in the archives
    Ada Lovelace 200 Symposium, University of Oxford – 9 Dec 2015
    Video
  • Graph guessing games and non-Shannon information inequalities
    Workshop on Entropy and Information Inequalities, CUHK – 17 Apr 2013
    Video link forthcoming.
  • Network Coding with Distributed Coding Functions
    CUHK EECS Seminar – 12 Apr 2013
    Video link forthcoming.
  • Valiant’s Shift Problem
    Isaac Newton Institute, Cambridge – 9 May 2012
    Video
  • A logician’s approach to Network Coding
    Isaac Newton Institute, Cambridge – 10 Feb 2012
    Video

2000s

  • Graph Entropy, Network Coding and Guessing Games
    ZiF Workshop, Bielefeld – Nov 2012
    No slides or video available

1990s

  • More on the relative strength of counting principles
    DIMACS Workshop, Rutgers University – May 1996
  • Complexity Gaps for Unsatisfiability Problems
    BRICS Seminar, Aarhus – 14 Dec 1998
  • Complexity Gaps for Nullstellensatz Proofs
    Fields Institute Workshop, Toronto – 1998

Henri Poincaré Institute (2016)

Contact

Email: s.riis@qmul.ac.uk
Office: Peter Landin Building, Mile End Campus
Address: Queen Mary University of London, Mile End Road, London E1 4NS, UK