Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
Dan Alistarh

I’m a Researcher at Microsoft Research Cambridge, and the Morgan Fellow at Downing College, University of Cambridge.
Before coming to MSR, I spent a year as an SNF PostDoc at MIT CSAIL, where I've had the pleasure to work with professors Nir Shavit and Nancy Lynch. I received my PhD in Computer Science at the EPFL, under the brilliant guidance of Prof. Rachid Guerraoui.

My research is on the foundations and practice of synchronization. I’m mainly interested in concurrent data structures, distributed algorithms, and optimization for large-scale data analytics.
You can find some of my recent work below.
Click here to see the complete list, and click here for drafts and working papers.

Recent Publications

Are Lock-Free Concurrent Algorithms Practically Wait-Free?
with Keren Censor-Hillel and Nir Shavit.
In Proceedings of the 46th ACM Symposium on Theory of Computing (STOC 2014).
[PDF] [MITNews Coverage]  [CACM Coverage]

The SprayList: A Scalable Relaxed Priority Queue
with Justin Kopinsky, Jerry Li, and Nir Shavit. 
Accepted to the ACM Symposium on Principles and Practice of Parallel Programming (PPoPP 2015).
Winner of Best Artefact Award.
[preliminary version] [code] [Slashdot Coverage]

Balls-into-Leaves: Sub-logarithmic Renaming in Synchronous Message-Passing Systems
with Oksana Denysyuk, Luis Rodrigues and Nir Shavit.
In Proceedings of the 33rd ACM Symposium on Principles of Distributed Computing (PODC 2014).
Invited to the Special Issue of Distributed Computing dedicated to PODC 2014.
[preliminary version]

Communication-Efficient Randomized Consensus
with James Aspnes, Valerie King and Jared Saia.
In Proceedings of the 28th International Symposium on Distributed Computing (DISC 2014).

Dynamic Task Allocation in Asynchronous Shared Memory
with James Aspnes, Michael Bender, Rati Gelashvili, and Seth Gilbert.
In 2014 ACM-SIAM Symposium on Discrete Algorithms (SODA 2014).

The LevelArray: A Fast, Practical Long-Lived Renaming Algorithm
with Justin Kopinsky, Alexander Matveev, and Nir Shavit.
in Proceedings of the 34th International Conference on Distributed Computing Systems (ICDCS 2014).

StackTrack: An Automated Transactional Approach to Concurrent Memory Reclamation
with Patrick Eugster, Maurice Herlihy, Alexander Matveev, and Nir Shavit.
In Proceedings of the European Conference on Computer Systems (EuroSys 2014).
[PDF] [code]

Tight Bounds for Asynchronous Renaming
with James Aspnes, Keren Censor-Hillel, Seth Gilbert, and Rachid Guerraoui.
In Journal of the ACM, 61(3): 18. 2014. 

Distributed Algorithms
with Rachid Guerraoui.
Chapter in the Computing Handbook, 3rd ed. (1) 2014: 16: 1-16.




Microsoft Research Cambridge
21 Station Road
Cambridge CB1 2FB, UK
Email: dan.alistarh at microsoft dot com