Algorithms, especially Algorithms for
counting and sampling; Random Structures; Learning theory;
Office hours: TBA,
semester 1 (in my office, IF 5.16)
and Data Structures 3rd-year course Autumn 2012.
Computer Programming: Skills and Concepts (CP): Autumn
For academic year 2012/13 I am overall Course Organiser for
the 4th year Honours programmes within Informatics. Year Guide here.
(past) PhD students
Creed, Counting and Sampling problems on Eulerian graphs
(2010). Now at Royal Holloway, University of London.
chains for sampling matchings (2008). Now at
I am originally from Dublin, and I did my undergraduate degree at
University College Dublin, graduating
with a BSc in Computer Science
and Mathematics in
1993. I returned to UCD for the 1994-1995 academic year to do an MSc
by research in Computer Science, supervised by
After that I spent four years at the University of Warwick doing
research for my PhD. At Warwick I was a member of the
Computational Complexity Group, working with
Between September 1999 and August 2001 I was a postdoc at the Center
for Basic Research in Computer Science
(BRICS) at the University of
Aarhus in Denmark. Between September 2001 and May 2003 I was a postdoc
with the Algorithms
and Complexity Group of the University of Leeds,
working on randomized algorithms with
Martin Dyer. Since July 2003 I have been a lecturer in
Informatics at Edinburgh.