Páidí Creed
Laboratory for Foundations of Computer ScienceSchool of Informatics
University of Edinburgh
Edinburgh,
Scotland
Email: p.creed@ed.ac.uk
Office phone: +44 (0) 131 650 6950
Biography
I graduated from University College Cork, Ireland with a degree in Computer Science in 2004. Following that I spent a year at the University of St. Andrews in Scotland studying mathematics before coming to Edinburgh to begin a PhD under the supervision of Mary Cryan. I am a member of the Algorithms and Complexity research group.
During my time at Cork I worked with James Little, Ken Brown, and Gene Freuder of the Cork Constraint Computation Centre, and with Michel Schellekens and Marc van Dongen of the Centre for Efficiency Oriented Languages.
Research
My research interests lie broadly in the area of Algorithms and Complexity. I am currently studying Markov chain algorithms, specifically for sampling structures defined on Eulerian graphs (Eulerian orientations and Eulerian tours). In general, I am interested in randomized algorithms, the problems of sampling and approximate counting, and the computational complexity of counting problems. Recently, I have become increasingly interested in random graphs.In the past I have been interested in constraint programming, game-tree search, multi-objective optimisation, and average-case analysis of algorithms.
Teaching
Informatics 2B:Data Structures and Algorithms stream. (Teaching Assistant, Spring 2006,2007)Link to Stack sorting applet here
Papers and preprints
- Páidí Creed, Sampling
Eulerian orientations of the triangular lattice, To appear in the
Journal of Discrete Algorithms
A preliminary version of this work appeared as an extended abstract in Proceedings of ACiD 2006: the 2nd Algorithms and Complexity in Durham workshop, Texts in Algorithmics, College Publications, 2006.
- Little J., Goyal S., Creed P., Berry S., Cokely D., Thermal Test
Scheduling Using Constraint Programming, Proceedings of INCOM
2006, Saint-Etienne, France, 2006. Received award for being
one of the best industrial papers presented at the conference.
- Kenneth N. Brown, James Little, Páidí J. Creed
and Eugene. C.
Freuder
Adversarial Constraint
Satisfaction by Game-tree Search, Proceedings ECAI 2004,
Valencia, Spain, pp151-155, 2004. Named as one of the 11
best papers accepted to the conference.
An earlier version of this paper appeared as Game based CSPs, in Proc. 2nd Intl Workshop on Multiparadigm Constraint Programming Languages at CP 2003. - Páidí Creed, Generating Functions and their
application to the Average-Case Time Complexity Analysis of
Algorithms,
Final Year Project Report, Department of Computer Science,
UCC, Ireland, March 23, 2004.
Supervisors: Michel Schellekens, Marc van Dongen,
(available as a
CEOL
technical report.
Links
Events I have attended or will be attending
- DIMAP Algorithms Day at the University of Warwick, 24th October 2008
- Bristol Summer School on Probabilistic Techniques in Computer Science, July 6-11 2008
- New Algorithmic Paradigms in Optimization Centro Stefano Franscini, Monte Verita, Ascona, Switzerland, June 22-28 2008
- Markov-chain Monte Carlo Methods at the Isaac Newton Institute for Mathematical Sciences, Cambridge, UK
- ICMS Workshop on Geometry and Algorithms in Heriot-Watt University, Edinburgh.
- ACiD'06 in Durham.
- LMS/EPSRC Short Course on Stochastic Stability, Large Deviations, and Coupling methods in Heriot-Watt University, Edinburgh.
- BCTCS 2006 in Swansea.