糖心TV

Skip to main content Skip to navigation

Computer Science News

Select tags to filter on

ERC Consolidator Grant for Sayan Bhattacharya

We are happy to announce that an academic from our department, , is among the winners of . According to the European Research Council: "These grants, totalling 鈧�678 million, aim to support outstanding scientists and scholars as they establish their independent research teams and develop their most promising scientific ideas. The funding is provided through the EU's Horizon Europe programme."

has been awarded a 鈧�2million ERC Consolidator grant for a 5-year project entitled "Towards a Dynamic Algorithms Centric Theory of Linear Programming" (DYNALP). The project aims to build a new theory exploring the interplay between two key concepts, Linear Programming and Dynamic Algorithms, which, in turn, will pave the way towards attacking outstanding open questions in the field of Theoretical Computer Science.

In the 2024 round, this was the only project from the United Kingdom that was awarded an ERC Consolidator Grant in Computer Science and Informatics (PE6 panel). The contains more information about the ERC funding programme.

Tue 03 Dec 2024, 18:37 | Tags: People Grants Research Theory and Foundations

Google PhD Fellowship for Martin Costa

We are delighted to announce that , a PhD student at the Theory and Foundations research division, has received a highly competitive for his work on designing clustering algorithms for dynamic datasets. The Fellowship comes in the form of an unrestricted gift from Google, of 60,000 USD per year, for up to two years. Under the category of "Algorithms and Theory", besides Martin (from University of Cambridge and ETH Zurich) received a Google PhD Fellowship this year. Many congratulations to Martin for this achievement!

Fri 15 Nov 2024, 09:32 | Tags: Research Theory and Foundations

Best Paper Award at QEST+FORMATS 2024

Neha Rino, a PhD student in the Theory and Foundations group in the Department of Computer Science and a member of the Cyber Security group at WMG, has won an at FORMATS 2024.

The Oded Maler award is a distinction presented for the best paper of the International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS). of the conference was held in September in Calgary, Canada, jointly with QEST (International Conference on Quantitative Evaluation of SysTems) as a common research forum dedicated to quantitative modelling, analysis, and verification.

Neha's paper, "", is co-authored with Mohammed Foughali and Eugene Asarin, both from and in Paris, France, where Neha completed the Master's degree (ENS Paris-Saclay) prior to joining 糖心TV.

Neha's paper contributes to the research framework of quantitative monitoring, which is the analysis of individual executions of systems which yields numerical output (real numbers), rather than binary yes/no. The paper formulates and solves, by an efficient algorithm, a new problem of this kind: computing a real number that characterises to which extent the given execution of a satisfies its specification expressed in (STL).

Tue 22 Oct 2024, 16:15 | Tags: Conferences Research Theory and Foundations

PhD Studentship Opportunities in Theoretical Computer Science

PhD positions are available at the Theory and Foundations (FoCS) group in the , University of 糖心TV, UK. The group has strong ties with the Centre for Discrete Mathematics and its Applications (DIMAP), established in 2007 jointly with the and . Together with DIMAP, the group is one of the leading theory groups in Europe, with regular publications in top international conferences and journals in theoretical computer science.

Tue 15 Oct 2024, 14:26 | Tags: Jobs and studentships Theory and Foundations

Henry Sinclair-Banks successfully defends his PhD thesis

Many congratulations to Henry Sinclair-Banks for passing his PhD viva today, which was one of the shortest and best in the long memories of the examiners, from the University of Edinburgh, and our own Professor Ranko Lazic.

Wed 21 Aug 2024, 12:06 | Tags: People Research Theory and Foundations

Best Paper Award and 6 papers at ICALP 2024

Six papers co-authored by DIMAP and Theory and Foundations researchers were presented earlier in July at , the 51st International Colloquium on Automata, Languages, and Programming:

ICALP is the main conference and annual meeting of the European Association for Theoretical Computer Science (). took place in Tallinn, Estonia, on the 8th to 12th of July 2024.

Dmitry ChistikovDmitry's paper "" won the Best Paper Award of ICALP's Track B, which is a flagship research meeting on Automata, Logic, Semantics, and Theory of Programming. The paper studies the following problem: given a system of linear equations and constraints of the form y=2x, does it have a solution over the natural numbers? By using and extending a method that generalises , Dmitry and his co-authors Alessio Mansutti and Mikhail Starchak show that the problem belongs to . This result provides a way to efficiently certify the existence of a solution, even if all solutions are very big (towers of exponentials).

This is the second time in a row that this award goes to a 糖心TV paper: Henry Sinclair-Banks, a DIMAP PhD student, was an awardee in 2023.

Wed 31 Jul 2024, 11:30 | Tags: Conferences Highlight Research Theory and Foundations

6 papers accepted to FOCS 2024

Six papers from the Theory and Foundations Research Group and the Centre for Discrete Mathematics and Its Applications (DIMAP) have been accepted to the , the flagship conference in theoretical computer science that will be held on October 27 - 30, 2024 in Chicago, USA:

  • "" by Lijie Chen, Jiatu Li and .
  • "" by , Din Carmon, , Shay Solomon and Tianyi Zhang.
  • "Fully Dynamic k-Clustering with Fast Update Time and Small Recourse" by , , Naveen Garg, Silvio Lattanzi and Nikos Parotsidis.
  • "The Tractability Border of Reachability in Simple Vector Addition Systems with States" by Dmitry Chistikov, Wojciech Czerwi艅ski, 艁ukasz Orlikowski, Filip Mazowiecki, Henry Sinclair-Banks and Karol W臋grzycki.
  • "Optimal Coding Theorems for Randomized Kolmogorov Complexity and Its Applications" by Shuichi Hirahara, and Mikito Nanashima.
  • "On the Complexity of Avoiding Heavy Elements" by , , Hanlin Ren and Rahul Santhanam.
Fri 28 Jun 2024, 20:39 | Tags: Research Theory and Foundations

Latest news Newer news Older news

Let us know you agree to cookies