Anders Aamand will join Rice University as an assistant professor at the computer science department in July 2026. He is currently a postdoc in the theory group at the University of Copenhagen hosted by Professor Mikkel Thorup. Prior to that, he was a postdoctoral fellow at MIT hosted by Professor Piotr Indyk. He obtained his Ph.D. from the University of Copenhagen in 2020 under supervision of Professors Mikkel Thorup and Mikkel Abrahamsen.

Anders is broadly interested in problems at the intersection of theory and practice within algorithm design. His doctoral studies focused on designing fast and implementable hashing schemes with some of the same strong theoretical guarantees as fully random hash functions, as well as on problems within computational geometry. His more recent research interests consider questions on the role of algorithm design in the era of large-scale data analysis. Concretely, he is interested in incorporating information learned from past data into algorithm design in a principled manner, as well as stability notions of algorithms such as differential privacy and replicability. He enjoys most problems of a combinatorial or probabilistic flavor.