Kasper Green Larsen is a Professor in the Department of Computer Science at Aarhus University. His research focuses on theoretical computer science, machine learning, algorithms, and data structures. He has made significant contributions to boosting algorithms, PAC learning theory, and computational geometry. His work often bridges algorithm design with complexity theory, addressing challenges in optimization, memory efficiency, and lower bounds analysis. Key research areas include: Algorithmic Learning Theory (e.g., boosting, bagging, and PAC learners) Data Structure Design (e.g., invertible Bloom tables, succinct representations) Computational Complexity (e.g., lower bounds for dynamic and oblivious algorithms) Geometric Algorithms (e.g., hierarchical searching, range queries) Recent publications emphasize foundational advancements in learning theory (e.g., optimal weak-to-strong learning) and data efficiency (e.g., memory-reduced Bloom filters). His work frequently appears in top conferences like IJCAI, ICALP, and SODA, reflecting rigorous theoretical contributions with practical implications.
