Aarhus University Seal / Aarhus Universitets segl

MADALGO

Center for Massive Data Algorithmics

News

Prestigious international recognition to Kasper Green Larsen, who receives 2019 EATCS Presburger Award

2019.03.04 | Public/media

As the first Dane ever, associate professor in computer science, Aarhus University, Kasper Green Larsen, received the international 2019 EATCS Presburger Award which is given for "outstanding contributions in theoretical computer science". The award is given once a year to one or more international researchers under 35. Kasper shares the award…

PhD student Asger Drewsen and Team win Danish Championship in Programming 2018

2018.11.20 | MADALGO

Madalgo PhD student Asger was part of the programming trio from Department of Computer Science who won the 2018 Danish National Championship in Programming.

Picture by Xiang Li

Kasper Green Larsen gives a talk to the rising stars of computer science

2018.11.07 | MADALGO

Kasper, who is currently on sabbatical at University of California, Berkeley, was invited to the annual China Theory Week 17 - 20 September in order to inspire the rising stars of theoretical computer science.

Photo: private

Stibo grant to Casper Freksen

2018.09.11 | People

Congratulations to PhD student Casper Freksen from the Algorithms and Data Structures group who has received a travel scholarship from the STIBO foundation. Casper will use the DKK 65.000 for his stay abroad at Harvard, where he will be until December 21. We wish you an exciting stay in the USA.

Responsible

Lars Arge

Professor
M
H 5335, 315
P +4587156284
P +4541606166

Financed by

MADALGO was financed by The Danish National Research Foundation (DNRF) during 2007 - 2017.

Events

No articles found in this list

Past Events

Wed 10 Apr
09:15-17:00 | Building 5335, room 016 (Peter Bøgh Auditorium)
Aarhus University Digital Innovation Conference
Want to hear what top digital researchers and industry specialists are working on? Meet top experts at our digital innovation conference.
Wed 20 Mar
14:15-15:00 | Nygaard-295 (5335-295), Åbogade 34, 8200 Aarhus N
Theory Seminar: Jelani Nelson - BPTree: an l_2 heavy hitters algorithm using constant memory
In the 'frequent items' problem one sees a sequence of items in a stream (e.g. a stream of words coming into a search query engine like Google) and wants to report a small list of items containing all frequent items. We would like algorithms for this problem that use memory substantially sublinear in the length of the stream.
Fri 22 Feb
15:15-16:00 | Building 5335, room 016 (Peter Bøgh Auditorium)
CS Colloquium - Kasper Green Larsen: In Pursuit of Optimality
What would you rather compute with a paper and pencil, 3'593'103 + 1'502'348 or 3'593'103 x 1'502'348? Most sane people would prefer adding the two numbers. But why?