Distributed Algorithms
E1452099
UNEXPLORED
Distributed Algorithms is a foundational textbook by Nancy Lynch that rigorously presents the theory, models, and key techniques for designing and analyzing algorithms in distributed systems.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Distributed Algorithms canonical | 2 |
How this entity was disambiguated
This entity first appeared as the object of triple T20836677 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Distributed Algorithms Context triple: [Nancy Lynch, notableWork, Distributed Algorithms]
-
A.
Elements of Distributed Algorithms
Elements of Distributed Algorithms is a foundational textbook that systematically presents the principles, models, and key techniques used in the design and analysis of distributed algorithms.
-
B.
Distributed Systems
Distributed Systems is a foundational computer science textbook that explains the principles, architectures, and algorithms used to design and implement distributed computing environments.
-
C.
"Reaching Agreement in the Presence of Faults"
"Reaching Agreement in the Presence of Faults" is a seminal paper in distributed computing that introduced the Byzantine Generals Problem and laid the foundations for understanding consensus in unreliable, fault-prone systems.
-
D.
EATCS International Symposium on Distributed Computing
The EATCS International Symposium on Distributed Computing is a leading annual academic conference that focuses on the theory, design, analysis, and implementation of distributed systems and algorithms.
-
E.
Fault-Tolerant Parallel Computation
Fault-Tolerant Parallel Computation is a scholarly work in computer science that studies how to design and analyze parallel algorithms and systems that continue to operate correctly despite hardware or process failures.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Distributed Algorithms Target entity description: Distributed Algorithms is a foundational textbook by Nancy Lynch that rigorously presents the theory, models, and key techniques for designing and analyzing algorithms in distributed systems.
-
A.
Elements of Distributed Algorithms
Elements of Distributed Algorithms is a foundational textbook that systematically presents the principles, models, and key techniques used in the design and analysis of distributed algorithms.
-
B.
Distributed Systems
Distributed Systems is a foundational computer science textbook that explains the principles, architectures, and algorithms used to design and implement distributed computing environments.
-
C.
"Reaching Agreement in the Presence of Faults"
"Reaching Agreement in the Presence of Faults" is a seminal paper in distributed computing that introduced the Byzantine Generals Problem and laid the foundations for understanding consensus in unreliable, fault-prone systems.
-
D.
EATCS International Symposium on Distributed Computing
The EATCS International Symposium on Distributed Computing is a leading annual academic conference that focuses on the theory, design, analysis, and implementation of distributed systems and algorithms.
-
E.
Fault-Tolerant Parallel Computation
Fault-Tolerant Parallel Computation is a scholarly work in computer science that studies how to design and analyze parallel algorithms and systems that continue to operate correctly despite hardware or process failures.
- F. None of above. chosen
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.