ViewTube

Session 1: Persistent Data Structures Description: “Persistence”–remembering all past versions of a data structure (“partial ...

Lecture 1: Introduction MIT 6.824: Distributed Systems (Spring 2020) https://pdos.csail.mit.edu/6.824/

Session 2: Retroactive Data Structures Description: Partial and full retroactivity let us alter and manipulate the order of operations, ...

Lecture 01: Algorithms and Computation The goal of this introductions to algorithms class is to teach you to solve computation ...

Lecture 3: GFS MIT 6.824: Distributed Systems (Spring 2020) https://pdos.csail.mit.edu/6.824/

Lecture 02: Data Structures and Dynamic Arrays Data structures are ways to store data with algorithms that support operations on ...

Lecture 12: Distributed Transactions MIT 6.824: Distributed Systems (Spring 2020) https://pdos.csail.mit.edu/6.824/

Problem Session 1 Four examples of worked problems on the asymptotic behavior of functions and double-ended sequence ...

Lecture 2: RPC and Threads MIT 6.824: Distributed Systems (Spring 2020) https://pdos.csail.mit.edu/6.824/

Quiz 1 Review This session focuses on preparing for the quiz. High-level concepts are discussed and example problems are ...

Lecture Videos Session 12: Fusion Trees Description: Fusion trees: Sketching, parallel comparison, most significant set bit.

Session 21: Dynamic Connectivity Lower Bound Description: Dynamic graphs: Ω(lg n) lower bound for dynamic connectivity.

Session 4: Geometric Structures II Description: Fractional cascading in 3D orthogonal range searching in O(log n) time. Moving ...

Lecture 9: More Replication, CRAQ MIT 6.824: Distributed Systems (Spring 2020) https://pdos.csail.mit.edu/6.824/

Session 18: Succinct Structures II Description: Succinct: Compact suffix arrays and trees. Speaker: Prof. Erik Demaine Source: ...

Session 16: Strings Description: Strings: Suffix tree, suffix array, linear-time construction for large alphabets, suffix tray, document ...

Session 11: Integer Models Description: Integer: Models, predecessor problem, van Emde Boas, x-fast and y-fast trees, indirection ...

Session 14: Sorting in Linear Time Description: Integer: Sorting in linear time for w = O(lg2+ε n), priority queues. Speaker: Prof.

Lecture 5: Go, Threads, and Raft MIT 6.824: Distributed Systems (Spring 2020) https://pdos.csail.mit.edu/6.824/

Lecture 8: Zookeeper MIT 6.824: Distributed Systems (Spring 2020) https://pdos.csail.mit.edu/6.824/