Index of /~tallpik3/caption/6046-15S

[ICO]NameLast modifiedSizeDescription

[PARENTDIR]Parent Directory  -  
[TXT]lecture-1-course-overview-interval-scheduling.2P-yW7LQr08.srt2019-10-17 17:05 95K 
[TXT]lecture-2-divide-conquer-convex-hull-median-finding.EzeYI7p9MjU.srt2019-10-17 17:05 82K 
[TXT]lecture-3-divide-conquer-fft.iTMn0Kt18tg.srt2019-10-17 17:06 102K 
[TXT]lecture-4-divide-conquer-van-emde-boas-trees.hmReJCupbNU.srt2019-10-17 17:06 100K 
[TXT]lecture-5-amortization-amortized-analysis.3MpzavN3Mco.srt2019-10-17 17:06 92K 
[TXT]lecture-6-randomization-matrix-multiply-quicksort.cNB2lADK3_s.srt2019-10-17 17:06 106K 
[TXT]lecture-7-randomization-skip-lists.2g9OSRKJuzM.srt2019-10-17 17:06 100K 
[TXT]lecture-8-randomization-universal-perfect-hashing.z0lJ2k0sl1g.srt2019-10-17 17:06 98K 
[TXT]lecture-9-augmentation-range-trees.xVka6z1hu-I.srt2019-10-17 17:06 108K 
[TXT]lecture-10-dynamic-programming-advanced-dp.Tw1k46ywN6E.srt2019-10-17 17:06 102K 
[TXT]lecture-11-dynamic-programming-all-pairs-shortest-paths.NzgFUwOaoIw.srt2019-10-17 17:06 108K 
[TXT]lecture-12-greedy-algorithms-minimum-spanning-tree.tKwnms5iRBU.srt2019-10-17 17:06 98K 
[TXT]lecture-13-incremental-improvement-max-flow-min-cut.VYZGlgzr_As.srt2019-10-17 17:06 105K 
[TXT]lecture-14-incremental-improvement-matching.8C_T4iTzPCU.srt2019-10-17 17:06 90K 
[TXT]lecture-15-linear-programming-lp-reductions-simplex.WwMz2fJwUCg.srt2019-10-17 17:06 98K 
[TXT]lecture-16-complexity-p-np-np-completeness-reductions.eHZifpgyH_4.srt2019-10-17 17:06 111K 
[TXT]lecture-17-complexity-approximation-algorithms.MEz1J9wY2iM.srt2019-10-17 17:06 99K 
[TXT]lecture-18-complexity-fixed-parameter-algorithms.4q-jmGrmxKs.srt2019-10-17 17:06 104K 
[TXT]lecture-19-synchronous-distributed-algorithms-symmetry-breaking.-shortest-paths-spanning-trees.mUBmcbbJNf4.srt2019-10-17 17:06 114K 
[TXT]lecture-20-asynchronous-distributed-algorithms-shortest-paths-spanning-trees.kQ-UQAzcnzA.srt2019-10-17 17:06 103K 
[TXT]lecture-21-cryptography-hash-functions.KqqOXndnvic.srt2019-10-17 17:06 109K 
[TXT]lecture-22-cryptography-encryption.9TNI2wHmaeI.srt2019-10-17 17:06 112K 
[TXT]lecture-23-cache-oblivious-algorithms-medians-matrices.1409658.srt2019-10-17 17:06 113K 
[TXT]lecture-24-cache-oblivious-algorithms-searching-sorting.C6EWVBNCxsc.srt2019-10-17 17:06 114K 
[TXT]recitation-1-divide-conquer-smarter-interval-scheduling-master-theorem-strassens-algorithm.09vU-wVwW3U.srt2022-01-03 22:57 56K 
[TXT]recitation-2-b-trees.TOb1tuEZ2X4.srt2022-01-03 22:57 44K 
[TXT]recitation-4-randomization-randomized-median.QPk8MUtq5yA.srt2022-01-03 22:57 37K 
[TXT]recitation-5-dynamic-programming-more-examples.krZI60lKPek.srt2022-01-03 22:57 52K 
[TXT]recitation-6-greedy-algorithms-more-examples.-QcPo_DWJk4.srt2022-01-03 22:57 34K 
[TXT]recitation-7-incremental-improvement-applications-of-network-flow-matching.0CdxkgAjsDA.srt2022-01-03 22:57 45K 
[TXT]recitation-8-complexity-more-reductions.G7mqtB6npfE.srt2022-01-03 22:57 62K 
[TXT]recitation-9-complexity-approximations.zM5MW5NKZJg.srt2022-01-03 22:57 46K 
[TXT]recitation-10-distributed-algorithms.w_-SX4vR53M.srt2022-01-03 22:57 48K 
[TXT]recitation-11-cryptography-more-primitives.ZLOhV4XQ_tI.srt2022-01-03 22:58 50K