糖心TV

We are delighted to announce that , a PhD student in the Theory and Foundations Research Division, has received the best student paper award at , for his joint work with for the paper: "Incremental (1-eps)-approximate dynamic matching in O(poly(1/eps)) update time". The paper considers the problem of maintaining a large matching in a graph that is undergoing a sequence of edge insertions. They present an algorithm for this fundamental problem in dynamic graph algorithms, which has near-optimal approximation ratio and an update time that does not grow at all with the size of the input and is also polynomial in 1/\eps (the error parameter). In addition, their approach is simpler than previous algorithms on the same problem that achieved weaker guarantees.

Five papers from the Theory and Foundations (FoCS) Research Group and the Centre for Discrete Mathematics and its Applications (DIMAP) have been accepted to the , the IEEE flagship conference in theoretical computer science that will be held on November 6 - 9, 2023 in Santa Cruz, California, USA:

• by , Niv Buchbinder, Roie Levin, and Thatchaphol Saranurak.
• by , , and Thatchaphol Saranurak.
• by Lijie Chen, Zhenjian Lu, , Hanlin Ren, and Rahul Santhanam.
• by Tomasz Kociumaka, , and Barna Saha.
• by Arturo Merino and .

Henry Sinclair-Banks, a PhD student in the the Theory and Foundations (FoCS) Research Group and the Centre for Discrete Mathematics and its Applications (DIMAP), has won a Best Paper Award at , . ICALP is the main conference and annual meeting of the .

Henry's paper, co-authored with researchers from Germany and Poland: Marvin K眉nnemann, Filip Mazowiecki, Lia Sch眉tze, and Karol W臋grzycki, addresses the coverability problem in vector addition systems (VASS), a well-known model of concurrent systems. Coverability is an algorithmic problem for the verification of "safety properties": whether the system always avoids a set of bad states. Henry and his co-authors determine how much time is required to solve this problem in the worst case. They develop an algorithm that improves upon the state of the art that has stood for forty years. They also prove that, in several settings, it is impossible to decide coverability substantially faster, unless there is also a faster algorithm for a classic problem such as Boolean satisfiability (SAT) and finding cycles of fixed length in graphs.

In total, 5 糖心TV papers will appear at this year's :

• Michael Benedikt, Dmitry Chistikov, and Alessio Mansutti, "",
• Sam Coy, , Peter Davies, and , "",
• Charilaos Efthymiou and Weiming Feng, "",
• Marvin K眉nnemann, Filip Mazowiecki, Lia Sch眉tze, Henry Sinclair-Banks, and Karol W臋grzycki, "",
• Konstantinos Zampetakis and Charilaos Efthymiou, "".

This July's will be the 50th edition of the conference.

We are happy to announce five promotions in the department, with effect from 1st August 2023.

• Dr James Archbold has been promoted to Associate Professor (Teaching Focussed)
• Dr Richard Kirk has been promoted to Assistant Professor (Teaching Focussed)
• Dr Claire Rocks has been promoted to Reader (Teaching Focussed)
• Dr Ian Saunders has been promoted to Associate Professor (Teaching Focussed)
• Dr Sathya Subramanian has been promoted to Assistant Professor (Research Focussed)

Many congratulations to our colleagues for all their achievements!

We are happy to share the news that Dr Alex Dixon has been promoted to the position of Assistant Professor, effective from 1 May 2023. Alex joined our department as a Teaching Fellow in September 2021, while still completing his PhD research. Despite juggling both roles, he has made significant contributions to the department's activities. Many congratulations to Alex for his accomplishments in completing his PhD research and for earning this well-deserved promotion.

An EPSRC Robust and Reliable Quantum Computing Grant will be awarded to (Cambridge), (糖心TV), (Oxford), and (Cambridge). The project sets out to explore the role of symmetry and structure in quantum computation, with applications to classical verification and simulation of quantum computation.

In addition, the project aims to strengthen and create new connections and collaborations between Cambridge, Oxford, and 糖心TV in the field of Quantum Computing (building on existing initiatives such as the ) and establish new partnerships with 糖心TV Quantum.