Skip to content

Lokesh-0/AdvancedAlgorithms

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

26 Commits
 
 
 
 
 
 

Repository files navigation

CS600: Advanced Algorithms

  1. Course Info.

  2. Basic Data Structures.

  3. Sorting.

  4. Divide and Conquer.

  5. Matrix Data Structure and Algorithms.

    • Addition and multiplication [slides].

    • Dense and sparse matrix data structures [slides].

    • Fast matrix multiplication and Strassen algorithm [slides].

  6. Binary Trees.

  7. Priority Queues.

  8. Disjoint Sets.

  9. Graph Basics.

  10. Network Flow Problems.

    • Maximum flow problem [slides].

    • Ford-Fulkerson algorithm and Edmonds–Karp algorithm [slides].

    • Dinic's algorithm [slides].

    • Max-flow and min-cut [slides].

  11. Bipartite Graphs.

    • Testing bipartiteness [slides].

    • Maximum cardinality bipartite matching [slides].

    • Maximum weight bipartite matching [slides].

    • Stable marriage problem [slides].

  12. Dynamic Programming.

    • Fibonacci numbers.

    • Climbing stairs.

    • Longest common substring.

    • Edit distance.

    • Combinations of coins.

    • Knapsack.

  13. Strings.

    • Tries.

    • KMP algorithm.

  14. Randomized Algorithms.

    • Monte Carlo algorithms.

    • Concentration inequalities.

    • Pseudo random number generators.

    • Random shuffling.

    • Fingerprinting.

  15. Hashing.

    • Hash table.

    • Collision-resistant hash.

    • Locality sensitive hashing.

  16. Cryptographic Algorithms.

    • RSA algorithm.

    • Digital signature.

    • Homomorphic encryption.

  17. Blockchain.

About

Reference for Adv Algorithms

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published