[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"channel-series-mit-ocw-6-046j-algorithm-design":3,"channel-library-index":225},{"channel":4,"series":9,"stats":18,"episodes":22},{"slug":5,"title":6,"author":7,"platform_channel_id":8},"mit-ocw","MIT OpenCourseWare","MIT","UCEBb1b_L6zDS3xTUrIALZOw",{"slug":10,"title":11,"short_title":12,"description":13,"source":14,"sort_order":15,"index":15,"total_series":16,"source_playlist_id":17},"6-046j-algorithm-design","6.046J Design and Analysis of Algorithms","6.046J Algorithms","Erik Demaine, Srini Devadas and Nancy Lynch: divide and conquer, randomization, flows, linear programming, NP-completeness, distributed algorithms and cryptography. Spring 2015.","curated",3,10,"PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp",{"count":19,"transcribed":20,"duration_seconds":20,"view_count":20,"chapters":20,"first_published_at":21,"last_published_at":21},34,0,null,[23,30,36,41,47,53,59,65,71,77,82,88,94,100,106,112,118,124,130,136,142,148,154,160,166,172,178,184,190,196,202,208,214,220],{"position":24,"platform_video_id":25,"episode_label":26,"display_title":27,"place":21,"title":21,"transcribed":28,"transcribed_at":21,"published_at":21,"duration":21,"view_count":21,"thumbnail_url":21,"description":21,"chapter_count":20,"chapters":29},1,"2P-yW7LQr08","Lec 1","Course Overview, Interval Scheduling",false,[],{"position":31,"platform_video_id":32,"episode_label":33,"display_title":34,"place":21,"title":21,"transcribed":28,"transcribed_at":21,"published_at":21,"duration":21,"view_count":21,"thumbnail_url":21,"description":21,"chapter_count":20,"chapters":35},2,"EzeYI7p9MjU","Lec 2","Divide & Conquer: Convex Hull, Median Finding",[],{"position":15,"platform_video_id":37,"episode_label":38,"display_title":39,"place":21,"title":21,"transcribed":28,"transcribed_at":21,"published_at":21,"duration":21,"view_count":21,"thumbnail_url":21,"description":21,"chapter_count":20,"chapters":40},"09vU-wVwW3U","R1","Matrix Multiplication and the Master Theorem",[],{"position":42,"platform_video_id":43,"episode_label":44,"display_title":45,"place":21,"title":21,"transcribed":28,"transcribed_at":21,"published_at":21,"duration":21,"view_count":21,"thumbnail_url":21,"description":21,"chapter_count":20,"chapters":46},4,"iTMn0Kt18tg","Lec 3","Divide & Conquer: FFT",[],{"position":48,"platform_video_id":49,"episode_label":50,"display_title":51,"place":21,"title":21,"transcribed":28,"transcribed_at":21,"published_at":21,"duration":21,"view_count":21,"thumbnail_url":21,"description":21,"chapter_count":20,"chapters":52},5,"TOb1tuEZ2X4","R2","2-3 Trees and B-Trees",[],{"position":54,"platform_video_id":55,"episode_label":56,"display_title":57,"place":21,"title":21,"transcribed":28,"transcribed_at":21,"published_at":21,"duration":21,"view_count":21,"thumbnail_url":21,"description":21,"chapter_count":20,"chapters":58},6,"hmReJCupbNU","Lec 4","Divide & Conquer: van Emde Boas Trees",[],{"position":60,"platform_video_id":61,"episode_label":62,"display_title":63,"place":21,"title":21,"transcribed":28,"transcribed_at":21,"published_at":21,"duration":21,"view_count":21,"thumbnail_url":21,"description":21,"chapter_count":20,"chapters":64},7,"3MpzavN3Mco","Lec 5","Amortization: Amortized Analysis",[],{"position":66,"platform_video_id":67,"episode_label":68,"display_title":69,"place":21,"title":21,"transcribed":28,"transcribed_at":21,"published_at":21,"duration":21,"view_count":21,"thumbnail_url":21,"description":21,"chapter_count":20,"chapters":70},8,"cNB2lADK3_s","Lec 6","Randomization: Matrix Multiply, Quicksort",[],{"position":72,"platform_video_id":73,"episode_label":74,"display_title":75,"place":21,"title":21,"transcribed":28,"transcribed_at":21,"published_at":21,"duration":21,"view_count":21,"thumbnail_url":21,"description":21,"chapter_count":20,"chapters":76},9,"QPk8MUtq5yA","R4","Randomized Select and Randomized Quicksort",[],{"position":16,"platform_video_id":78,"episode_label":79,"display_title":80,"place":21,"title":21,"transcribed":28,"transcribed_at":21,"published_at":21,"duration":21,"view_count":21,"thumbnail_url":21,"description":21,"chapter_count":20,"chapters":81},"2g9OSRKJuzM","Lec 7","Randomization: Skip Lists",[],{"position":83,"platform_video_id":84,"episode_label":85,"display_title":86,"place":21,"title":21,"transcribed":28,"transcribed_at":21,"published_at":21,"duration":21,"view_count":21,"thumbnail_url":21,"description":21,"chapter_count":20,"chapters":87},11,"z0lJ2k0sl1g","Lec 8","Randomization: Universal & Perfect Hashing",[],{"position":89,"platform_video_id":90,"episode_label":91,"display_title":92,"place":21,"title":21,"transcribed":28,"transcribed_at":21,"published_at":21,"duration":21,"view_count":21,"thumbnail_url":21,"description":21,"chapter_count":20,"chapters":93},12,"krZI60lKPek","R5","Dynamic Programming",[],{"position":95,"platform_video_id":96,"episode_label":97,"display_title":98,"place":21,"title":21,"transcribed":28,"transcribed_at":21,"published_at":21,"duration":21,"view_count":21,"thumbnail_url":21,"description":21,"chapter_count":20,"chapters":99},13,"xVka6z1hu-I","Lec 9","Augmentation: Range Trees",[],{"position":101,"platform_video_id":102,"episode_label":103,"display_title":104,"place":21,"title":21,"transcribed":28,"transcribed_at":21,"published_at":21,"duration":21,"view_count":21,"thumbnail_url":21,"description":21,"chapter_count":20,"chapters":105},14,"Tw1k46ywN6E","Lec 10","Dynamic Programming: Advanced DP",[],{"position":107,"platform_video_id":108,"episode_label":109,"display_title":110,"place":21,"title":21,"transcribed":28,"transcribed_at":21,"published_at":21,"duration":21,"view_count":21,"thumbnail_url":21,"description":21,"chapter_count":20,"chapters":111},15,"NzgFUwOaoIw","Lec 11","Dynamic Programming: All-Pairs Shortest Paths",[],{"position":113,"platform_video_id":114,"episode_label":115,"display_title":116,"place":21,"title":21,"transcribed":28,"transcribed_at":21,"published_at":21,"duration":21,"view_count":21,"thumbnail_url":21,"description":21,"chapter_count":20,"chapters":117},16,"tKwnms5iRBU","Lec 12","Greedy Algorithms: Minimum Spanning Tree",[],{"position":119,"platform_video_id":120,"episode_label":121,"display_title":122,"place":21,"title":21,"transcribed":28,"transcribed_at":21,"published_at":21,"duration":21,"view_count":21,"thumbnail_url":21,"description":21,"chapter_count":20,"chapters":123},17,"-QcPo_DWJk4","R6","Greedy Algorithms",[],{"position":125,"platform_video_id":126,"episode_label":127,"display_title":128,"place":21,"title":21,"transcribed":28,"transcribed_at":21,"published_at":21,"duration":21,"view_count":21,"thumbnail_url":21,"description":21,"chapter_count":20,"chapters":129},18,"VYZGlgzr_As","Lec 13","Incremental Improvement: Max Flow, Min Cut",[],{"position":131,"platform_video_id":132,"episode_label":133,"display_title":134,"place":21,"title":21,"transcribed":28,"transcribed_at":21,"published_at":21,"duration":21,"view_count":21,"thumbnail_url":21,"description":21,"chapter_count":20,"chapters":135},19,"8C_T4iTzPCU","Lec 14","Incremental Improvement: Matching",[],{"position":137,"platform_video_id":138,"episode_label":139,"display_title":140,"place":21,"title":21,"transcribed":28,"transcribed_at":21,"published_at":21,"duration":21,"view_count":21,"thumbnail_url":21,"description":21,"chapter_count":20,"chapters":141},20,"0CdxkgAjsDA","R7","Network Flow and Matching",[],{"position":143,"platform_video_id":144,"episode_label":145,"display_title":146,"place":21,"title":21,"transcribed":28,"transcribed_at":21,"published_at":21,"duration":21,"view_count":21,"thumbnail_url":21,"description":21,"chapter_count":20,"chapters":147},21,"WwMz2fJwUCg","Lec 15","Linear Programming: LP, reductions, Simplex",[],{"position":149,"platform_video_id":150,"episode_label":151,"display_title":152,"place":21,"title":21,"transcribed":28,"transcribed_at":21,"published_at":21,"duration":21,"view_count":21,"thumbnail_url":21,"description":21,"chapter_count":20,"chapters":153},22,"eHZifpgyH_4","Lec 16","Complexity: P, NP, NP-completeness, Reductions",[],{"position":155,"platform_video_id":156,"episode_label":157,"display_title":158,"place":21,"title":21,"transcribed":28,"transcribed_at":21,"published_at":21,"duration":21,"view_count":21,"thumbnail_url":21,"description":21,"chapter_count":20,"chapters":159},23,"G7mqtB6npfE","R8","NP-Complete Problems",[],{"position":161,"platform_video_id":162,"episode_label":163,"display_title":164,"place":21,"title":21,"transcribed":28,"transcribed_at":21,"published_at":21,"duration":21,"view_count":21,"thumbnail_url":21,"description":21,"chapter_count":20,"chapters":165},24,"MEz1J9wY2iM","Lec 17","Complexity: Approximation Algorithms",[],{"position":167,"platform_video_id":168,"episode_label":169,"display_title":170,"place":21,"title":21,"transcribed":28,"transcribed_at":21,"published_at":21,"duration":21,"view_count":21,"thumbnail_url":21,"description":21,"chapter_count":20,"chapters":171},25,"4q-jmGrmxKs","Lec 18","Complexity: Fixed-Parameter Algorithms",[],{"position":173,"platform_video_id":174,"episode_label":175,"display_title":176,"place":21,"title":21,"transcribed":28,"transcribed_at":21,"published_at":21,"duration":21,"view_count":21,"thumbnail_url":21,"description":21,"chapter_count":20,"chapters":177},26,"zM5MW5NKZJg","R9","Approximation Algorithms: Traveling Salesman Problem",[],{"position":179,"platform_video_id":180,"episode_label":181,"display_title":182,"place":21,"title":21,"transcribed":28,"transcribed_at":21,"published_at":21,"duration":21,"view_count":21,"thumbnail_url":21,"description":21,"chapter_count":20,"chapters":183},27,"mUBmcbbJNf4","Lec 19","Synchronous Distributed Algorithms: Symmetry-Breaking. Shortest-Paths Spanning Trees",[],{"position":185,"platform_video_id":186,"episode_label":187,"display_title":188,"place":21,"title":21,"transcribed":28,"transcribed_at":21,"published_at":21,"duration":21,"view_count":21,"thumbnail_url":21,"description":21,"chapter_count":20,"chapters":189},28,"EQjwWn-WrdI","Lec 20","Asynchronous Distributed Algorithms: Shortest-Paths Spanning Trees",[],{"position":191,"platform_video_id":192,"episode_label":193,"display_title":194,"place":21,"title":21,"transcribed":28,"transcribed_at":21,"published_at":21,"duration":21,"view_count":21,"thumbnail_url":21,"description":21,"chapter_count":20,"chapters":195},29,"w_-SX4vR53M","R10","Distributed Algorithms",[],{"position":197,"platform_video_id":198,"episode_label":199,"display_title":200,"place":21,"title":21,"transcribed":28,"transcribed_at":21,"published_at":21,"duration":21,"view_count":21,"thumbnail_url":21,"description":21,"chapter_count":20,"chapters":201},30,"KqqOXndnvic","Lec 21","Cryptography: Hash Functions",[],{"position":203,"platform_video_id":204,"episode_label":205,"display_title":206,"place":21,"title":21,"transcribed":28,"transcribed_at":21,"published_at":21,"duration":21,"view_count":21,"thumbnail_url":21,"description":21,"chapter_count":20,"chapters":207},31,"9TNI2wHmaeI","Lec 22","Cryptography: Encryption",[],{"position":209,"platform_video_id":210,"episode_label":211,"display_title":212,"place":21,"title":21,"transcribed":28,"transcribed_at":21,"published_at":21,"duration":21,"view_count":21,"thumbnail_url":21,"description":21,"chapter_count":20,"chapters":213},32,"ZLOhV4XQ_tI","R11","Cryptography: More Primitives",[],{"position":215,"platform_video_id":216,"episode_label":217,"display_title":218,"place":21,"title":21,"transcribed":28,"transcribed_at":21,"published_at":21,"duration":21,"view_count":21,"thumbnail_url":21,"description":21,"chapter_count":20,"chapters":219},33,"CSqbjfCCLrU","Lec 23","Cache-Oblivious Algorithms: Medians & Matrices",[],{"position":19,"platform_video_id":221,"episode_label":222,"display_title":223,"place":21,"title":21,"transcribed":28,"transcribed_at":21,"published_at":21,"duration":21,"view_count":21,"thumbnail_url":21,"description":21,"chapter_count":20,"chapters":224},"C6EWVBNCxsc","Lec 24","Cache-Oblivious Algorithms: Searching & Sorting",[],[226,271],{"slug":5,"title":6,"href":227,"seriesCount":16,"videos":228,"transcribed":15,"series":229},"\u002Fchannel\u002Fmit-ocw",315,[230,235,239,241,245,250,255,259,263,267],{"slug":231,"title":232,"href":233,"count":234,"transcribed":20},"6-0001-python","6.0001 Introduction to Computer Science and Programming in Python","\u002Fchannel\u002Fmit-ocw\u002F6-0001-python",38,{"slug":236,"title":237,"href":238,"count":209,"transcribed":24},"6-006-algorithms","6.006 Introduction to Algorithms","\u002Fchannel\u002Fmit-ocw\u002F6-006-algorithms",{"slug":10,"title":11,"href":240,"count":19,"transcribed":20},"\u002Fchannel\u002Fmit-ocw\u002F6-046j-algorithm-design",{"slug":242,"title":243,"href":244,"count":197,"transcribed":20},"6-034-ai","6.034 Artificial Intelligence","\u002Fchannel\u002Fmit-ocw\u002F6-034-ai",{"slug":246,"title":247,"href":248,"count":249,"transcribed":20},"18-01-calculus","18.01 Single Variable Calculus","\u002Fchannel\u002Fmit-ocw\u002F18-01-calculus",35,{"slug":251,"title":252,"href":253,"count":254,"transcribed":20},"18-06-linear-algebra","18.06 Linear Algebra","\u002Fchannel\u002Fmit-ocw\u002F18-06-linear-algebra",36,{"slug":256,"title":257,"href":258,"count":167,"transcribed":24},"8-04-quantum-physics","8.04 Quantum Physics I","\u002Fchannel\u002Fmit-ocw\u002F8-04-quantum-physics",{"slug":260,"title":261,"href":262,"count":249,"transcribed":20},"7-012-biology","7.012 Introduction to Biology","\u002Fchannel\u002Fmit-ocw\u002F7-012-biology",{"slug":264,"title":265,"href":266,"count":173,"transcribed":24},"14-01-microeconomics","14.01 Principles of Microeconomics","\u002Fchannel\u002Fmit-ocw\u002F14-01-microeconomics",{"slug":268,"title":269,"href":270,"count":161,"transcribed":20},"9-00sc-psychology","9.00SC Introduction to Psychology","\u002Fchannel\u002Fmit-ocw\u002F9-00sc-psychology",{"slug":272,"title":273,"href":274,"seriesCount":16,"videos":275,"transcribed":276,"series":277},"predictive-history","Predictive History","\u002Fchannel\u002Fpredictive-history",178,40,[278,283,287,291,295,299,303,307,311,315],{"slug":279,"title":280,"href":281,"count":282,"transcribed":60},"civilization","The Story of Civilization","\u002Fchannel\u002Fpredictive-history\u002Fcivilization",61,{"slug":284,"title":285,"href":286,"count":185,"transcribed":48},"secret-history","Secret History","\u002Fchannel\u002Fpredictive-history\u002Fsecret-history",{"slug":288,"title":289,"href":290,"count":191,"transcribed":143},"game-theory","Game Theory","\u002Fchannel\u002Fpredictive-history\u002Fgame-theory",{"slug":292,"title":293,"href":294,"count":95,"transcribed":31},"great-books","Great Books","\u002Fchannel\u002Fpredictive-history\u002Fgreat-books",{"slug":296,"title":297,"href":298,"count":89,"transcribed":20},"dante","Dante Seminar (Beijing, June 2026)","\u002Fchannel\u002Fpredictive-history\u002Fdante",{"slug":300,"title":301,"href":302,"count":89,"transcribed":20},"geo-strategy","Geo-Strategy","\u002Fchannel\u002Fpredictive-history\u002Fgeo-strategy",{"slug":304,"title":305,"href":306,"count":66,"transcribed":24},"geo-strategy-update","Geo-Strategy Update","\u002Fchannel\u002Fpredictive-history\u002Fgeo-strategy-update",{"slug":308,"title":309,"href":310,"count":60,"transcribed":15},"global-meet-up","Global Meet-Up","\u002Fchannel\u002Fpredictive-history\u002Fglobal-meet-up",{"slug":312,"title":313,"href":314,"count":15,"transcribed":20},"emergency-discussion","Emergency Discussion","\u002Fchannel\u002Fpredictive-history\u002Femergency-discussion",{"slug":316,"title":317,"href":318,"count":48,"transcribed":24},"livestreams","Livestreams and Extras","\u002Fchannel\u002Fpredictive-history\u002Flivestreams"]