News

Four years ago today, on September 1, 2017, the BARC Centre officially began its journey.

This is a story of foundational research, and innovative algorithms motivated by basic algorithmic questions, unfolding into real-world impact: the TensorSketch, from theory to practice.

Professors Thorup and Kawarabayashi have won an esteemed Fulkerson Prize for their paper “Deterministic Edge Connectivity in Near-Linear Time”.

Again four BARC papers have been accepted at the prestigious ACM Symposium on Theory of Computing, STOC, as well as one paper by the closely affiliated complexity group MIAO headed by Jakob Nordström.

New BARC result makes it onto national news.

At the top conference within theoretical computer science: “ACM Symposion on the theory of Computing” (STOC), Mikkel Thorup and Uri Zwick received a 20-Year STOC Test of Time Award.

Within Algorithms and Complexity CSRankings puts the Department of Computer Science at the University of Copenhagen 4th in the world within the field.

This new result is yielding the right understanding of load-balancing in a dynamic environment and presents a key to drastically cutting server based CO2 emissions in the future.

BARC welcomes Postdoc Ioana Bercea to the team.

Real world data sets often consists of millions of data points which makes it a non-trivial task to store them efficiently. Four BARC researchers have developed a superior solution!