"design of data structures" trang 9 - tải miễn phí từ tailieunhanh
Lecture Design and Analysis of Algorithms - Lecture 1: Introduction

Lecture Design and Analysis of Algorithms - Lecture 1: Introduction
6    50    0
Lecture Design and Analysis of Algorithms - Lecture 2: Divide and conquer

Lecture Design and Analysis of Algorithms - Lecture 2: Divide and conquer
7    88    0
Lecture Design and Analysis of Algorithms - Lecture 5: Amortization

Lecture Design and Analysis of Algorithms - Lecture 5: Amortization
7    54    0
Lecture Design and Analysis of Algorithms - Lecture 6: Randomized algorithms

Lecture Design and Analysis of Algorithms - Lecture 6: Randomized algorithms
7    81    0
Lecture Design and Analysis of Algorithms - Lecture 7: Skip Lists

Lecture Design and Analysis of Algorithms - Lecture 7: Skip Lists
33    81    0
Lecture Design and Analysis of Algorithms - Lecture 8: Hashing

Lecture Design and Analysis of Algorithms - Lecture 8: Hashing
8    89    0
Lecture Design and Analysis of Algorithms - Lecture 9: Augmentation

Lecture Design and Analysis of Algorithms - Lecture 9: Augmentation
7    64    0
Lecture Design and Analysis of Algorithms - Lecture 10: Dynamic programming

Lecture Design and Analysis of Algorithms - Lecture 10: Dynamic programming
7    111    0
Lecture Design and Analysis of Algorithms - Lecture 11: All-pairs shortest paths

Lecture Design and Analysis of Algorithms - Lecture 11: All-pairs shortest paths
8    51    0
Lecture Design and Analysis of Algorithms - Lecture 12: Greedy algorithms and minimum spanning tree

Lecture Design and Analysis of Algorithms - Lecture 12: Greedy algorithms and minimum spanning tree
7    90    0
Lecture Design and Analysis of Algorithms - Lecture 13: Network flow

Lecture Design and Analysis of Algorithms - Lecture 13: Network flow
20    65    0
Lecture Design and Analysis of Algorithms - Lecture 14A: Network flow & applications

Lecture Design and Analysis of Algorithms - Lecture 14A: Network flow & applications
19    86    0
Lecture Design and Analysis of Algorithms - Lecture 14B: Baseball Elimination

Lecture Design and Analysis of Algorithms - Lecture 14B: Baseball Elimination
3    92    0
Lecture Design and Analysis of Algorithms - Lecture 15: Linear Programming

Lecture Design and Analysis of Algorithms - Lecture 15: Linear Programming
8    88    0
Lecture Design and Analysis of Algorithms - Lecture 16: NP-Completeness

Lecture Design and Analysis of Algorithms - Lecture 16: NP-Completeness
9    64    0
Lecture Design and Analysis of Algorithms - Lecture 17: Approximation Algorithms

Lecture Design and Analysis of Algorithms - Lecture 17: Approximation Algorithms
8    58    0
Lecture Design and Analysis of Algorithms - Lecture 18: Fixed-Parameter Algorithms

Lecture Design and Analysis of Algorithms - Lecture 18: Fixed-Parameter Algorithms
7    67    0
Lecture Design and Analysis of Algorithms - Lecture 19: Distributed Algorithms (Part 1)

Lecture Design and Analysis of Algorithms - Lecture 19: Distributed Algorithms (Part 1)
85    105    1
Lecture Design and Analysis of Algorithms - Lecture 20: Distributed Algorithms (Part 2)

Lecture Design and Analysis of Algorithms - Lecture 20: Distributed Algorithms (Part 2)
88    94    0
Lecture Design and Analysis of Algorithms - Lecture 21: Cryptography: Hashing

Lecture Design and Analysis of Algorithms - Lecture 21: Cryptography: Hashing
4    63    0