ConceptSystems & CS
Conflict-free Replicated data types
Conflict-free Replicated Data types are a family of algorithms for convergence that allow several people to concurrently update a document without making any assumptions about the network topology.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Replication2Concurrency1Distributed consensus1Distributed systems1Eventual consistency1Mutable state1Partially ordered systems1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Martin Kleppmann
Lectures that assume it
1Connections
11The lectures that define it or assume it, and the concepts next to it.