The LMS Computer Science Colloquium includes themed talks on a topical issue at the interface of mathematics and computer science. It is organised by the LMS Computer Science Committee. The event is aimed at PhD students and post-docs, although others are welcome to attend at a charge of £5 per person.
The Colloquium is usually held as a hybrid event in November at De Morgan House, London. It is a day-long event with 4-5 speakers. Talks from previous Colloquia can be viewed on our YouTube channel.
Details of upcoming Computer Science Colloquia will be posted to the LMS homepage (click the 'Events' tab) when available.
Previous LMS Computer Science Colloquia
2024 - Tuesday 10 December 2024 - De Morgan House, London and online
Trends in Algorithm Design
Peter Kiss (University of Vienna) - $(1+\epsilon)$-Approximate Sub-Linear and Dynamic Matching
Christian Konrad (University of Bristol) - Streaming Algorithms, Communication Complexity, and the Maximum Matching Problem
Peter Davies-Peck (University of Durham) - The Distributed Lovász Local Lemma
Sagnik Mukhopadhyay (University of Birmingham) - Unified Algorithm Design in Modern Computational Models
Videos available on the LMS YouTube channel.
2023 - Friday 1 December 2023 - De Morgan House, London and online
Verification: Theory and Practice
Ana Cavalcanti (University of York) - Verification of control software for robots that learn
Rod Chapman (Amazon Web Services) - Automated Reasoning at AWS, and Applications in Cryptography:
Angeliki Koutsoukou-Argyraki (Royal Holloway, University of London) - Perspectives on the formalisation of mathematics: verification and beyond:
Giles Reger (University of Manchester) - The Vampire Journey: building a theorem prover for program verification:
Videos available on the LMS YouTube channel.
2021 - Wednesday 17 November 2021 - Online
Mathematical Foundations for Machine Learning
Benjamin Guedj (University College London and Inria) - On generalisation and learning: a (condensed) primer on PAC-Bayes, followed by News from the PAC-Bayes frontline
Peter Tino (University of Birmingham) - From dynamical systems to kernel based feature spaces and back
Aretha Teckentrup (University of Edinburgh) - Numerical analysis of Gaussian process regression
Alexandros Hollender (University of Oxford) - The Complexity of Gradient Descent: CLS = PPAD ∩ PLS
Videos available on the LMS YouTube channel.
2020 - Thursday 19 November 2020 - Online
Algorithms, Complexity and Logic
Nobuko Yoshida (Imperial College London) - A History and Applications
Kitty Meeks (University of Glasgow) - From decision to approximate counting
Anupam Das (University of Birmingham) - The size of proofs: from mathematical logic to computational complexity and back
Igor Carboni Oliveira (University of Warwick) - Kolmogorov complexity, prime numbers, and complexity lower bounds
Videos available on the University of Edinburgh website.
2019 - Wednesday 13 November 2019 - De Morgan House, London
Mathematics of Security
Delaram Kahrobaei (University of York) - Interactions between Group Theory, Cyber Security, Artificial Intelligence, and Quantum Computation
Christophe Petit (University of Birmingham) - Rubik's for cryptographers: Babai's conjecture, hash functions and quantum gates
Alexei Lisitsa (University of Liverpool) - Formal Modelling of Smart Contracts Languages, Their Expressive Power and Verification
David Galindo (University of Birmingham) - Security Models and Designs from E-Voting to Blockchain
2018 - Thursday 8 November 2018 - De Morgan House, London
Quantum Computing: Unique Mathematical Perspectives
Richard Jozsa (University of Cambridge) - Foundations of Quantum Computation and Complexity
Vivien Kendon (Durham University) - Solving Problems By Finding Low Energy Quantum States
Ashley Montanaro (University of Bristol) - Quantum Algorithms: From Foundations To Applications
Earl Campbell (University of Sheffield) - Homological and hypergraph product codes for quantum error correction
Mark Howard (University of Sheffield) - Topics in Stabilizer Quantum Computation