Create divide and conquer, dynamic programming, and greedy algorithms. Understand intractable problems, P vs NP and the use of integer programming solvers to tackle some of these problems. Course ...

Iteration Space Slicing: A technique used to decompose loop iterations into slices, enabling parallel execution by reducing interdependence among iterations. Dynamic Programming Algorithms in ...

The graph below shows the total number of publications each year in Probabilistic Programming and Inference Algorithms. References [1] On the hardness of analysing probabilistic programs .