Formela seminars

Formela seminar series aims at building a solid background in specific areas of computer science and its mathematical foundations that are not covered to sufficient depth (or not covered at all) in other courses. The study material is presented both by the lecturer and the participating students. The emphasis is put on gaining a deep understanding of the material, which is verified by frequent questions and enforced by merciless feedback. The selection of topics may be different in every term. Examples from the past (which can be recovered upon request) include the following:

• Continuous-time Markov chains.
  Based on J.R. Norris: Markov Chains. Cambridge Series in Statistical and Probabilistic Mathematics, 1997.
• Measure theory.
  Based on J.S. Rosenthal: First Look at Rigorous Probability Theory. World Scientific Publishing Company, 2006.
• Markov Decision Processes with Perfect and Partial Information.
  Based on selected papers.
• Infinite state games.
  Based on selected papers.
• Queues and Queueing Networks.
  Based on G. Giambene. Queueing Theory and Telecommunications: Networks and Applications. Springer, 2005. and L. Lipsky. Queueing Theory: A Linear Algebraic Approach. Springer, 2009.
• Patrolling Games.
  Based on selected papers.
• Deep learning.
  Based on I. Goodfellow, Y. Bengio, A. Courville: Deep Learning. MIT Press, 2016.
• Logic and Automata.
  Based on selected papers.
• Fourier Transform.
  Based on M.W. Frazier: An Introduction to Wavelets Through Linear Algebra. Springer, 1999.
• SMT solving.
  Based on A.R. Bradley, Z. Manna: The Calculus of Computation. Springer, 2007.
• Program analysis.
  Based on selected papers.