Anurag Dasgupta

Distrubted Systems Reading Group: Paper List

1. Tom Hayes, Navin Rustagi, Jared Saia, Amitabh Trehan, The forgiving tree: a self-healing distributed data structure, ACM PODC 2008 Pages 203-212 (pdf)
2. K. Mani Chandy and Michel Charpentier, Self-Similar Algorithms for Dynamic Distributed Systems, ICDCS 2007 (pdf)
3. Mitchell Flatebo, Ajoy Kumar Datta, Anneke A. Schoone: Self-Stabilizing Multi-Token Rings. Distributed Computing 8(3) (1995) 133-142 (pdf)
4. Beverly Yang, Tyson Condie, Sepandar D. Kamvar, Hector Garcia-Molina: Non-Cooperation in Competitive P2P Networks. ICDCS 2005: 91-100 (pdf)
5. Thomas Moscibroda, Stefan Schmid, Roger Wattenhofer: On the topologies formed by selfish peers. PODC 2006: 133-142 (pdf)
6. Leslie Lamport: On Interprocess Communication. Part II: Algorithms. Distributed Computing (1986) (pdf)
7. Tushar Deepak Chandra, Vassos Hadzilacos, Sam Toueg: The Weakest Failure Detector for Solving Consensus. PODC 1992: 147-158 (pdf)
8. N. Agmon and D. Peleg. Fault-tolerant gathering algorithms for autonomous mobile robots. In Proc. 15th ACM-SIAM Symp. on Discrete Algo (SODA)., 1063–1071, 2004. (pdf)