Dan Alistarh

I’m a Postdoctoral Researcher at Microsoft Research Cambridge.
I’m mainly interested in algorithms, in particular efficient concurrent data structures, distributed algorithms, and data layout optimization for Big Data applications.

Before coming to MSR, I was an SNF PostDoc at MIT CSAIL, where I've had the pleasure to work with professors Nir Shavit and Nancy Lynch. Previously, I did a PhD in Computer Science at the EPFL, under the brilliant guidance of Prof. Rachid Guerraoui.

You can find some recent publications below, click here for the complete list.

Recent Publications

Are Lock-Free Current Algorithms Practically Wait-Free?
with Keren Censor-Hillel and Nir Shavit.
Accepted to the 46th ACM Symposium on Theory of Computing (STOC 2014), to appear.
[PDF] [MITNews Coverage]

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

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).
[PDF]

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).
[PDF]

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

Tight Bounds for Asynchronous Renaming
with James Aspnes, Keren Censor-Hillel, Seth Gilbert, and Rachid Guerraoui.
Accepted to Journal of the ACM, to appear. 
[PDF]

 

 

 

 

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