Alistarh Group

Distributed Algorithms and Systems

Distribution has been a major trend in computing over the last decade, which affects the way we compute in several ways: microprocessor architectures are now multi-core, offering several parallel threads of computation, while large-scale systems distribute storage and computation across several processors, machines, or data centers. The Alistarh group works to create algorithms that take advantage of these developments, by creating software that scales – in other words, it improves its performance when more computation is available.

This fundamental change in the way computation is performed puts forward exciting open questions. How do we design algorithms to extract every last bit of performance from the current generation of architectures? How do we design future architectures to support more scalable algorithms? Are there clean abstractions to render high-performance distribution accessible to programmers? The Alistarh group’s research is focused on answering these questions. In particular, they are interested in designing efficient, practical algorithms for fundamental problems in distributed computing, in understanding the inherent limitations of distributed systems, and in developing new ways to overcome these limitations.

Group Leader

On this site:


Current Projects

Distributed machine learning | Concurrent data structures and applications | Molecular computation


Ovaskainen O, Rybicki J, Abrego N. 2019. What can observational data reveal about metacommunity processes? Ecography. 42(11), 1877–1886. View

Lenzen C, Rybicki J. 2019. Self-stabilising Byzantine clock synchronisation is almost as easy as consensus. Journal of the ACM. 66(5), 32. View

Foerster K-T, Korhonen J, Rybicki J, Schmid S. 2019. Does preprocessing help under congestion? Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. PODC: Symposium on Principles of Distributed Computing 259–261. View

Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. 2019. Fast approximate shortest paths in the congested clique. Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin. PODC: Symposium on Principles of Distributed Computing 74–83. View

Jelínek V, Töpfer M. 2019. On grounded L-graphs and their relatives. Electronic Journal of Combinatorics. 26(3), P3.17. View

View All Publications


since 2017 Assistant Professor, IST Austria
2016 – 2017 Visiting Researcher, Computer Science Department, ETH Zurich
2014 – 2016 Researcher, Microsoft Research, Cambridge, UK
2014 – 2016 Morgan Fellow, Downing College, University of Cambridge, UK
2012 – 2013 Postdoc, Massachusetts Institute of Technology, Cambridge, USA
2012 PhD, EPFL, Lausanne, Switzerland

Selected Distinctions

2018 ERC Starting Grant
2015 Awarded Swiss National Foundation “Ambizione” Fellowship
2014 Elected Morgan Fellow at Downing College, University of Cambridge
2012 Postdoctoral Fellowship of the Swiss National Foundation
2011 Best Paper Award at the International Conference on Distributed Computing and Networking

Additional Information

Dan Alistarh’s website

Back to Top