Raphaël Clifford
String algorithms
Algorithms and Complexity
Research group · School of Computer Science
About the group
We are the Algorithms and Complexity research group in the School of Computer Science at the University of Bristol . Our research covers algorithms, computational complexity and related areas of theoretical computer science.
The group works on theoretical questions relating to the design, analysis and limitations of algorithms, including problems involving large data sets, graphs, strings and computational complexity.
Research interests
- 01 String algorithms — Raphaël Clifford
- 02 Massive-data algorithms, streaming, communication complexity and distributed computing — Christian Konrad
- 03 Counting and parameterised complexity, randomised algorithms, random processes on networks and graph theory — John Lapinskas
- 04 Computational complexity — Shuo Pang
People
Current group members
Core faculty
Christian Konrad
Head of Group · Streaming and distributed algorithms
John Lapinskas
Counting complexity and graph theory
Shuo Pang
Computational complexity
PhD students
Conor O’Sullivan
PhD student · Since 2024
Archie Walton
PhD student · Since 2024
Former members
- Adithya Diddapur PhD student, 2022–2026
- Cezar Alexandru PhD student, 2021–2025
- Kheeran Naidu PhD student, 2020–2024
- Chhaya Trehan Postdoctoral researcher, Sept 2022–Jan 2024
- Pavel Dvořák Postdoctoral researcher, Sept 2021–Apr 2022
Publications
Since 2020
Publications involving members of the group, organised by year. Select any year to expand or collapse its list.
Contact
Algorithms and Complexity research group
School of Computer Science
University of Bristol
Woodland Road
Bristol BS8 1UB
United Kingdom
Group enquiries
For questions about the group, research collaborations, student projects or PhD opportunities, contact: