Everything about Chang and Roberts algorithm

🧭 Start here: a 6-step reading path

1. Read the overview: Chang and Roberts algorithmA 5-minute orientation
2. Pick up a classic book: PreyThe most-reprinted book on the subject
3. Read the landmark paper: Cost distribution of the Chang–Roberts leader election algorithm and related problemsCited 0 times
4. Go sideways: Leader electionA closely related topic
5. Go sideways: Hirschberg–Sinclair algorithmA closely related topic

🏆 Landmark papers (most cited)

• Cost distribution of the Chang–Roberts leader election algorithm and related problems

  Wei-Mei Chen · 2006 · Theoretical Computer Science · 0 citations

📚 Books worth reading

• PreyMichael Crichton · 2002
• Computer applications in pharmaceutical research and developmentSean Ekins · 2006
• 📕Bayesian time series modelsDavid Barber, Ali Taylan Cemgil · 2011
• 📕User centered design for medical visualizationFeng Dong, Sherry Y. Chen · 2008
• Medicine meets virtual reality 13James D. Westwood · 2005
• The challenges of systems biologyGustavo Stolovitzky · 2009
• Artificial neural networks in real-life applicationsJuan Ramon Rabunal · 2005
• Multimedia networkingMahbubur Rahman Syed · 2002

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• Leader election In distributed computing, leader election is the process of designating a single process as the organizer of some task distributed among several computers…
• Hirschberg–Sinclair algorithm The Hirschberg–Sinclair algorithm is a distributed algorithm designed for leader election problem in a synchronous ring network. It is named after its…
• Bully algorithm In distributed computing, the bully algorithm is a method for dynamically electing a coordinator or leader from a group of distributed computer processes…
• Raft (algorithm) Raft is a consensus algorithm designed as an alternative to the Paxos family of algorithms. It was meant to be more understandable than Paxos by means…
• Paxos (computer science) In computer science, Paxos is a family of protocols for solving consensus in a network of unreliable or fallible processors. Consensus is the process of…
• Berkeley algorithm The Berkeley algorithm is a method of clock synchronisation in distributed computing which assumes no machine has an accurate time source. It was developed…
• Consensus (computer science) A fundamental problem in distributed computing and multi-agent systems is to achieve overall system reliability in the presence of a number of faulty processes…
• Rocha–Thatte cycle detection algorithm Rocha–Thatte algorithm is a distributed algorithm in graph theory for detecting cycles on large-scale directed graphs based on the bulk synchronous message…