Kasper Green Larsen

@kasperglarsen.bsky.social

Professor and Head of Algorithms, Data Structures and Foundations of Machine Learning at Computer Science, Aarhus University

CS at Aarhus University is hiring up to six professors of any rank and area! Come join my section and do cutting-edge research in TCS, database systems and/or ML/AI, both from a theory and applied side. international.au.dk/about/profil... The application deadline is January 5th, 2026.

Aarhus University is hiring Assistant, Associate and Full Professors for the Department of Computer Science - Vacancy at Aarhus University

Vacancy at Computer Science, Dept. of, Aarhus University

international.au.dk

Huge congratulations to my amazing student Yeyuan Chen (+co-author Zihan Zhang of OSU advised by Zeyu Guo) for being awarded the STOC 2025 Best Student Paper Award! Their monumental result proves that explicit Reed-Solomon codes can correct more errors than previously known: arxiv.org/abs/2408.15925

Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds

In this paper, we prove that explicit FRS codes and multiplicity codes achieve relaxed generalized Singleton bounds for list size $L\ge1.$ Specifically, we show the following: (1) FRS code of length $...

arxiv.org

Very honored and grateful for this recognition by the TCS community ❤️

Department of Computer Science, Aarhus University@csaudk.bsky.social · last yr.

Professor @kasperglarsen.bsky.social has been named 𝐄𝐀𝐓𝐂𝐒 𝐅𝐞𝐥𝐥𝐨𝐰 2025 by European Association for Theoretical Computer Science for his outstanding contributions to theoretical computer science 🎉 He will be inducted at the ICALP 2025 conference in Aarhus, this summer. Congrats, Kasper! 👏

An almost tight understanding of AdaBoost's generalisation, a proof that Majority-of-3-AdaBoosts is an optimal weak-to-strong learner in expectation and better margin-generalisation for voting classifiers. New preprint. And as mentioned yesterday, Mikael is on the job market 😉

Bild

This sounds very cool! The insight appears to be that if you can fool any computationally bounded adversaries, then you can fool any reasonable algo looking at the result of your computations. I.e., see the world as an "adversary", use cryptographic primitives to fool it. arxiv.org/abs/2502.130...

Improving Algorithmic Efficiency using Cryptography

Cryptographic primitives have been used for various non-cryptographic objectives, such as eliminating or reducing randomness and interaction. We show how to use cryptography to improve the time comple...

arxiv.org