Frontiers of Science Award for Rasmus Kyng and Maximilian Probst
Professor Rasmus Kyng and Senior Assistant Maximilian Probst have received the inaugural Frontiers of Science Award for a paper they co-authored in 2022. Congratulations!
Together with several co-authors, Professor Rasmus Kyng and his group member Dr Maximilian Probst Gutenberg have just been awarded the inaugural Frontiers of Science Award for their paper titled "Maximum Flow and Minimum-Cost Flow in Almost-Linear Time". The paper was published in the 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) where it also won the best paper award. The recognised work was co-authored by Li Chen (University of California), Rasmus Kyng (ETH Zurich), Yang P. Liu (Stanford University), Richard Peng (University of Waterloo), Maximilian Probst Gutenberg (ETH Zurich), and Sushant Sachdeva (University of Toronto).
The Frontiers of Science Award is initiated by the International Congress of Basic Science, which is a new conference created by the Chinese government. The International Congress for Basic Science honours top research, with an emphasis on achievements from the past five years which are both excellent and of outstanding scholarly value.
More about Rasmus Kyng
Rasmus Kyng is an assistant professor at the Department of Computer Science, ETH Zurich, where he joined in the fall 2019. Rasmus finished his doctorate at the Department of Computer Science at Yale in the summer 2017, and then worked in the Theory of Computation Group at Harvard as a postdoc from 2018 to 2019. His research focuses on fast algorithms for graph problems and convex optimization, on probability and discrepancy theory, fine-grained complexity theory, and applications in machine learning. Rasmus’ research is supported in part by a grant of the Swiss National Science Foundation.
More about Maximilian Probst
Dr Maximilian Probst is a senior assistant at the Department of Computer Science in Rasmus Kyng's Algorithms and Optimization Group. He received his doctorate in 2020 at the University of Copenhagen, where he was also a part of the Basic Algorithm Research Group Copenhagen (BARC). Maximilian’s main interests lie in graph algorithms, optimization, and data structures. He has mainly worked on shortest paths, flows and cuts, expanders, and connectivity/ reachability.