Browser does not support script.

- Information for
- Prospective students
- Current students
- Alumni
- Staff
- Businesses

- Information about
- Departments
- Institutes
- Divisions
- Research centres
- Supporting LSE
- Term dates
- LSE Vacations

The interface between Theoretical Computer Science and Discrete Mathematics has been highlighted by recent EPSRC Reviews of both disciplines as being one of increasing importance. LSE is well placed to be at the forefront of future developments. Individual faculty interests are listed below.

- Extremal and random combinatorics; in particular Ramsey theory
- Extremal (hyper)graph theory
- Extremal theorems on (quasi)random structures, and algorithmic aspects thereof

- Mathematical aspects of machine learning, particularly probabilistic modelling of learning and discrete mathematical problems in the theory of learning, data mining and artificial neural networks
- Boolean function classes and their representations

- Algorithms and theory of computation; particularly randomized computation
- Sublinear algorithms on massive data sets
- Property testing
- Computational statistics

- Extremal combinatorics
- Random and quasi-random discrete structures
- Ramsey theory
- Algorithmical and structural graph theory
- Graph colouring

- Combinatorics in general, especially finite partially ordered sets, probabilistic methods, and algorithmic aspects
- Random graphs
- Random structures

- Graph theory
- Matroid theory
- Applications and algorithmic aspects of graph theory
- Mathematical aspects of frequency assignment problems
- Mathematical aspects of networks
- Discrete mathematics in general

- Combinatorics and graph theory in general
- Enumerative extremal graph theory
- Combinatorics on words

- Algorithmic processes
- Randomness
- Computability
- Algorithmic game theory
- Agent based models
- Networks
- Discrete mathematics in general

- Extremal set theory
- Quasi-random structures
- Probabilistic combinatorics
- Discrete geometry
- Graph theory
- Combinatorial games
- Topics in theoretical computer science

- Combinatorial and discrete geometry
- Axiomatic geometry
- Finite geometries
- Geometry of finite-dimensional normed spaces
- Geometric shortest networks, such as Steiner Minimal Trees and the Fermat-Torricelli Problem
- Extremal combinatorics

Browser does not support script.

Browser does not support script.

Browser does not support script.

Browser does not support script.

Browser does not support script.

Browser does not support script.