|
|
|
Dan Alistarh
|
|
Distributed Programming Laboratory
|
PhD Student
|
office(s):
INR312
phone(s): [+41 21 69] 38121
|
|
|
MISSION
|
I am a member of the Distributed Programming Lab, under the supervision of Prof. Rachid Guerraoui.
I study Distributed Algorithms. My main research topics are the complexity of agreement problems and communication in wireless networks.
I have a double B.Sc. in Mathematics and Computer Science from Jacobs University Bremen. I've also been an exchange student at Carnegie Mellon University during my senior year.
I am the student representative at the EPFL IC Doctoral School for 2009-2011. If you're a student, you might want to check out my student representative blog.
|
|
CONFERENCE PUBLICATIONS
|
Dan Alistarh, James Aspnes, Seth Gilbert, and Rachid Guerraoui. The Complexity of Renaming. In Proceedings of FOCS 2011, Palm Springs, California, 2011.
[detailed record] [bibtex] [full text]
Dan Alistarh and James Aspnes. Sub-Logarithmic Test-and-Set Against a Weak Adversary. In Proceedings of DISC 2011, Rome, Italy, 2011.
[detailed record] [bibtex] [full text]
Dan Alistarh, James Aspnes, Keren Censor-Hillel, Seth Gilbert, and Morteza Zadimoghaddam. Optimal-Time Adaptive Strong Renaming, with Applications to Counting. In Proceedings of PODC 2011, San Jose, California, 2011.
[detailed record] [bibtex] [full text]
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, and Corentin Travers. Generating Fast Indulgent Algorithms. In Proceedings of ICDCN 2011, Bangalore, India, January 2011. Winner, Best Paper Award.
[detailed record] [bibtex] [full text]
Dan Alistarh, Ioannis Avramopoulos, Petr Kuznetsov, and Gilles Tredan. Routing Attacks as a Viable Threat: Can Software Systems Protect Themselves?. Presented at HotDep 2010, Vancouver, Canada, October 2010.
[detailed record] [bibtex] [full text]
Dan Alistarh, Hagit Attiya, Seth Gilbert, Andrei Giurgiu, and Rachid Guerraoui. Fast Randomized Test-and-Set and Renaming. In Proceedings of DISC 2010, Boston, Massachusetts, USA, September 2010.
[detailed record] [bibtex] [full text]
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, and Morteza Zadimoghaddam. How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange). In Proceedings of ICALP 2010, Bordeaux, France, July 2010.
[detailed record] [bibtex] [full text]
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Zarko Milosevic, and Calvin Newport. Securing Every Bit: Authenticated Broadcast in Radio Networks. In Proceedings of SPAA 2010, Santorini, Greece, June 2010.
[detailed record] [bibtex] [full text]
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, and Corentin Travers. Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement. In Proceedings of ISAAC 2009, Hawaii, USA, December 2009.
[detailed record] [bibtex] [full text]
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, and Corentin Travers. How to solve consensus in the smallest window of synchrony. In Proceedings of DISC 2008, Arcachon, France, September 2008.
[detailed record] [bibtex] [full text]
|
|
JOURNAL PUBLICATIONS AND TECHNICAL REPORTS
|
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, and Corentin Travers. Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement. Accepted to Algorithmica. To appear.
[detailed record] [bibtex] [full text]
Dan Alistarh, James Aspnes, Seth Gilbert, and Rachid Guerraoui. The Complexity of Renaming. Technical Report, 2011.
[detailed record] [bibtex] [full text]
Dan Alistarh, Hagit Attiya, Andrei Giurgiu, Seth Gilbert, and Rachid Guerraoui. Fast Randomized Test-and-Set and Renaming. Technical Report, 2010.
[detailed record] [bibtex] [full text]
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, and Morteza Zadimoghaddam. How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange). Technical Report, 2010.
[detailed record] [bibtex] [full text]
|
|
TALKS
|
How Fast is Robust Gossip?, at MIT TDS Seminar, and ICALP 2010. [slides]
Generating Fast Indulgent Algorithms, at ICDCN 2011. [slides]
Fast Randomized Test-and-set and Renaming, at DISC 2010. [slides]
Byzantine-resilient Broadcast in Wireless Networks, at SPAA 2010, and T-Labs Seminar. [slides]
New Bounds for Eventually Synchronous Set Agreement, at DISC 2010, ISAAC 2009, and HTDC Winter School 2009. [slides]
|
|
PROFESSIONAL ACTIVITIES
|
I'm a Junior PC Member for ICDCN 2012.
I have been a reviewer for Journal of the ACM, SIAM Journal of Computing, and the Distributed Computing journal.
At the conference level, I have reviewed for the International Symposium on Distributed Computing (DISC), the Symposium on Principles of Distributed Computing (PODC), and the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA).
|
|
