- Proof Complexity and the P vs. NP ProblemNMAG536 | Faculty of Mathematics and Physics
- Selected Topics in Computational Complexity IINTIN086 | Faculty of Mathematics and Physics
- Selected Topics in Computational Complexity INTIN085 | Faculty of Mathematics and Physics
- Streaming algorithms for Big DataNTIN114 | Faculty of Mathematics and Physics
- Logic in Computer ScienceNMAI067 | Faculty of Mathematics and Physics
- New Keynesian DSGE ModellingJEM184 | Faculty of Social Sciences
- Boolean Function ComplexityNMAG457 | Faculty of Mathematics and Physics
- Seminar on Computational ComplexityNTIN050 | Faculty of Mathematics and Physics
- Selected Topics in Data StructuresNTIN110 | Faculty of Mathematics and Physics
- Crossing numbers of graphsNDMI099 | Faculty of Mathematics and Physics
- Parallel AlgorithmsNTIN017 | Faculty of Mathematics and Physics
- Combinatorics and Graph Theory 1NDMI011 | Faculty of Mathematics and Physics
- Introduction to Complexity and ComputabilityNTIN090 | Faculty of Mathematics and Physics
- Steganography and Digital MediaNMMB436 | Faculty of Mathematics and Physics
- Introduction to AlgorithmsNPRG062 | Faculty of Mathematics and Physics
- Discrete MathematicsNMIN105 | Faculty of Mathematics and Physics
- Algorithms and Data Structures 1NTIN060 | Faculty of Mathematics and Physics
- Electroweak Interactions IINJSF072 | Faculty of Mathematics and Physics
- Beyond Standard Model Physics INJSF139 | Faculty of Mathematics and Physics