ViewTube

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

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

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

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

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

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

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

Lecture 11: Cache Consistency: Frangipani 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, ...

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

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

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

Lecture 16: Dynamic Programming, Part 2: LCS, LIS, Coins This is the second of four lectures on dynamic programming.

Lecture 05: Linear Sorting This builds on the lecture on improving find times and discusses how to achieve a faster sort.

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

Lecture 21: Tuning a TSP Algorithm Description: Jon Bentley, retired from Bell Labs Research, discusses the traveling ...

... Search This class covers graph definitions, neighbor sets and adjacencies, graph representations in data structures, and paths.

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

Lecture 13: Dijkstra This class discusses a fourth weighted single-source shortest path algorithm: Dijkstra's algorithms.

Session 5: Dynamic Optimality I Description: Dynamic optimality: Binary search trees, analytic bounds, splay trees, geometric view ...

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

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

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

Problem Session 4 Five example problems are worked. Topics include sequence rotations, drawing sequence trees, binary ...

Session 17: Succinct Structures I Description: Succinct: Rank, select, tries. Speaker: Prof. Erik Demaine Source: OCW MIT ...