Länksamling

Maila förslag på tillägg eller rättelser till popup-help@csc.kth.se!

Föreläsning 1

• Greedy Algorithm
• Huffman Coding
• Dynamic Programming
• Binomial Coefficient
• Pascal's Triangle
• Knapsack Problem
• Maximum Subarray Problem
• Longest Increasing Subsequence

Föreläsning 2

• Inga länkar.

Föreläsning 3

• Finite State Machine
• Knuth-Morris-Pratt String Matching Algorithm
• Trie (Prefix Tree)
• Suffix Tree
• Mark Nelson's Tutorial About Suffix Trees
• Ukkonen's Linear-Time Algorithm For Suffix Tree Creation
• Suffix Array
• Aho-Corasick Multiple String Matching Algorithm

Föreläsning 4

• Combinatorial Search
• Brute-Force Search
• Depth-First Search
• Eight Queens Puzzle
• Branch and Bound
• Meet-in-the-middle Attack On Block-Ciphers
• Bidirectional Search
• Uniform-Cost Search
• Best-First Search
• A* Search Algorithm

Föreläsning 5

• Graphs
• Glossary of Graph Theory
• Minimum Spanning Tree
• Kruskal's Algorithm
• Prim's Algorithm (actually Jarník's Algorithm)
• Heap
• Fibonacci Heap
• Topological Sorting
• Partial Order
• Linear Extension
• Strongly Connected Component
• Shortest Path Problem
• Dijkstra's Algorithm

Föreläsning 6

• The Bellman-Ford Algorithm
• Floyd-Warshall
• Johnson's Algorithm
• Connectivity In Graphs
• Eulerian Paths and Circuits
• Ford-Fulkerson

Föreläsning 7

• Regular Expression
• The Chomsky Hierarchy
• Context-Free Grammar
• Chomsky Normal Form
• More On Chomsky's Normal Form
• Backus-Naur Form
• Extended Backus-Naur Form
• Recursive Descent Parser
• The CYK Algorithm

Föreläsning 8

• Inga länkar.

Föreläsning 9

• Greatest Common Divisor
• Euklides algoritm
• Monoid
• Group
• Abelian Group
• Square-and-Multiply
• Ring
• Modular Arithmetic
• Equivalence Relation
• Coprime
• Extended Euclidean Algorithm
• Chinese Remainder Theorem
• Fermat's Little Theorem
• Beautiful Proof of Fermat's Little Theorem
• Euler's Totient Function
• Euler's Theorem
• Vandermonde Matrix

Föreläsning 10

• Permutation
• Binomial Coefficient
• Pascals Triangle
• Pascal's Pyramid
• Multinomial Coefficient
• Stirling Numbers of the Second Kind
• Bell Number
• Catalan Number
• Inclusion-Exclusion Principle

Föreläsning 11

• Determinant
• Cross product
• Singular Value Decomposition
• Orientation
• Orientability
• Triangle
• Simplex
• Polygon
• Picks Theorem
• Proof of Picks Theorem and Generalizations
• Circumscribe
• Point In Circle?
• Lattice
• Point In Polygon
• Closest Pair of Points Problem
• Convex Hull
• Convex Hull Algorithms
• Graham Scan

Föreläsning 12

• Inga länkar.