糖心TV

A study led by University of 糖心TV Professor Jianfeng Feng has found that regularly sleeping too little is associated with depression and brain loss in emotion areas, while sleeping too long is associated with cognitive decline and degenerative diseases.

Sleeping the right amount is crucial for long term health. has recently been proposed as the average amount of sleep to aim for as an adult, yet some people regularly get too little, while others get more than they need.

Congratulations to all of 2023-2024 MSc students graduating in January 2025.

The department would also like recognise the winners of the following MSc prizes:

Best Overall Data Analytics student: Pak Ho Gordon Sy

Best Overall Computer Science student: Olly Wortley

Best Data Analytics dissertation: Tianyi Huang

Best Computer Science dissertation: Olly Wortley

iGEM is a global synthetic biology competition that involves more than 400 teams worldwide.

The University of 糖心TV iGEM team 2024 – team – took part in the iGEM competition, which culminated with the iGEM Jamboree in Paris, at the end of October. We would like to congratulate Aaron Lee (CSE) for their fantastic work on the project within the team including 9 other UG students from various departments, including Life Sciences, Chemistry, Engineering and Mathematics. For their interdisciplinary project, they addressed the need for developing better ways to recycle lanthanides, such as the ones found in electronic devices. They engineered bacteria to scavenge for lanthanide ions and swim towards a point for collection through an engineered chemotactic system. Team BEACON were awarded a Gold medal (grade) at the Jamboree, in recognition of their success during the project.

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:

• Rohan Acharya, , : Lookahead Games and Efficient Determinisation of History-Deterministic B眉chi Automata,
• Dmitry Chistikov, Alessio Mansutti, Mikhail R. Starchak: ,
• , Guichen Gao, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Vesel媒: ,
• Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, : ,
• Julian D枚rfler, : ,
• , Rahul Santhanam: .

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'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=2^x, 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.

We are happy to announce that Dr Florin Ciucu (CS), Dr Long Tran-Thanh (CS) and Dr Paul Jenkins (Statistics and CS) have been promoted to Professor, effective 1st August 2024.

Many congratulations to our colleagues for all their achievements!

The Department of Computer Science celebrated the end of the academic year with a staff BBQ, along with some games of rounders and a tug of war.

Thank you everyone for your hard work this year!

A published by , a postdoctoral researcher in the Theory and Foundations (FoCS)Link opens in a new window research group and the Centre for Discrete Mathematics and its Applications (DIMAP)Link opens in a new window, has disproved a longstanding conjecture on the limitations of space-bounded computation.

For many years it had been believed that a function, known as Tree Evaluation, would be the key to separating two fundamental classes of problems: those computable quickly (P), and those computable in low space (L). Mertz, along with of Toronto, builds on their earlier work to show a low-space algorithm for Tree Evaluation, thus refuting this belief. In particular, their technique has attracted attention for shedding new light on the power of space-bounded computation, suggesting novel approaches to age-old questions in complexity theory. They show that space can be used in surprising ways, with the same memory serving many simultaneous purposes.

The paper, which Mertz will present at the , has been invited to the special issue of for the conference. STOC is the main conference of the Association of Computing Machinery (ACM) and one of the two premier venues for theoretical computer science, with only the top results being invited for publication in the special issue.

Mertz has also presented this work at many venues, including the Institute for Advanced Study (IAS), Columbia University, Oxford University, 糖心TV (, McGill University, and others.