糖心TV

Skip to main content Skip to navigation

Data Science News

Select tags to filter on

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

Breakthrough result on the power of memory in computation

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.

Sun 23 Jun 2024, 22:27 | Tags: People Highlight Research Theory and Foundations

Latest academic promotions

We are happy to announce two recent promotions in the department effective from 1 August 2024:

Many congratulations to our colleagues for their achievements!

Wed 19 Jun 2024, 14:17 | Tags: People Highlight

Latest news Newer news Older news

Let us know you agree to cookies