Travelled to:
1 × France
1 × Japan
2 × USA
Collaborated with:
N.Shavit R.Gelashvili K.Censor-Hillel J.Kopinsky J.Li S.Gilbert R.Guerraoui M.Zadimoghaddam
Talks about:
free (2) polylogarithm (1) algorithm (1) protocol (1) prioriti (1) scalabl (1) practic (1) exchang (1) concurr (1) resili (1)
Person: Dan Alistarh
DBLP: Alistarh:Dan
Contributed to:
Wrote 4 papers:
- ICALP-v2-2015-AlistarhG #polynomial #protocol
- Polylogarithmic-Time Leader Election in Population Protocols (DA, RG), pp. 479–491.
- PPoPP-2015-AlistarhKLS #queue #scalability
- The SprayList: a scalable relaxed priority queue (DA, JK, JL, NS), pp. 11–20.
- STOC-2014-AlistarhCS #algorithm #concurrent #question
- Are lock-free concurrent algorithms practically wait-free? (DA, KCH, NS), pp. 714–723.
- ICALP-v2-2010-AlistarhGGZ #cost analysis #how #performance
- How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange) (DA, SG, RG, MZ), pp. 115–126.