Partial bibliography for the Distributed Computing Course

  1. N. Lynch, Distributed Algorithms, Morgan Kaufmann, San Mateo, California, 1995.
  2. H. Attiya and J. Welch, Distributed Computing: Fundamentals, Simulations and Advanced Topics, McGraw-Hill, England, 1998.
  3. D. Peleg, Distributed Computing: A Locality-Sensitive Approach, SIAM, Philadelphia, PA, 2000.
  4. G. Tel, Introduction to Distributed Algorithms, Cambridge University Press, England, 1994.
  5. D. Bertsekas and R. Gallager, Data Networks, Prantice Hall, Englewood Cliffs, NJ, 1987.
  6. M. Raynal, Algorithms for Mutual Exclusion, MIT Press, Cambridge, Massachusetts, 1986.
  7. S. Mullender, Distributed Systems, ACM press, New York, New York, 1989.
  8. E. Chang and R. Roberts, An Improved algorithm for decentralized extrema-finding in circular configurations of processes, Comm. of the ACM 22, (1979), pp.281-283.
  9. U. Feige, D. Peleg, P. Raghavan and E. Upfal, Randomized Broadcast in Networks, J. on Random Structures & Algorithms , 1 , (1990), pp. 447-460.
  10. Frederickson, G.N. and Lynch, N., Electing a Leader in a Synchronous Ring, J. of the ACM, 34, (1987), pp. 98--115.
  11. D.S. Hirschberg and J.B. Sinclair, Decentralized extrema-finding in circular configurations of processes, Comm. of the ACM, 23, (1980), pp. 627-628.
  12. D. Peleg and A.A. Schaffer, Time Bounds on Fault Tolerant Broadcasting, Networks , 19 , (1989), pp. 803--822.
  13. G.L. Peterson, An O(nlogn) unidirectional distributed algorithm for the circular extrema problem, ACM Trans. on Program. Lang. & Systems, 4, (1982), pp. 758-762.
  14. A. Pelc and D. Peleg, Broadcasting with locally bounded Byzantine faults, Inform. Process. Lett. , 93 , (2005), pp. 109--115.
  15. A. Pelc and D. Peleg, Feasibility and Complexity of Broadcasting with Random Transmission Failures, Proc. 24th PODC, 2005.
  16. S. Chechik, M. Langberg, D. Peleg and L. Roditty, Fault-Tolerant Spanners for General Graphs, Proc. 41st STOC, 2009, 435--444.
  17. M. Dinitz and R. Krauthgamer, Fault-tolerant spanners: better and simpler. Proc. PODC 2011, 169-178.
  18. M. Parter and D. Peleg, Sparse Fault-Tolerant BFS Trees, Proc. 21st ESA, 2013.