The Topology of Randomized Symmetry-Breaking Distributed Computing

Keyphrases

• Symmetry Breaking 100%
• Leader Election 100%
• Distributed Computing 100%
• Simplex 66%
• Fault-free 66%
• Algebraic Topology 66%
• Protocol Complexity 66%
• Distributed Systems 33%
• Impossibility Results 33%
• Communication Model 33%
• Simplicial Complex 33%
• Deterministic Algorithm 33%
• Anonymous System 33%
• Greatest Common Divisor 33%
• Random number 33%
• Random Source 33%
• Global Consistency 33%
• Topological Structure 33%
• Nutshell 33%
• Topological Approach 33%
• Message Passing Model 33%
• Correlated Randomness 33%
• Anonymous Shared Memory 33%
• Topological Aspects 33%
• Simplicial Maps 33%
• Number of Parties 33%

Mathematics

• Symmetry Breaking 100%
• Algebraic Topology 100%
• Simplex 100%
• Solvability 100%
• Wide Class 50%
• Necessary and Sufficient Condition 50%
• simplicial complex σ 50%
• Greatest Common Divisor 50%
• Distributed Systems 50%
• Topological Structure 50%
• Simplicial Map 50%
• Output State 50%

Computer Science

• Distributed Computing 100%
• Simplex 66%
• Protocol Complex 66%
• Message Passing 33%
• Distributed Systems 33%
• Shared Memories 33%
• Communication Model 33%
• Random Value 33%
• Sufficient Condition 33%
• Topological Structure 33%
• Simplicial Complex 33%
• Simplicial Map 33%