PushBT Magnet/Torrent

Categories

Recommend Tools

  • Convert torrent to magnet
  • Convert torrent to magnet

fileAlgorithms-Design-and-An-1sYei

Algorithms Design and Analysis Part Stanford Coursera
  • MP41 Two Motivating Applications\\/1 - 1 - Application- Internet Routing (11 min).mp413.85MB
  • MP41 Two Motivating Applications\\/1 - 2 - Application- Sequence Alignment (9 min).mp411.10MB
  • MP410 Introduction to Dynamic Programming\\/10 - 1 - Introduction- Weighted Independent Sets in Path Graphs (8 min).mp411.26MB
  • MP410 Introduction to Dynamic Programming\\/10 - 2 - WIS in Path Graphs- Optil Substructure (9 min).mp413.52MB
  • MP410 Introduction to Dynamic Programming\\/10 - 3 - WIS in Path Graphs- A Linear-Time Algorithm (10 min).mp414.54MB
  • MP410 Introduction to Dynamic Programming\\/10 - 4 - WIS in Path Graphs- A Reconstruction Algorithm (7 min).mp49.62MB
  • MP410 Introduction to Dynamic Programming\\/10 - 5 - Principles of Dynamic Programming (8 min).mp412.27MB
  • MP411 The Knapsack Problem\\/11 - 1 - The Knapsack Problem (10 min).mp414.08MB
  • MP411 The Knapsack Problem\\/11 - 2 - A Dynamic Programming Algorithm (10 min).mp413.61MB
  • MP411 The Knapsack Problem\\/11 - 3 - Example [Review - Optional] (14 min).mp424.21MB
  • MP412 Sequence Alignment\\/12 - 1 - Optil Substructure (14 min).mp419.54MB
  • MP412 Sequence Alignment\\/12 - 2 - A Dynamic Programming Algorithm (12 min).mp416.71MB
  • MP413 Optil Binary Search Trees\\/13 - 1 - Problem Definition (12 min).mp417.19MB
  • MP413 Optil Binary Search Trees\\/13 - 2 - Optimal Substructure (9 min).mp413.94MB
  • MP413 Optil Binary Search Trees\\/13 - 3 - Proof of Optimal Substructure (7 min).mp49.86MB
  • MP413 Optil Binary Search Trees\\/13 - 4 - A Dynamic Programming Algorithm I (10 min).mp414.05MB
  • MP413 Optil Binary Search Trees\\/13 - 5 - A Dynamic Programming Algorithm II (9 min).mp411.94MB
  • MP414 The Belln-Ford Algorithm\\/14 - 1 - Single-Source Shortest Paths Revisted (11 min).mp415.15MB
  • MP414 The Belln-Ford Algorithm\\/14 - 2 - Optimal Substructure (11 min).mp415.27MB
  • MP414 The Belln-Ford Algorithm\\/14 - 3 - The Basic Algorithm I (9 min).mp412.11MB
  • MP414 The Belln-Ford Algorithm\\/14 - 4 - The Basic Algorithm II (11 min).mp413.61MB
  • MP414 The Belln-Ford Algorithm\\/14 - 5 - Detecting Negative Cycles (9 min).mp412.78MB
  • MP414 The Belln-Ford Algorithm\\/14 - 6 - A Space Optimization (12 min).mp418.34MB
  • MP414 The Belln-Ford Algorithm\\/14 - 7 - Internet Routing I [Optional] (11 min).mp416.72MB
  • MP414 The Belln-Ford Algorithm\\/14 - 8 - Internet Routing II [Optional] (7 min).mp410.68MB
  • MP415 All-Pairs Shortest Paths\\/15 - 1 - Problem Definition (7 min).mp49.48MB
  • MP415 All-Pairs Shortest Paths\\/15 - 2 - Optil Substructure (12 min).mp416.53MB
  • MP415 All-Pairs Shortest Paths\\/15 - 3 - The Floyd-Warshall Algorithm (13 min).mp418.89MB
  • MP415 All-Pairs Shortest Paths\\/15 - 4 - A Reweighting Technique (14 min).mp419.62MB
  • MP415 All-Pairs Shortest Paths\\/15 - 5 - Johnson-\s Algorithm I (11 min).mp415.49MB
  • MP415 All-Pairs Shortest Paths\\/15 - 6 - Johnson-\s Algorithm II (11 min).mp416.86MB
  • MP416 NP-Complete Problems\\/16 - 1 - Polynomial-Time Solvable Problems (14 min).mp420.49MB
  • MP416 NP-Complete Problems\\/16 - 2 - Reductions and Completeness (14 min).mp419.86MB
  • MP416 NP-Complete Problems\\/16 - 3 - Definition and Interpretation of NP-Completeness I (11 min).mp416.35MB
  • MP416 NP-Complete Problems\\/16 - 4 - Definition and Interpretation of NP-Completeness II (8 min).mp412.18MB
  • MP416 NP-Complete Problems\\/16 - 5 - The P vs. NP Question (9 min).mp414.28MB
  • MP416 NP-Complete Problems\\/16 - 6 - Algorithmic Approaches to NP-Complete Problems (13 min).mp419.86MB
  • MP417 Faster Exact Algorithms for NP-Complete Problems\\/17 - 1 - The Vertex Cover Problem (9 min).mp412.75MB
  • MP417 Faster Exact Algorithms for NP-Complete Problems\\/17 - 2 - arter Search for Vertex Cover I (10 min).mp414.14MB
  • MP417 Faster Exact Algorithms for NP-Complete Problems\\/17 - 3 - arter Search for Vertex Cover II (8 min).mp410.37MB
  • MP417 Faster Exact Algorithms for NP-Complete Problems\\/17 - 4 - The Treling Salean Problem (15 min).mp421.00MB
  • MP417 Faster Exact Algorithms for NP-Complete Problems\\/17 - 5 - A Dynamic Programming Algorithm for TSP (12 min).mp417.45MB
  • MP418 Approxition Algorithms for NP-Complete Problems\\/18 - 1 - A Greedy Knapsack Heuristic (14 min).mp418.74MB
  • MP418 Approxition Algorithms for NP-Complete Problems\\/18 - 2 - Analysis of a Greedy Knapsack Heuristic I (7 min).mp48.93MB
  • MP418 Approxition Algorithms for NP-Complete Problems\\/18 - 3 - Analysis of a Greedy Knapsack Heuristic II (10 min).mp412.40MB
  • MP418 Approxition Algorithms for NP-Complete Problems\\/18 - 4 - A Dynamic Programming Heuristic for Knapsack (12 min).mp415.41MB
  • MP418 Approxition Algorithms for NP-Complete Problems\\/18 - 5 - Knapsack via Dynamic Programming Revisited (10 min).mp413.22MB
  • MP418 Approxition Algorithms for NP-Complete Problems\\/18 - 6 - Ananysis of Dynamic Programming Heuristic (15 min).mp418.70MB
  • MP419 Local Search Algorithms\\/19 - 1 - The ximum Cut Problem I (9 min).mp412.41MB
  • MP419 Local Search Algorithms\\/19 - 2 - The ximum Cut Problem II (9 min).mp412.84MB
  • MP419 Local Search Algorithms\\/19 - 3 - Principles of Local Search I (9 min).mp412.22MB
  • MP419 Local Search Algorithms\\/19 - 4 - Principles of Local Search II (10 min).mp414.49MB
  • MP419 Local Search Algorithms\\/19 - 5 - The 2-SAT Problem (15 min).mp419.64MB
  • MP419 Local Search Algorithms\\/19 - 6 - Random Walks on a Line (16 min).mp421.33MB
  • MP419 Local Search Algorithms\\/19 - 7 - Analysis of Papadimitriou-\s Algorithm (15 min).mp421.62MB
  • MP42 Selected Review From Part 1\\/2 - 1 - About the Course [Part I Review - Optional] (17 min).mp418.33MB
  • MP42 Selected Review From Part 1\\/2 - 2 - Why Study Algorithms- [Part I Review - Optional] (19 min).mp420.25MB
  • MP42 Selected Review From Part 1\\/2 - 3 - Guiding Principles for Analysis of Algorithms [Part I Review - Optional] (15 min).mp418.86MB
  • MP42 Selected Review From Part 1\\/2 - 4 - Big-Oh Notation [Part I Review - Optional] (4 min).mp44.36MB
  • MP42 Selected Review From Part 1\\/2 - 5 - Graph Representations [Part I Review - Optional] (14 min).mp414.48MB
  • MP42 Selected Review From Part 1\\/2 - 6 - Graph Search - Overview [Part I Review - Optional] (23 min).mp424.36MB
  • MP42 Selected Review From Part 1\\/2 - 7 - Dijkstra-\s Shortest-Path Algorithm [Part I Review - Optional] (21 min).mp421.92MB
  • MP42 Selected Review From Part 1\\/2 - 8 - Data Structures- Overview [Part I Review - Optional] (5 min).mp44.89MB
  • MP42 Selected Review From Part 1\\/2 - 9 - Heaps- Operations and Applications [Part I Review - Optional] (18 min).mp419.49MB
  • MP420 The Wider World of Algorithms\\/20 - 1 - Stable tching [Optional] (15 min).mp422.55MB
  • MP420 The Wider World of Algorithms\\/20 - 2 - tchings Flows and Braess-\s Paradox [Optional] (14 min).mp420.96MB
  • MP420 The Wider World of Algorithms\\/20 - 3 - Linear Programming and Beyond [Optional] (11 min).mp416.84MB
  • MP420 The Wider World of Algorithms\\/20 - 4 - Epilogue (1 min).mp41.79MB
  • MP43 Introduction to Greedy Algorithms\\/3 - 1 - Introduction to Greedy Algorithms (13 min).mp418.04MB
  • MP43 Introduction to Greedy Algorithms\\/3 - 2 - Application- Optil Caching (11 min).mp414.97MB
  • MP44 A Scheduling Application\\/4 - 1 - Problem Definition (6 min).mp47.79MB
  • MP44 A Scheduling Application\\/4 - 2 - A Greedy Algorithm (13 min).mp417.16MB
  • MP44 A Scheduling Application\\/4 - 3 - Correctness Proof - Part I (7 min).mp49.22MB
  • MP44 A Scheduling Application\\/4 - 4 - Correctness Proof - Part II (5 min).mp46.22MB
  • MP44 A Scheduling Application\\/4 - 5 - Handling Ties [Advanced - Optional] (7 min).mp49.65MB
  • MP45 Prim\s Minimum Spanning Tree Algorithm\\/5 - 1 - MST Problem Definition (11 min).mp415.00MB
  • MP45 Prim\s Minimum Spanning Tree Algorithm\\/5 - 2 - Prim-\s MST Algorithm (8 min).mp49.99MB
  • MP45 Prim\s Minimum Spanning Tree Algorithm\\/5 - 3 - Correctness Proof I (16 min).mp419.02MB
  • MP45 Prim\s Minimum Spanning Tree Algorithm\\/5 - 4 - Correctness Proof II (8 min).mp410.14MB
  • MP45 Prim\s Minimum Spanning Tree Algorithm\\/5 - 5 - Proof of Cut Property [Advanced - Optional] (12 min).mp414.99MB
  • MP45 Prim\s Minimum Spanning Tree Algorithm\\/5 - 6 - Fast Implementation I (15 min).mp419.66MB
  • MP45 Prim\s Minimum Spanning Tree Algorithm\\/5 - 7 - Fast Implementation II (10 min).mp413.17MB
  • MP46 Kruskals Minimum Spanning Tree Algorithm\\/6 - 1 - Kruskal-\s MST Algorithm (8 min).mp411.02MB
  • MP46 Kruskals Minimum Spanning Tree Algorithm\\/6 - 2 - Correctness of Kruskal-\s Algorithm (9 min).mp412.30MB
  • MP46 Kruskals Minimum Spanning Tree Algorithm\\/6 - 3 - Implementing Kruskal-\s Algorithm via Union-Find I (9 min).mp412.90MB
  • MP46 Kruskals Minimum Spanning Tree Algorithm\\/6 - 4 - Implementing Kruskal-\s Algorithm via Union-Find II (14 min).mp418.88MB
  • MP46 Kruskals Minimum Spanning Tree Algorithm\\/6 - 5 - MSTs- State-of-the-Art and Open Questions [Advanced - Optional] (9 min).mp414.23MB
  • MP47 Clustering\\/7 - 1 - Application to Clustering (12 min).mp415.13MB
  • MP47 Clustering\\/7 - 2 - Correctness of Clustering Algorithm (10 min).mp411.93MB
  • MP48 Advanced Union-Find\\/8 - 1 - Lazy Unions [Advanced - Optional] (10 min).mp415.24MB
  • MP48 Advanced Union-Find\\/8 - 2 - Union-by-Rank [Advanced - Optional] (12 min).mp418.19MB
  • MP48 Advanced Union-Find\\/8 - 3 - Analysis of Union-by-Rank [Advanced - Optional] (15 min).mp422.29MB
  • MP48 Advanced Union-Find\\/8 - 4 - Path Compression [Advanced - Optional] (15 min).mp421.51MB
  • MP48 Advanced Union-Find\\/8 - 5 - Path Compression- The Hopcroft-Ulln Analysis I [Advanced - Optional] (9 min).mp413.66MB
  • MP48 Advanced Union-Find\\/8 - 6 - Path Compression- The Hopcroft-Ulln Analysis II [Advanced - Optional] (12 min).mp417.17MB
  • MP48 Advanced Union-Find\\/8 - 7 - The Ackernn Function [Advanced - Optional] (17 min).mp422.64MB
  • MP48 Advanced Union-Find\\/8 - 8 - Path Compression- Tarjan-\s Analysis I [Advanced - Optional] (14 min).mp420.78MB
  • MP48 Advanced Union-Find\\/8 - 9 - Path Compression- Tarjan-\s Analysis II [Advanced - Optional] (14 min).mp419.09MB
  • MP49 Huffn Codes\\/9 - 1 - Introduction and Motivation (9 min).mp411.89MB
  • MP49 Huffn Codes\\/9 - 2 - Problem Definition (10 min).mp415.35MB
  • MP49 Huffn Codes\\/9 - 3 - A Greedy Algorithm (17 min).mp424.70MB
  • MP49 Huffn Codes\\/9 - 4 - A More Complex Example (4 min).mp45.51MB
  • MP49 Huffn Codes\\/9 - 5 - Correctness Proof I (10 min).mp413.30MB
  • MP49 Huffn Codes\\/9 - 6 - Correctness Proof II (13 min).mp416.75MB
