Skip to main content

Alistarh Group

Distributed Algorithms and Systems

Distribution has been one of the key trends in computing over the last decade: processor architectures are multi-core, while large-scale systems for machine learning and data processing can be distributed across several machines or even data centers. The Alistarh group works to enable these applications by creating algorithms that scale—that is, they improve their performance when more computational units are available.

This fundamental shift to distributed computing 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 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. One particular area of focus over the past few years has been distributed machine learning.

On this site:


Image of Elias Frantar

Elias Frantar

PhD Student

Image of Eugenia Iofinova

Eugenia Iofinova

PhD Student

Image of Eldar Kurtic

Eldar Kurtic

Research Technician Machine Learning

+43 2243 9000 2081

Image of John Lazarsfeld

John Lazarsfeld

Predoctoral Visiting Scientist

Image of Ilia Markov

Ilia Markov

PhD Student

Image of Mahdi Nikdan

Mahdi Nikdan

PhD Student

Image of Alexandra Peste

Alexandra Peste

PhD Student

Image of Aleksandr Shevchenko

Aleksandr Shevchenko

PhD Student

Current Projects

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


Peste E-A. 2023. Efficiency and generalization of sparse neural networks. Institute of Science and Technology Austria. View

Peste E-A, Vladu A, Kurtic E, Lampert C, Alistarh D-A. CrAM: A Compression-Aware Minimizer. 11th International Conference on Learning Representations . ICLR: International Conference on Learning Representations. View

Alistarh D-A, Ellen F, Rybicki J. 2023. Wait-free approximate agreement on graphs. Theoretical Computer Science. 948(2), 113733. View

Koval N, Alistarh D-A, Elizarov R. 2023. Fast and scalable channels in Kotlin Coroutines. Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. PPoPP: Sympopsium on Principles and Practice of Parallel Programming, 107–118. View

Aksenov V, Brown TA, Fedorov A, Kokorin I. 2023. Unexpected scaling in path copying trees, Association for Computing Machinery,p. View

View All Publications

ReX-Link: Dan Alistarh


since 2017 Assistant Professor, Institute of Science and Technology Austria (ISTA)
2016 – 2017 “Ambizione Fellow”, 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

theme sidebar-arrow-up
Back to Top