معرفی
Rasmus Pagh is a Professor in the Algorithms and Complexity section of the Computer Science Department at the University of Copenhagen, Denmark. He is an ACM Fellow and a core researcher at the BARC (Basic Algorithms Research Copenhagen) center, with additional affiliation at the DeLTA Lab. From January 2019 to December 2020, he served as a visiting faculty researcher at Google Research.
His primary research interests focus on algorithms and data structures with emphasis on big data applications. His work spans information retrieval, the role of randomness in computing, database applications, knowledge discovery, and more recently, differential privacy. His research has practical implications across multiple domains requiring efficient data processing solutions.
Pagh's recent work shows a strong emphasis on differential privacy, particularly exploring correlated noise mechanisms and multiple release scenarios that maintain privacy guarantees while maximizing utility. His research demonstrates how to create multiple privacy-preserving releases without degrading overall privacy protection.
- ACM Fellow
As an active supervisor, Pagh currently mentors four PhD students (Sia Sejer, Lukas Retschmeier, Joel Andersson, and Johanna Düngler) and has successfully graduated twelve PhD students whose careers now span academia and industry at organizations including Akamai Technologies, Microsoft, and Oracle. He serves on numerous prestigious program committees including STOC, FOCS, and ICALP, and has held leadership roles such as steering committee chair for the European Symposium on Algorithms (ESA) from 2022-2024.
His research is centered at BARC (Basic Algorithms Research Copenhagen) where he leads work on fundamental algorithmic problems with applications to real-world data challenges. The center provides a collaborative environment for theoretical and applied algorithm research.
