| |
Algorithms and Complexity Group
We are a small but active research group within the Lab for Foundations of Computer
Science, with main research interests in Randomized Algorithms
(especially algorithms for sampling and counting), Computer
Algebra, Algorithms for Verification - and with some interest in
most aspects of algorithms and complexity. We are always interested
in hearing from prospective graduate students (or anyone) with
interests in these areas.
Academic staff
-
Amin Coja-Oghlan
Random structures and algorithms.
-
Mary Cryan
Randomized algorithms (especially for sampling and counting);
learning theory; computational biology.
-
Kousha Etessami
Automated verification, model checking, modeling and algorithmic analysis of reactive and concurrent systems, temporal logic and automata, algorithms and computational complexity, probabilistic systems, game theory, testing, applications of logic, databases and finite model theory.
-
Kyriakos Kalorkoti
Computational complexity, computer algebra, decision problems in group
theory.
-
Rahul Santhanam
Computational Complexity.
Visitor
- Mark Jerrum
(of QMUL)
Computational complexity, randomised algorithms, stochastic processes,
random structures.
PhD Students
Seminars and Reading Groups
Some relevant seminar series' are:
LFCS
seminar,
North British Probability seminar.
Computational
Complexity reading Group (2007/08) - starting by reading notes
from an introductory course.
Algorithms Reading
Group (Summer 06) - run by Páidí Creed.
Graduate-Level courses
|
