Distributed Computing Through Combinatorial Topology (Paperback)

I. Fundamentals 1. Introduction 2. Two-Process Systems 3. Elements of Combinatorial Topology

II. Colorless Tasks 4. Colorless Wait-free Computation 5. Solvability of Colorless Tasks 6. Byzantine Colorless Computation 7. Simulations and Reductions

III. General Tasks 8. Read-Write Protocols for General Tasks 9. Manifold Protocols 10. Connectivity 11. Wait-Free Computability for General Tasks

IV. Advanced Topics 12. Renaiming and Oriented Manifolds 13. Task Solvability in Different Communication Models 14. Colored Simulations and Reductions 15. Classifying Loop Agreement Tasks 16. Immediate Snapshot Subdivisions