6006-11F/lecture-10-open-addressing-cryptographic-hashing.rvdJDijO2Ro.srt
6006-11F/lecture-11-integer-arithmetic-karatsuba-multiplication.eCaXlAaN2uE.srt
6006-11F/lecture-12-square-roots-newtons-method.2YeJ-5UAke8.srt
6006-11F/lecture-13-breadth-first-search-bfs.s-CYnVz-uh4.srt
6006-11F/lecture-14-depth-first-search-dfs-topological-sort.AfSk24UTFS8.srt
6006-11F/lecture-15-single-source-shortest-paths-problem.Aa2sqUhIn-E.srt
6006-11F/lecture-16-dijkstra.2E7MmKv0Y24.srt
6006-11F/lecture-17-bellman-ford.ozsuci5pIso.srt
6006-11F/lecture-19-dynamic-programming-i-fibonacci-shortest-paths.OQ5jsbhAv_M.srt
6006-11F/lecture-1-algorithmic-thinking-peak-finding.HtSuA80QTyo.srt
6006-11F/lecture-20-dynamic-programming-ii-text-justification-blackjack.ENyox7kNKeY.srt
6006-11F/lecture-21-dp-iii-parenthesization-edit-distance-knapsack.ocZMDMZwhCY.srt
6006-11F/lecture-22-dp-iv-guitar-fingering-tetris-super-mario-bros.tp4_UXaVyx8.srt
6006-11F/lecture-23-computational-complexity.moPtwq_cVH8.srt
6006-11F/lecture-24-topics-in-algorithms-research.dU40AvBURDQ.srt
6006-11F/lecture-2-models-of-computation-document-distance.Zc54gFhdpLA.srt
6006-11F/lecture-3-insertion-sort-merge-sort.Kg4bqzAqRBM.srt
6006-11F/lecture-4-heaps-and-heap-sort.B7hVxCmfPtM.srt
6006-11F/lecture-5-binary-search-trees-bst-sort.9Jry5-82I68.srt
6006-11F/lecture-6-avl-trees-avl-sort.FNeL18KsWPc.srt
6006-11F/lecture-7-counting-sort-radix-sort-lower-bounds-for-sorting.Nz1KZXbghj8.srt
6006-11F/lecture-8-hashing-with-chaining.0M_kIqhwbFo.srt
6006-11F/lecture-9-table-doubling-karp-rabin.BRO7mVIFt08.srt
602-12F/lecture-17-Packet-switching.9HCUnJB9ovk.txt
602-12F/lecture-18-MAC-protocols.y02p8znNAKk.txt
602-12F/lecture-19-Network-routing-without-failures.2QxgN2ugcMY.txt
602-12F/lecture-20-Network-routing-with-failures.EG6PPYma050.txt
602-12F/lecture-21-Reliable-Transport.qpYjftJbGYI.txt
602-12F/lecture-22-Sliding-window-analysis-Little-s-law.xa38Q2_pnlQ.txt
602-12F/lecture-23-brief-history-of-the-Internet.oIezCGjxV3A.txt
6033S05/Lecture-04-Naming.zm2VP0kHl1M.srt
6033S05/Lecture-05-Fault-isolation-with-clients-and-servers.RmdAWsvcsZw.srt
6033S05/Lecture-06-Virtualization--virtual-memory.TPeKtQykujI.srt
6033S05/Lecture-07-Virtual-processors--threads-and-coordination.vMJshx7SO6Y.srt
6033S05/Lecture-08-Performance.RR6DHXgT_5E.srt
6033S05/Lecture-09-Introduction-to-networks.uKYAcK2JXo0.srt
6033S05/Lecture-12-End-to-end-layer.Z2ENBilJWN0.srt
6033S05/Lecture-13-Congestion-control.HxOA8HrVzPg.srt
6033S05/Lecture-14-Distributed-naming.PcPSF8kdgAQ.srt
6033S05/Lecture-15-Reliability.Tpnla9TdOyY.srt
6033S05/Lecture-16-Atomicity-concepts.Oo4iCE48xCc.srt
6033S05/Lecture-17-Recoverability.s_fjGI6PSI8.srt
6033S05/Lecture-20-Multi-site-atomicity.o-orfTyTXow.srt
6033S05/Lecture-21-Security-introduction.SCpzazvhXaU.srt
6033S05/Lecture-22-Authentication.xEgcKKE9GmA.srt
6033S05/Lecture-23-Authorization-and-confidentiality.mBd1nntUgHc.srt
6033S05/Lecture-25-Complex--trusted-systems.TXgH4G81iH0.srt
6041-10F/lecture-10-continuous-bayes-rule-derived-distributions.H_k1w3cfny8.srt
6041-10F/lecture-13-bernoulli-process.gMTiAeE0NCw.srt
6041-10F/lecture-15-poisson-process-ii.XsYXACeIklU.srt
6041-10F/lecture-16-markov-chains-i.IkbkEtOOC1Y.srt
6041-10F/lecture-17-markov-chains-ii.ZulMqrvP-Pk.srt
6041-10F/lecture-18-markov-chains-iii.HIMxdWDLEK8.srt
6041-10F/lecture-1-probability-models-and-axioms.j9WZyLZCBzs.srt
6041-10F/lecture-20-the-central-limit-theorem.Tx7zzD4aeiA.srt
6041-10F/lecture-21-bayesian-statistical-inference-i.1jDBM9UM9xk.srt
6041-10F/lecture-22-bayesian-statistical-inference-ii.XtNXQJkgkhI.srt
6041-10F/lecture-23-classical-statistical-inference-i.4UJc0S8APm4.srt
6041-10F/lecture-24-classical-inference-ii.tBUHRpFZy0s.srt
6041-10F/lecture-25-classical-inference-iii-course-overview.rYefUsYuEp0.srt
6041-10F/lecture-2-conditioning-and-bayes-rule.TluTv5V0RmE.srt
6041-10F/lecture-3-independence.19Ql_Q3l0GA.srt
6041-10F/lecture-4-counting.6oV3pKLgW2I.srt
6041-10F/lecture-5-discrete-variables-probability-expectations.3MOahpLxj6A.srt
6041-10F/lecture-6-discrete-random-variable-examples-joint-pmfs.-qCEoqpwjf4.srt
6041-10F/lecture-7-multiple-variables-expectations-independence.EObHWIEKGjA.srt
6041-10F/lecture-8-continuous-random-variables.mHfn_7ym6to.srt
6041-10F/lecture-9-multiple-continuous-random-variables.CadZXGNauY0.srt
6042S15/000001.proofs.tp1-1.welcome-to-6-042-1.wIq4CssPoO0.srt
6042S15/000003.proofs.tp1-1.intro-to-proofs-part-2-video.intro-to-proofs-part-2.wfr4XbR5VP8.srt
6042S15/000007.proofs.tp2-1.vertical-735460178366.well-ordering-principle-2.I1HpgnWQI7I.srt
6042S15/000008.proofs.tp2-1.vertical-4bb7930de7ec.well-ordering-principle-3.hNrtGiCFPGs.srt
6042S15/000012.proofs.tp3-1.predicate-logic-1.UroprmQHTLc.srt
6042S15/000013.proofs.tp3-1.vertical-7b4a11771cb1.predicate-logic-2.T1AtlGrCoU8.srt
6042S15/000017.proofs.tp3-3.relations.FkfsmwAtDdY.srt
6042S15/000018.proofs.tp3-3.vertical-360a6e85d0f4.relational-mappings.gFD1Lp6zK3w.srt
6042S15/000019.proofs.tp3-3.vertical-aecd80da5c9a.finite-cardinality.fpy5Hsz5t6E.srt
6042S15/000024.proofs.tp4-2.state-machines-invariants.VuG2JNcRXYg.srt
6042S15/000030.proofs.tp4-3.countable-sets-video.countable-sets.AipSRi3CyLg.srt
6042S15/000031.proofs.tp4-3.vertical-4eaa04fd577b.cantor-s-theorem.4dj1ogUwTEM.srt
6042S15/000032.proofs.tp4-3.vertical-b654b1f1c6e1.the-halting-problem.WQHOImO0pX0.srt
6042S15/000039.struc.tp5-1.revisiting-die-hard-video.die-hard-primes.c3qNBNl1h8g.srt
6042S15/000040.struc.tp5-1.prime-factorization-video.unique-factorization.QsKtEuUyIdw.srt
6042S15/000043.struc.tp6-1.modular-exponentiation-euler-s-function.TeRYL7kkhqs.srt
6042S15/000044.struc.tp6-1.vertical-96037fd2d933.modular-exponentiation-the-ring.dZgI16nMuqE.srt
6042S15/000045.struc.tp6-2.rsa-public-key-encryption.ZUZ8VbX1YNQ.srt
6042S15/000049.struc.tp7-1.digraphs-dags.Sdw8_0RDZuw.srt
6042S15/000055.struc.tp7-2.degrees.TIpnudrzvgg.srt
6042S15/000057.struc.tp7-3.coloring.Penh4mv5gAg.srt
6042S15/000068.count.tp8-2.arithmetic-sums.v6axtBS6IF8.srt
6042S15/000071.count.tp8-2.vertical-65e8069d3ac4.integral-method.EegG5TPL29c.srt
6042S15/000076.count.tp9-1.sum-and-product-rules.yTrtVwKZkwU.srt
6042S15/000077.count.tp9-1.vertical-96a6db418419.bijections.n0lce1dMAh8.srt
6042S15/000078.count.tp9-2.generalized-count-rules.iDfyX8WRIyM.srt
6042S15/000079.count.tp9-2.vertical-cb7317c8f4ec.two-pair-poker-hands.HswnmlLPGZ4.srt
6042S15/000081.count.tp9-2.vertical-436d8f042056.bookkeeper-rule-multinomial-theorem.juGgfHsO-xM.srt
6042S15/000082.count.tp10-1.the-pigeonhole-principle.4Dz4vNUxnZM.srt
6042S15/000083.count.tp10-1.vertical-6d18e84b97d0.inclusion-exclusion-example.51-b2mgZVNY.srt
6042S15/000084.count.tp10-1.vertical-d7d25ffeb295.inclusion-exclusion-2-sets.nwpzBE9IwJQ.srt
6042S15/000085.proba.tp11-2.tree-model.dEsFEK4vnV4.srt
6042S15/000086.proba.tp11-2.vertical-65858dc50455.simplified-monty-hall-tree.L30HPgryd6I.srt
6042S15/000087.proba.tp11-2.vertical-7e0be1baca38.sample-spaces.Amd_bNYzgUw.srt
6042S15/000089.proba.tp12-1.vertical-4689ff047559.law-of-total-proba.F3y8qupFfUs.srt
6042S15/000093.proba.tp12-2.vertical-9c80216b7495.mutual-independence.wJzBU7Do1ls.srt
6042S15/000095.proba.tp12-3.vertical-af2ad400f984.random-variables-independence.VJzv6WJTtNc.srt
6042S15/000097.proba.tp13-1.expectation.YVQdVzSkcmQ.srt
6042S15/000100.proba.tp13-1.vertical-e8dee31ddd76.mean-time-to-failure.Dqx56lZ_icg.srt
6042S15/000101.proba.tp13-1.vertical-49ea207a6233.linearity-of-expectation.KFcodn4qfrQ.srt
6042S15/000105.proba.tp13-2.vertical-0646c16ad916.variance.o57CTwt1-ck.srt
6042S15/000106.proba.tp14-1.law-of-large-numbers.-yo3YxfY47g.srt
6042S15/000108.proba.tp14-1.vertical-82840a0ba306.birthday-matching.TWVntUfXsKs.srt
6042S15/000109.proba.tp14-1.vertical-83cee7032f8c.sampling-confidence.Q-6Cw8tYVeY.srt
6042S15/000111.proba.random-walks-pagerank.stationary-distributions-video.stationary-distributions.iZX8WEGZTVw.srt
6042S15/UroprmQHTLc.srt
6046-15S/lecture-10-dynamic-programming-advanced-dp.Tw1k46ywN6E.srt
6046-15S/lecture-11-dynamic-programming-all-pairs-shortest-paths.NzgFUwOaoIw.srt
6046-15S/lecture-12-greedy-algorithms-minimum-spanning-tree.tKwnms5iRBU.srt
6046-15S/lecture-13-incremental-improvement-max-flow-min-cut.VYZGlgzr_As.srt
6046-15S/lecture-14-incremental-improvement-matching.8C_T4iTzPCU.srt
6046-15S/lecture-15-linear-programming-lp-reductions-simplex.WwMz2fJwUCg.srt
6046-15S/lecture-16-complexity-p-np-np-completeness-reductions.eHZifpgyH_4.srt
6046-15S/lecture-17-complexity-approximation-algorithms.MEz1J9wY2iM.srt
6046-15S/lecture-19-synchronous-distributed-algorithms-symmetry-breaking.-shortest-paths-spanning-trees.mUBmcbbJNf4.srt
6046-15S/lecture-1-course-overview-interval-scheduling.2P-yW7LQr08.srt
6046-15S/lecture-20-asynchronous-distributed-algorithms-shortest-paths-spanning-trees.kQ-UQAzcnzA.srt
6046-15S/lecture-21-cryptography-hash-functions.KqqOXndnvic.srt
6046-15S/lecture-23-cache-oblivious-algorithms-medians-matrices.1409658.srt
6046-15S/lecture-24-cache-oblivious-algorithms-searching-sorting.C6EWVBNCxsc.srt
6046-15S/lecture-2-divide-conquer-convex-hull-median-finding.EzeYI7p9MjU.srt
6046-15S/lecture-3-divide-conquer-fft.iTMn0Kt18tg.srt
6046-15S/lecture-5-amortization-amortized-analysis.3MpzavN3Mco.srt
6046-15S/lecture-6-randomization-matrix-multiply-quicksort.cNB2lADK3_s.srt
6046-15S/lecture-7-randomization-skip-lists.2g9OSRKJuzM.srt
6046-15S/lecture-8-randomization-universal-perfect-hashing.z0lJ2k0sl1g.srt
6046-15S/lecture-9-augmentation-range-trees.xVka6z1hu-I.srt
6046-15S/recitation-10-distributed-algorithms.w_-SX4vR53M.srt
6046-15S/recitation-11-cryptography-more-primitives.ZLOhV4XQ_tI.srt
6046-15S/recitation-5-dynamic-programming-more-examples.krZI60lKPek.srt
6046-15S/recitation-6-greedy-algorithms-more-examples.-QcPo_DWJk4.srt
6046-15S/recitation-8-complexity-more-reductions.G7mqtB6npfE.srt
6046-15S/recitation-9-complexity-approximations.zM5MW5NKZJg.srt
6-046j-fall-2005/lecture-10-red-black-trees-rotations-insertions-deletions.O3hI9FdxFOM.srt
6-046j-fall-2005/lecture-12-skip-lists.kBwUoWpeH_Q.srt
6-046j-fall-2005/lecture-13-amortized-algorithms-table-doubling-potential-method.qh5lSHCBiRs.srt
6-046j-fall-2005/lecture-14-competitive-analysis-self-organizing-lists.2RxCCEHlEys.srt
6-046j-fall-2005/lecture-16-greedy-algorithms-minimum-spanning-trees.FPEMBWg_WlY.srt
6-046j-fall-2005/lecture-18-shortest-paths-ii-bellman-ford-linear-programming-difference-constraints.Ttezuzs39nk.srt
6-046j-fall-2005/lecture-19-shortest-paths-iii-all-pairs-shortest-paths-matrix-multiplication-floyd-warshall-johnson.Sygq1e0xWnM.srt
6-046j-fall-2005/lecture-1-administrivia-introduction-analysis-of-algorithms-insertion-sort-mergesort.JPyuH4qXLZ0.srt
6-046j-fall-2005/lecture-22-advanced-topics.PYvJmLKhM-Y.srt
6-046j-fall-2005/lecture-24-advanced-topics-cont..cJOHERGcGm4.srt
6-046j-fall-2005/lecture-25-advanced-topics-cont.-discussion-of-follow-on-classes.zjUDy6a5vx4.srt
6-046j-fall-2005/lecture-3-divide-and-conquer-strassen-fibonacci-polynomial-multiplication.-EQTVuAhSFY.srt
6-046j-fall-2005/lecture-5-linear-time-sorting-lower-bounds-counting-sort-radix-sort.0VqawRl3Xzs.srt
6-046j-fall-2005/lecture-6-order-statistics-median.mR_RUjsJnV8.srt
6-046j-fall-2005/lecture-7-hashing-hash-functions.JZHBa-rLrBA.srt
6-046j-fall-2005/lecture-8-universal-hashing-perfect-hashing.s7QSM_hlS1U.srt
6-046j-fall-2005/lecture-9-relation-of-bsts-to-quicksort-analysis-of-random-bst.vgELyZ9LXX4.srt
Binary file zip/6-006-fall-2011.zip matches
Binary file zip/6-046j-fall-2005.zip matches
cop5536_2005/01.Amortized-complexity.txt
cop5536_2005/02.Amortized-complexity.txt
cop5536_2005/03.Introduction-to-external-sorting.txt
cop5536_2005/04.Introduction-to-external-sorting.txt
cop5536_2005/05.Selection-trees-and-k-way-merging.TG0a1s1lpwg.txt
cop5536_2005/08.Buffering.qpw0LPZ-EVo.txt
cop5536_2005/10.Double-ended-priority-queues.-Interval-heaps.mReloWJA0_4.txt
cop5536_2005/11.Leftist-trees.SWwFs_QTTnA.txt
cop5536_2005/12.Binomial-heaps.pOiBT34VOpw.txt
cop5536_2005/13.2005.0923F.Binomial-heaps.3pfTlwIv5fg.txt
cop5536_2005/14.2005.0926M.Fibonacci-heaps.MhcfwKZ-kiY.txt
cop5536_2005/17.2005.1005W.Optimal-Binary-Search-Trees.gtC8PvURDa0.txt
cop5536_2005/18.2005.1010M.AVL-trees.9KDJwQmWDho.txt
cop5536_2005/19.2005.1012W.AVL-trees.I9zzK6_7z3s.txt
cop5536_2005/20.2005.1014F.Red-black-trees.Ie8jB16gwwU.txt
cop5536_2005/21.2004.0227F.COP5536-23T-rm-flvoutput.Z86Am7IYypQ.txt
cop5536_2005/21.2005.1017M.Red-black-trees.wH0JQvG2WhU.txt
cop5536_2005/22.2004.0301M.COP5536-234T-rm-flvoutput.66fvg5K0LPc.txt
cop5536_2005/22.2005.1019W.B-trees._d8L0Q8vk-g.txt
cop5536_2005/23.2004.0303W.COP5536-rb-rm-flvoutput.So8p5c3Zhh0.txt
cop5536_2005/23.2005.1021F.B-trees.P4M-0ZuKQ5I.txt
cop5536_2005/25.2005.1026W.Splay-trees.qmQqI81YDx0.txt
cop5536_2005/26.2005.1028F.Splay-Trees.ILPqap_ZtsA.txt
cop5536_2005/29.2019.1107M.Tries-and-Packet-Forwarding.fVbmySeYbrU.txt
cop5536_2005/30.2005.1109W.High-order-Tries.885sanfDmtk.txt
cop5536_2005/31.2005.1114M.Suffix-Trees.I-mc3Lxmor8.txt
cop5536_2005/32.2005.1116W.Bloom-Filters.JSNdKrEaKKA.txt
cop5536_2005/33.2005.1118F.Segment-Trees.FATwhzX-ouU.txt
cop5536_2005/34.2005.1121M.Interval-Trees.r2PnhxMMDnE.txt
cop5536_2005/35.2005.1123W.Priority-Search-Trees.vqty9T1ncUw.txt
cop5536_2005/36.2005.1128M.Priority-Search-Trees.cak1ueKSvfM.txt
cop5536_2005/37.2005.1130W.Multidimensional-Search-Trees.dIVEfeZGYl0.txt
cop5536_2005/38.2005.1206.Quad-Trees.D2Mw5rWaD0I.txt
Lessons-from-AlphaZero.KTH.WQS7933ub9s.txt
MIT1806S05/10. The Four Fundamental Subspaces-nHlE7EgJFds.en.vtt
MIT1806S05/11. Matrix Spaces; Rank 1; Small World Graphs-2IdtqGM6KWU.en.vtt
MIT1806S05/12. Graphs, Networks, Incidence Matrices-6-wh6yvk6uc.en.vtt
MIT1806S05/15. Projections onto Subspaces-Y_Ac6KiQ1t0.en.vtt
MIT1806S05/16. Projection Matrices and Least Squares-osh80YCg_GM.en.vtt
MIT1806S05/19. Determinant Formulas and Cofactors-23LLB9mNJvc.en.vtt
MIT1806S05/21. Eigenvalues and Eigenvectors-cdZnhQjJu4I.en.vtt
MIT1806S05/22. Diagonalization and Powers of A-13r9QY6cmjc.en.vtt
MIT1806S05/24. Markov Matrices; Fourier Series-lGGDIGizcQ0.en.vtt
MIT1806S05/26. Complex Matrices; Fast Fourier Transform-M0Sa8fLOajA.en.vtt
MIT1806S05/28. Similar Matrices and Jordan Form-TSdXJw83kyA.en.vtt
MIT1806S05/31. Change of Basis; Image Compression-0h43aV4aH7I.en.vtt
MIT1806S05/32. Quiz 3 Review-HgC1l_6ySkc.en.vtt
MIT1806S05/3. Multiplication and Inverse Matrices-FX4C-JpTFgY.en.vtt
MIT1806S05/5. Transposes, Permutations, Spaces R^n-JibVXBElKL0.en.vtt
MIT1806S05/7. Solving Ax = 0 - Pivot Variables, Special Solutions-VqP2tREMvt0.en.vtt
MIT1806S05/8. Solving Ax = b - Row Reduced Form R-9Q1q7s1jTzU.en.vtt
MIT1806S05/An Interview with Gilbert Strang on Teaching Linear Algebra-7UJ4CFRGd-U.en.vtt
MIT1806SCF11/10. The Four Fundamental Subspaces-nHlE7EgJFds.en.vtt
MIT1806SCF11/11. Matrix Spaces; Rank 1; Small World Graphs-2IdtqGM6KWU.en.vtt
MIT1806SCF11/12. Graphs, Networks, Incidence Matrices-6-wh6yvk6uc.en.vtt
MIT1806SCF11/15. Projections onto Subspaces-Y_Ac6KiQ1t0.en.vtt
MIT1806SCF11/16. Projection Matrices and Least Squares-osh80YCg_GM.en.vtt
MIT1806SCF11/19. Determinant Formulas and Cofactors-23LLB9mNJvc.en.vtt
MIT1806SCF11/21. Eigenvalues and Eigenvectors-cdZnhQjJu4I.en.vtt
MIT1806SCF11/22. Diagonalization and Powers of A-13r9QY6cmjc.en.vtt
MIT1806SCF11/24. Markov Matrices; Fourier Series-lGGDIGizcQ0.en.vtt
MIT1806SCF11/26. Complex Matrices; Fast Fourier Transform-M0Sa8fLOajA.en.vtt
MIT1806SCF11/28. Similar Matrices and Jordan Form-TSdXJw83kyA.en.vtt
MIT1806SCF11/31. Change of Basis; Image Compression-0h43aV4aH7I.en.vtt
MIT1806SCF11/32. Quiz 3 Review-HgC1l_6ySkc.en.vtt
MIT1806SCF11/3. Multiplication and Inverse Matrices-FX4C-JpTFgY.en.vtt
MIT1806SCF11/5. Transposes, Permutations, Spaces R^n-JibVXBElKL0.en.vtt
MIT1806SCF11/7. Solving Ax = 0 - Pivot Variables, Special Solutions-VqP2tREMvt0.en.vtt
MIT1806SCF11/8. Solving Ax = b - Row Reduced Form R-9Q1q7s1jTzU.en.vtt
MIT1806SCF11/An Interview with Gilbert Strang on Teaching Linear Algebra-7UJ4CFRGd-U.en.vtt
MIT1806SCF11/Geometry of Linear Algebra-My5w4MXWBew.en.vtt
MIT1806SCF11/Graphs and Networks-h0m2tsmSPTI.en.vtt
MIT1806SCF11/Rec 1 _ MIT 18.085 Computational Science and Engineering I, Fall 2008-0oBJN8F616U.en.vtt
MIT1806SCF11/Symmetric Matrices and Positive Definiteness-lpnY5QVjU5w.en.vtt
MIT18404F20/10. Computation History Method-MGqoLm2aAgc.en.srt
MIT18404F20/10. Computation History Method-MGqoLm2aAgc.en.vtt
MIT18404F20/11. Recursion Theorem and Logic-N-_XmLanPYg.en.srt
MIT18404F20/11. Recursion Theorem and Logic-N-_XmLanPYg.en.vtt
MIT18404F20/12. Time Complexity-asjAc90L8rE.en.srt
MIT18404F20/12. Time Complexity-asjAc90L8rE.en.vtt
MIT18404F20/14. P and NP, SAT, Poly-Time Reducibility-1VhnDdQsELo.en.srt
MIT18404F20/14. P and NP, SAT, Poly-Time Reducibility-1VhnDdQsELo.en.vtt
MIT18404F20/15. NP-Completeness-iZPzBHGDsWI.en.srt
MIT18404F20/15. NP-Completeness-iZPzBHGDsWI.en.vtt
MIT18404F20/17. Space Complexity, PSPACE, Savitch's Theorem-cT_qwkTigv4.en.srt
MIT18404F20/17. Space Complexity, PSPACE, Savitch's Theorem-cT_qwkTigv4.en.vtt
MIT18404F20/18. PSPACE-Completeness-aVv9WXwW95w.en.srt
MIT18404F20/18. PSPACE-Completeness-aVv9WXwW95w.en.vtt
MIT18404F20/19. Games, Generalized Geography-4dFPVJrNLDs.en.srt
MIT18404F20/19. Games, Generalized Geography-4dFPVJrNLDs.en.vtt
MIT18404F20/1. Introduction, Finite Automata, Regular Expressions-9syvZr-9xwk.en.srt
MIT18404F20/1. Introduction, Finite Automata, Regular Expressions-9syvZr-9xwk.en.vtt
MIT18404F20/20. L and NL, NL = coNL-q3xvno_KgRY.en.srt
MIT18404F20/20. L and NL, NL = coNL-q3xvno_KgRY.en.vtt
MIT18404F20/21. Hierarchy Theorems-vqFRAWeEcUs.en.srt
MIT18404F20/21. Hierarchy Theorems-vqFRAWeEcUs.en.vtt
MIT18404F20/22. Provably Intractable Problems, Oracles-N32bnUliSzo.en.srt
MIT18404F20/22. Provably Intractable Problems, Oracles-N32bnUliSzo.en.vtt
MIT18404F20/24. Probabilistic Computation (cont.)-7J1HD9rqEB4.en.srt
MIT18404F20/24. Probabilistic Computation (cont.)-7J1HD9rqEB4.en.vtt
MIT18404F20/25. Interactive Proof Systems, IP-TSI3LR5WZmo.en.srt
MIT18404F20/25. Interactive Proof Systems, IP-TSI3LR5WZmo.en.vtt
MIT18404F20/26. coNP is a subset of IP-eEXSv0jChO4.en.srt
MIT18404F20/26. coNP is a subset of IP-eEXSv0jChO4.en.vtt
MIT18404F20/2. Nondeterminism, Closure Properties, Conversion of Regular Expressions to FA-oNsscmUwjMU.en.srt
MIT18404F20/2. Nondeterminism, Closure Properties, Conversion of Regular Expressions to FA-oNsscmUwjMU.en.vtt
MIT18404F20/3. Regular Pumping Lemma, Conversion of FA to Regular Expressions-KAySmSEGc9U.en.srt
MIT18404F20/3. Regular Pumping Lemma, Conversion of FA to Regular Expressions-KAySmSEGc9U.en.vtt
MIT18404F20/4. Pushdown Automata, Conversion of CFG to PDA and Reverse Conversion-m9eHViDPAJQ.en.srt
MIT18404F20/4. Pushdown Automata, Conversion of CFG to PDA and Reverse Conversion-m9eHViDPAJQ.en.vtt
MIT18404F20/5. CF Pumping Lemma, Turing Machines-IycOPFmEQk8.en.srt
MIT18404F20/5. CF Pumping Lemma, Turing Machines-IycOPFmEQk8.en.vtt
MIT18404F20/6. TM Variants, Church-Turing Thesis-TTArY7ojshU.en.srt
MIT18404F20/6. TM Variants, Church-Turing Thesis-TTArY7ojshU.en.vtt
MIT18404F20/7. Decision Problems for Automata and Grammars-4MgN6uxd4i4.en.srt
MIT18404F20/7. Decision Problems for Automata and Grammars-4MgN6uxd4i4.en.vtt
MIT18404F20/8. Undecidability-3PzuSPQPEU4.en.srt
MIT18404F20/8. Undecidability-3PzuSPQPEU4.en.vtt
MIT18404F20/9. Reducibility-N28g_YBXY8Y.en.srt
MIT18404F20/9. Reducibility-N28g_YBXY8Y.en.vtt
MIT18_650F16/srt/lecture-01-Introduction-to-Statistics.VPZD_aij8H0.srt
MIT18_650F16/srt/lecture-02-Introduction-to-Statistics-cont.C_W1adH-NVE.srt
MIT18_650F16/srt/lecture-03-Parametric-Inference.TSkDZbGS94k.srt
MIT18_650F16/srt/lecture-04-Parametric-Inference-cont-Maxi.rLlZpnT02ZU.srt
MIT18_650F16/srt/lecture-05-Maximum-Likelihood-Estimation-cont.0Va2dOLqUfM.srt
MIT18_650F16/srt/lecture-07-Parametric-Hypothesis-Testing.phbw9r1iUDI.srt
MIT18_650F16/srt/lecture-08-Parametric-Hypothesis-Testing-cont.4HRhg4eUiMo.srt
MIT18_650F16/srt/lecture-09-Parametric-Hypothesis-Testing-cont.QXkOaifVfW4.srt
MIT18_650F16/srt/lecture-11-Parametric-Hypothesis-Testing-cont-Testing-Goodn.a66tfLdr6oY.srt
MIT18_650F16/srt/lecture-12-Testing-Goodness-of-Fit-cont.vMaKx9fmJHE.srt
MIT18_650F16/srt/lecture-13-Regression.yP1S37BiEsQ.srt
MIT18_650F16/srt/lecture-14-Regression-cont.JBIz7UadY5M.srt
MIT18_650F16/srt/lecture-15-Regression-cont.V4xOdtqic3o.srt
MIT18_650F16/srt/lecture-17-Bayesian-Statistics.bFZ-0FH5hfs.srt
MIT18_650F16/srt/lecture-18-Bayesian-Statistics-cont.k2inA31Gups.srt
MIT18_650F16/srt/lecture-19-Principal-Component-Analysis.WW3ZJHPwvyg.srt
MIT18_650F16/srt/lecture-20-Principal-Component-Analysis-cont.a1ZCeFpeW0o.srt
MIT18_650F16/srt/lecture-24-Generalized-Linear-Models-cont.lWW54ts9Ubo.srt
MIT6004F18/L10.Procedures-and-Stacks.8Vh-pZDIQ3c.srt.txt
MIT6004F18/L20.Virtual-Memory.W7Scg6LfZhY.srt.txt
MIT6004F18/L21.IO-and-System-Calls.ReRj0Ww0TU4.srt.txt
MIT6004F18/L22.Complex-Pipelines-and-Branch-Pred.-4Fg9vMcKJo.srt.txt
MIT6004F18/L23.Bypassing-and-EHRs.dhJnFvCWw-E.srt.txt
MIT6004F18/L24.Synchronization.JzzE7W3ZPXw.srt.txt
MIT6004F18/L26.Early-Stored-Progr.Evol.Instr.kxJkWWJ1bbU.srt.txt
MIT6172F18/10. Measurement and Timing-LvX3g45ynu8.en.srt
MIT6172F18/10. Measurement and Timing-LvX3g45ynu8.en.vtt
MIT6172F18/11. Storage Allocation-nmMUUuXhk2A.en.srt
MIT6172F18/11. Storage Allocation-nmMUUuXhk2A.en.vtt
MIT6172F18/12. Parallel Storage Allocation-d5e_YJGXXFU.en.srt
MIT6172F18/12. Parallel Storage Allocation-d5e_YJGXXFU.en.vtt
MIT6172F18/13. The Cilk Runtime System-Z7r4aAZ9Vqo.en.srt
MIT6172F18/13. The Cilk Runtime System-Z7r4aAZ9Vqo.en.vtt
MIT6172F18/14. Caching and Cache-Efficient Algorithms-xDKnMXtZKq8.en.srt
MIT6172F18/14. Caching and Cache-Efficient Algorithms-xDKnMXtZKq8.en.vtt
MIT6172F18/15. Cache-Oblivious Algorithms-xwE568oVQ1Y.en.srt
MIT6172F18/15. Cache-Oblivious Algorithms-xwE568oVQ1Y.en.vtt
MIT6172F18/1. Introduction and Matrix Multiplication-o7h_sYMk_oc.en.srt
MIT6172F18/1. Introduction and Matrix Multiplication-o7h_sYMk_oc.en.vtt
MIT6172F18/20. Speculative Parallelism & Leiserchess-gyaqXwi4BDk.en.srt
MIT6172F18/20. Speculative Parallelism & Leiserchess-gyaqXwi4BDk.en.vtt
MIT6172F18/21. Tuning a TSP Algorithm-SS5KfIFzfEE.en.srt
MIT6172F18/21. Tuning a TSP Algorithm-SS5KfIFzfEE.en.vtt
MIT6172F18/22. Graph Optimization-IT_4fw6gfJw.en.srt
MIT6172F18/22. Graph Optimization-IT_4fw6gfJw.en.vtt
MIT6172F18/23. High Performance in Dynamic Languages-6JcMuFgnA6U.en.srt
MIT6172F18/23. High Performance in Dynamic Languages-6JcMuFgnA6U.en.vtt
MIT6172F18/2. Bentley Rules for Optimizing Work-H-1-X9bkop8.en.srt
MIT6172F18/2. Bentley Rules for Optimizing Work-H-1-X9bkop8.en.vtt
MIT6172F18/3. Bit Hacks-ZusiKXcz_ac.en.srt
MIT6172F18/3. Bit Hacks-ZusiKXcz_ac.en.vtt
MIT6172F18/4. Assembly Language & Computer Architecture-L1ung0wil9Y.en.srt
MIT6172F18/4. Assembly Language & Computer Architecture-L1ung0wil9Y.en.vtt
MIT6172F18/5. C to Assembly-wt7a5BOztuM.en.srt
MIT6172F18/5. C to Assembly-wt7a5BOztuM.en.vtt
MIT6172F18/6. Multicore Programming-dx98pqJvZVk.en.srt
MIT6172F18/6. Multicore Programming-dx98pqJvZVk.en.vtt
MIT6172F18/7. Races and Parallelism-a_R_DpsENfk.en.srt
MIT6172F18/7. Races and Parallelism-a_R_DpsENfk.en.vtt
MIT6172F18/8. Analysis of Multithreaded Algorithms-6I26_r1BKd8.en.srt
MIT6172F18/8. Analysis of Multithreaded Algorithms-6I26_r1BKd8.en.vtt
MIT6172F18/9. What Compilers Can and Cannot Do-ulJm7_aTiQM.en.srt
MIT6172F18/9. What Compilers Can and Cannot Do-ulJm7_aTiQM.en.vtt
MIT6824S20/lecture-01-Introduction.cQP8WApzIQQ.srt.txt
MIT6824S20/lecture-02-RPC-and-Threads.gA4YXUJX7t8.srt.txt
MIT6824S20/lecture-03-GFS.EpIgvowZr00.srt.txt
MIT6824S20/lecture-04-Primary-Backup-Replication.M_teob23ZzY.srt.txt
MIT6824S20/lecture-05-Go-Threads-and-Raft.UzzcUS2OHqo.srt.txt
MIT6824S20/lecture-06-Fault-Tolerance_Raft.64Zp3tzNbpE.srt.txt
MIT6824S20/lecture-07-Fault-Tolerance_Raft-2.4r8Mz3MMivY.srt.txt
MIT6824S20/lecture-08-Zookeeper.pbmyrNjzdDk.srt.txt
MIT6824S20/lecture-09-More-Replication-CRAQ.IXHzbCuADt0.srt.txt
MIT6824S20/lecture-10-Cloud-Replicated-DB-Aurora.jJSh54J1s5o.srt.txt
MIT6824S20/lecture-11-Cache-Consistency-Frangipani.-pKNCjUhPjQ.srt.txt
MIT6824S20/lecture-12-Distributed-Transactions.aDp99WDIM_4.srt.txt
MIT6824S20/lecture-13-Spanner.4eW5SWBi7vs.srt.txt
MIT6824S20/lecture-15-Big-Data-Spark.mzIoSW-cInA.srt.txt
MIT6824S20/lecture-16-Cache-Consistency-Memcached-at-F.Myp8z0ybdzM.srt.txt
MIT6824S20/lecture-17-COPS-Causal-Consistency.fR_NB714EAI.srt.txt
MIT6824S20/lecture-18-Fork-Consistency-Certificate-Tr.UKdLJ7-0iFM.srt.txt
MIT6824S20/lecture-19-Bitcoin.K_euhRou98Y.srt.txt
MIT6824S20/lecture-20-Blockstack.XvXK_vZ0BNw.srt.txt
MIT6824S21/lecture-10-Guest-Lecture-on-Go.Russ-Cox.srt.txt
MIT6824S21/lecture-11-Chain-Replication.srt.txt
MIT6849F12/Class 11 - Generic Rigidity-yvatNaV6Bog.en.srt
MIT6849F12/Class 11 - Generic Rigidity-yvatNaV6Bog.en.vtt
MIT6849F12/Class 13 - Locked Linkages-SEyDJ2qMVl4.en.srt
MIT6849F12/Class 13 - Locked Linkages-SEyDJ2qMVl4.en.vtt
MIT6849F12/Class 15 - General & Edge Unfolding-tzXIDPNb93Y.en.srt
MIT6849F12/Class 15 - General & Edge Unfolding-tzXIDPNb93Y.en.vtt
MIT6849F12/Class 16 - Vertex & Orthogonal Unfolding-Ao9qzPPfTJM.en.srt
MIT6849F12/Class 16 - Vertex & Orthogonal Unfolding-Ao9qzPPfTJM.en.vtt
MIT6849F12/Class 17 - D-Forms-OznepAivkkg.en.srt
MIT6849F12/Class 17 - D-Forms-OznepAivkkg.en.vtt
MIT6849F12/Class 4 - Efficient Origami Design-ylQ5-9f5KIs.en.srt
MIT6849F12/Class 4 - Efficient Origami Design-ylQ5-9f5KIs.en.vtt
MIT6849F12/Class 5 - Tessellations & Modulars-_wctRwpa6j4.en.srt
MIT6849F12/Class 5 - Tessellations & Modulars-_wctRwpa6j4.en.vtt
MIT6849F12/Class 7 - Origami is Hard-voMyQUarX-k.en.srt
MIT6849F12/Class 7 - Origami is Hard-voMyQUarX-k.en.vtt
MIT6849F12/Class 8 - Fold & One Cut-wBR4Q6nFyqk.en.srt
MIT6849F12/Class 8 - Fold & One Cut-wBR4Q6nFyqk.en.vtt
MIT6849F12/Class 9 - Pleat Folding-6-Zh8U1RRK4.en.srt
MIT6849F12/Class 9 - Pleat Folding-6-Zh8U1RRK4.en.vtt
MIT6849F12/Lecture 20 - Protein Chains-82t7g2itzm4.en.srt
MIT6849F12/Lecture 20 - Protein Chains-82t7g2itzm4.en.vtt
MIT6849F12/Lecture 3 - Single-Vertex Crease Patterns-5lO7gBJEzH4.en.srt
MIT6849F12/Lecture 3 - Single-Vertex Crease Patterns-5lO7gBJEzH4.en.vtt
ntu-phon1intro1F12/transcript/01.Class-Overview.txt
ntu-phon1intro1F12/transcript/02.First-Peek-into-the-World-of-Phonetics.txt
ntu-phon1intro1F12/transcript/03.The-Vocal-Tract-and-Places-of-Articulation.txt
ntu-phon1intro1F12/transcript/05.Sound-Waves.-and-Consonants.-Place-of-Articulation-.I.txt
ntu-phon1intro1F12/transcript/08.Waveforms-of-Consonants.txt
ntu-phon1intro1F12/transcript/09.The-Articulation-of-Vowel-Sounds.txt
ntu-phon1intro1F12/transcript/10.The-Sounds-of-Vowels.-Suprasegmentals.txt
ntu-phon1intro1F12/transcript/11.Wrapping-up-Chapter-One.txt
ntu-phon1intro1F12/transcript/12.Chapter-Two.-Phonology-and-Phonetic-Transcription-.I.txt
ntu-phon1intro1F12/transcript/13.Phonology-and-Phonetic-Transcription-.II.txt
ntu-phon1intro1F12/transcript/14.Transcribing-English-Sounds.txt
ntu-phon1intro1F12/transcript/19.More-on-English-Consonants.txt
ntu-phon1intro1F12/transcript/21.Allophonic-Rules-for-English-Consonants-and-Diacritics.txt
ntu-phon1intro1F12/transcript/22.Words-in-Connected-Speech-.I.-and-Exercises-for-Chapter-Three.txt
ntu-phon1intro1F12/transcript/23.Words-in-Connected-Speech-.II.-and-Stress.txt
ntu-phon1intro1F12/transcript/25.Stress.-Rhythm.-and-Intonation.txt
ntu-phon1intro1F12/transcript/26.Wrapping-up-Chapter-Five.txt
ntu-phon1intro1F12/transcript/27.diving-into-vowels.txt
ntu-phon1intro1F12/transcript/28.Chapter-Five-Exercises.txt
ntu-phon1intro1F12/transcript/29.Chapter-Three-Test-Corrections-and-Transcribing-Mandarin-in-IPA.txt
ntu-phon1intro1F12/transcript/30.Diphthongs-and-Rhotic-Vowels.txt
ntu-phon1intro1F12/transcript/31.Wrapping-up-Chapter-Four-and-Christmas-Carols.txt
ntu-phon1intro1F12/transcript/32.Chapter-Four-Exercises.txt
RES6012Prob/072622t/L01.10 Interpretations & Uses of Probabilities-uGGTX2ypzKI.en.vtt
RES6012Prob/072622t/L01.3 Sample Space Examples-__T3eJtjoic.en.vtt
RES6012Prob/072622t/L01.5 Simple Properties of Probabilities-WTyLg_I1oFY.en.vtt
RES6012Prob/072622t/L01.7 A Discrete Example-AsSQdpZdP8U.en.vtt
RES6012Prob/072622t/L01.9 Countable Additivity-mUxg3j_h5GM.en.vtt
RES6012Prob/072622t/L02.1 Lecture Overview-B5y6fy5iUtg.en.vtt
RES6012Prob/072622t/L02.2 Conditional Probabilities-MPRKc4UPoJk.en.vtt
RES6012Prob/072622t/L02.4 Conditional Probabilities Obey the Same Axioms-L_pEeYLGaP0.en.vtt
RES6012Prob/072622t/L02.7 Total Probability Theorem-8odFouBR2wE.en.vtt
RES6012Prob/072622t/L02.8 Bayes' Rule-kz2tvO_ZAKI.en.vtt
RES6012Prob/072622t/L03.5 Conditional Independence-7B3cDe39lwY.en.vtt
RES6012Prob/072622t/L04.1 Lecture Overview-poeHeiiiLKI.en.vtt
RES6012Prob/072622t/L04.2 The Counting Principle--k8WU-KB0rk.en.vtt
RES6012Prob/072622t/L04.3 Die Roll Example-KrjZyCRi29o.en.vtt
RES6012Prob/072622t/L04.4 Combinations-o_qO7RYBF10.en.vtt
RES6012Prob/072622t/L04.6 A Coin Tossing Example-2f9EfEga4Oo.en.vtt
RES6012Prob/072622t/L04.7 Partitions-hJjiCrdsNV8.en.vtt
RES6012Prob/072622t/L04.8 Each Person Gets An Ace-IC-pnm6PEGk.en.vtt
RES6012Prob/072622t/L04.9 Multinomial Probabilities-5A_H1eHbOCY.en.vtt
RES6012Prob/072622t/L05.10 The Expected Value Rule-gB5TCCfF6e4.en.vtt
RES6012Prob/072622t/L05.1 Lecture Overview-ArfHGPHL8kU.en.vtt
RES6012Prob/072622t/L05.7 Geometric Random Variables-whbKmwMmB4s.en.vtt
RES6012Prob/072622t/S01.0 Mathematical Background Overview--630YTQEuCI.en.vtt
RES6012Prob/072622t/S01.10 Bonferroni's Inequality-0xuRh3dz_Nc.en.vtt
RES6012Prob/072622t/S01.8 Countable and Uncountable Sets-MqocbJ-FPo0.en.vtt
RES6012Prob/072622t/S01.9 Proof That a Set of Real Numbers is Uncountable-YIZd23zGV3M.en.vtt
RES6012Prob/L01.10 Interpretations & Uses of Probabilities-uGGTX2ypzKI.en.vtt
RES6012Prob/L01.3 Sample Space Examples-__T3eJtjoic.en.vtt
RES6012Prob/L01.5 Simple Properties of Probabilities-WTyLg_I1oFY.en.vtt
RES6012Prob/L01.7 A Discrete Example-AsSQdpZdP8U.en.vtt
RES6012Prob/L01.9 Countable Additivity-mUxg3j_h5GM.en.vtt
RES6012Prob/L02.1 Lecture Overview-B5y6fy5iUtg.en.vtt
RES6012Prob/L02.2 Conditional Probabilities-MPRKc4UPoJk.en.vtt
RES6012Prob/L02.4 Conditional Probabilities Obey the Same Axioms-L_pEeYLGaP0.en.vtt
RES6012Prob/L02.7 Total Probability Theorem-8odFouBR2wE.en.vtt
RES6012Prob/L02.8 Bayes' Rule-kz2tvO_ZAKI.en.vtt
RES6012Prob/L03.5 Conditional Independence-7B3cDe39lwY.en.vtt
RES6012Prob/L04.1 Lecture Overview-poeHeiiiLKI.en.vtt
RES6012Prob/L04.2 The Counting Principle--k8WU-KB0rk.en.vtt
RES6012Prob/L04.3 Die Roll Example-KrjZyCRi29o.en.vtt
RES6012Prob/L04.4 Combinations-o_qO7RYBF10.en.vtt
RES6012Prob/L04.6 A Coin Tossing Example-2f9EfEga4Oo.en.vtt
RES6012Prob/L04.7 Partitions-hJjiCrdsNV8.en.vtt
RES6012Prob/L04.8 Each Person Gets An Ace-IC-pnm6PEGk.en.vtt
RES6012Prob/L04.9 Multinomial Probabilities-5A_H1eHbOCY.en.vtt
RES6012Prob/L05.10 The Expected Value Rule-gB5TCCfF6e4.en.vtt
RES6012Prob/L05.1 Lecture Overview-ArfHGPHL8kU.en.vtt
RES6012Prob/L05.7 Geometric Random Variables-whbKmwMmB4s.en.vtt
RES6012Prob/L06.1 Lecture Overview-n9FTM9f9A6I.en.vtt
RES6012Prob/L06.4 Conditional PMFs & Expectations Given an Event-2_KBeHiUDiY.en.vtt
RES6012Prob/L06.5 Total Expectation Theorem-GnEyIawrWBg.en.vtt
RES6012Prob/L06.8 Linearity of Expectations & The Mean of the Binomial-TbRh71BMJvw.en.vtt
RES6012Prob/L07.3 Conditional Expectation & the Total Expectation Theorem-vJAG4EzSQZA.en.vtt
RES6012Prob/L07.7 Independence, Variances & the Binomial Variance-YQ26hzI4OJk.en.vtt
RES6012Prob/L08.3 Uniform & Piecewise Constant PDFs-jPB9zI8F7rE.en.vtt
RES6012Prob/L08.4 Means & Variances-wOmfOJyxZ6M.en.vtt
RES6012Prob/L08.6 Exponential Random Variables-FOFtMqCxZt0.en.vtt
RES6012Prob/L09.1 Lecture Overview-G11r4Srh4u8.en.vtt
RES6012Prob/L09.2 Conditioning A Continuous Random Variable on an Event-mHj4A1gh_ws.en.vtt
RES6012Prob/L13.10 Mean of the Sum of a Random Number of Random Variables-xdewLsXI_UQ.en.vtt
RES6012Prob/L13.11 Variance of the Sum of a Random Number of Random Variables-SgM16HNeC3o.en.vtt
RES6012Prob/L14.1 Lecture Overview-aNLEnFtWwhg.en.vtt
RES6012Prob/L14.4 The Bayesian Inference Framework-0w_4QcvBYII.en.vtt
RES6012Prob/L15.3 Estimating a Normal Random Variable in the Presence of Additive Noise-qgICsL7ybWc.en.vtt
RES6012Prob/L15.6 Multiple Parameters; Trajectory Estimation-rFUb1nvh3CQ.en.vtt
RES6012Prob/L16.7 LMS Estimation with Multiple Observations or Unknowns-jzhFxJflHXQ.en.vtt
RES6012Prob/L18.4 The Weak Law of Large Numbers-Yh5bR7X3ch8.en.vtt
RES6012Prob/L18.5 Polling-uQTFiXQR4PQ.en.vtt
RES6012Prob/L19.5 CLT Examples-pd7dvQBqQqY.en.vtt
RES6012Prob/L19.7 Polling Revisited-mxpC3MEiATQ.en.vtt
RES6012Prob/L20.2 Overview of the Classical Statistical Framework-fMHJPEcoC08.en.vtt
RES6012Prob/L21.8 Merging of Bernoulli Processes-AyCLokHV774.en.vtt
RES6012Prob/L22.10 An Example-MvGuBQZZuLM.en.vtt
RES6012Prob/L22.4 The Poisson PMF for the Number of Arrivals-tzW5jlfEvwU.en.vtt
RES6012Prob/L22.7 Time of the K-th Arrival-6stYmO_N7LI.en.vtt
RES6012Prob/L23.7 Random Incidence in the Poisson Process-sG3_Bveu_cA.en.vtt
RES6012Prob/L24.1 Lecture Overview-LBiYeL4qD2M.en.vtt
RES6012Prob/L24.2 Introduction to Markov Processes-K-ck5dOsPgQ.en.vtt
RES6012Prob/L24.3 Checkout Counter Example-VCyJGp6Enxg.en.vtt
RES6012Prob/L24.4 Discrete-Time Finite-State Markov Chains-hsQnmrHbbms.en.vtt
RES6012Prob/L24.5 N-Step Transition Probabilities-UwwqPwp16_0.en.vtt
RES6012Prob/L25.10 Birth-Death Processes - Part I-XKYpKYspe1w.en.vtt
RES6012Prob/L25.11 Birth-Death Processes - Part II-KdAsNQVdaNk.en.vtt
RES6012Prob/L25.9 Visit Frequency Interpretation of Steady-State Probabilities-c-BLp-585aU.en.vtt
RES6012Prob/L26.8 Mean First Passage Time-BW_EHmZf2pM.en.vtt
RES6012Prob/S01.0 Mathematical Background Overview--630YTQEuCI.en.vtt
RES6012Prob/S01.10 Bonferroni's Inequality-0xuRh3dz_Nc.en.vtt
RES6012Prob/S01.8 Countable and Uncountable Sets-MqocbJ-FPo0.en.vtt
RES6012Prob/S01.9 Proof That a Set of Real Numbers is Uncountable-YIZd23zGV3M.en.vtt
RES6012Prob/S07.1 The Inclusion-Exclusion Formula-WXIU2tK4qtc.en.vtt
RES6012Prob/S09.1 Buffon's Needle & Monte Carlo Simulation-KSrPJe7y9oA.en.vtt
RES6012Prob/S14.1 The Beta Formula-8yaRt24qA1M.en.vtt
S22/580S/L02-0119W22.txt
S22/580S/L02-0126W22.txt
S22/580S/L03-0202W22.srt.txt
S22/580S/L04-0209W22.srt.txt
S22/580S/Structured-Wide-Area-Programming.PzGo3w2iqcs.Jayadev-Misra-unity.srt.txt
S22/585N/L02.0120R22.srt.txt
S22/585N/L03.0125T22.srt.txt
S22/591F/L03-0125T22.txt
stat110/Lecture-29-Law-of-Large-Numbers-and-Central-Limit-Theorem.OprNqnHsVIA.srt.txt
stat110/Lecture-6-Monty-Hall,-Simpson-s-Paradox.fDcjhAKuhqQ.srt.txt