Latest Search: 1.DV-268   2.MXSPS-290   3.ALD-476   4.SGCRS-036   5.BIB-041   6.TMGY-001   7.WED-054   8.LADY-089   9.RKI-171   10.SAK-8430   11.DVH-580   12.DVH-547   13.MIBD-756   14.URE-007   15.HMGL-077   16.MDJD-021   17.DVDES-440   18.YLW-4071   19.MNRI-002   20.MIBD-630   21.KIBD-100   22.RGD-247   23.ADV-0075   24.DVH-575   25.BIB-060   26.HITMA-108   27.SOE-725   28.ONSD-707   29.ONSD-381   30.RKI-239   31.IDBD-245   32.ELO-379   33.REAL-175   34.CEN-007   35.SW-127   36.DJSH-018   37.MIBD-584   38.DVH-415   39.MIBD-528   40.DJSF-123   41.BIB-048   42.WSP-032   43.HODV-20709   44.SMD-03   45.DVH-577   46.FRDVS-011   47.JUSD-339   48.YLW-4013   49.DOKS-224   50.KTKX-039   51.HKM-022   52.AAJB-008   53.QEDG-001   54.JUSD-445   55.YSN-369   56.YRZ-056   57.KBKD-112   58.SBB-125   59.OMGA-002   60.PPBB-02   61.UURU-98   62.YLW-4083   63.IFD-131   64.SAW-006   65.DDXX-003   66.SRB-004   67.SMM-003   68.IGEM-013   69.AEPP-030   70.OBST-020   71.268   72.290   73.476   74.036   75.041   76.001   77.054   78.089   79.171   80.8430   81.580   82.547   83.756   84.007   85.077   86.021   87.440   88.4071   89.002   90.630   91.100   92.247   93.0075   94.575   95.060   96.108   97.725   98.707   99.381   100.239   101.245   102.379   103.175   104.007   105.127   106.018   107.584   108.415   109.528   110.123   111.048   112.032   113.20709   114.03   115.577   116.011   117.339   118.4013   119.224   120.039   121.022   122.008   123.001   124.445   125.369   126.056   127.112   128.125   129.002   130.02   131.98   132.4083   133.131   134.006   135.003   136.004   137.003   138.013   139.030   140.020