PhD Short Courses
The short courses are obligatory for first year students, but
second/third year students who have not already attended
the lectures for a particular topic are encouraged to attend
as well. In particular, if we offer short courses that have
not been offered before, all PhD students are strongly
encouraged to attend.
The short courses aim to introduce basic knowledge on important areas
in Computer Science. They are selected according to the research
interests of staff and PhD students. Even if your PhD topic does not
seem to be related to any particular course, it is still worth
attending ... it lies in the nature of research that it takes
unexpected turns.
Unless stated
otherwise, courses will take place Monday, 14-16, in Ben LT8. An
alternative slot is Wed, 16-18, in MA 119.
- Amy Furniss, Julien Lange, Frank Nebel, Daniela Petrisan will
talk about Untyped Lambda Calculus (Conversion Rules, Combinators,
Fixpoint Theorem, Expressiveness, Church-Rosser) and Typed Lambda
Calculus (Curry and Church calculus, Type Derivation, etc (tba)). 31
Jan, 7 Feb, 14 Feb, 21 Feb
- Rick Thomas: Introduction to Computational Complexity (Mon, 7 March)
- Fer-Jan de Vries: Infinitary Lambda Calculus (Mon, 14 March)
- Fer-Jan de Vries: Infinitary Lambda Calculus II (Mon, 28 March)
- Tadeusz Litak: Modal Logic (tba)
Unless stated otherwise, courses will take place Monday, 14-16, in Lib
SR or Wednesday 16-18, in MA 119:
- Fer-Jan de Vries: Rewriting (Wed, Feb 3)
If not stated otherwise Jose's course takes place Tuesday, 16-18, MA
119, starting Nov 10 (no course on Dec 1):
- Special long course: Introduction to
Category Theory by Jose Fiadeiro.
If not stated otherwise courses take place Monday, 15-17, MA 119:
- Nov 23, Nov 30: Thomas Erlebach: Approximation Algorithms.
- Nov 2: Rajeev Raman: Succinct Data Structures
- Oct 5: Rick Thomas: Introduction to Complexity Theory.
- Artur Boronat, Model-Driven Engineering: foundations, applications
and formal verification. Location: ENG LT1 10-12.
Courses start on October 20 (with Jose Fiadeiro) and take place Monday, 16-18, in AC LT (Oct 20, Oct 27, Nov 3, Nov 10, Nov 17, Nov 24, Dec 1, Dec 8).
- Jose Fiadeiro: Basic category theory
- Thomas Erlebach: Approximation algorithms
- Rick Thomas: An Introduction to Computability and Complexity
- Emilio Tuosto: Nominal Calculi
- Fer-Jan de Vries: Rewriting
- Reiko Heckel, Graph rewriting
- Alexander Kurz: Modal Logic
In contrast to the first semester we don't have a fixed location: even the time
may shift... due to room booking problems.
- Thomas Erlebach: Approximation algorithms [slides (pdf)]
Part 1 Date: 13:00-14:00
Wednesday 27-02-2008 Location:GP LTB
Part 2 Date: 10:00-11:00 Thursday 28-02-2008. Location: ENG LT2
- Rajeev Raman: Succinct data structure
Date: 13:00-15:00
Wednesday 05-03-2008: is this shifted time slot OK?
- Naila Rahman: Internal memory algorithms
Date: 12:00-14:00 Wednesday
12-03-2008 Location: ATT SB0.01
- easter break
- Shengxiang Yang: Evolutionary algorithms
Date: 12:00-14:00 Wednesday 23-04-2008 Location: ATT SB0.01
- Stanley Fung: Online algorithms
Date: 12:00-14:00 Wednesday 30-04-2008 Location: KE 526
Courses start on October 8 and take place Monday, 12-13, in Ben LT3
and Tuesday, 13-14, in CW 801. Roy Crole's 2nd lecture is moved from
Tuesday, 13-14 to Monday 16-17, in CW801.
- Fer-Jan de Vries, Rewriting
- Roy Crole, Denotational Semantics
- Artur Boronat, Rewriting Logic and Maude
- Alexander Kurz, Basic category theory
- Nick Bezhanishvili, Modal Logic
- Irek Ulidowski, Process algebra
- Emilio Tuosto, Pi-calculus
- Reiko Heckel, Graph rewriting
- Stephan Reiff-Marganiec, StPowla: Workflows, Policies and SoA
|
|