Páidí Creed

Department of Computer Science
Royal Holloway, University of London
Egham,
Surrey, TW20 0EX
Email: paidi@cs.rhul.ac.uk

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 currrently employed as a post-doctoral researcher with Dave Cohen in the Computer Science department of Royal Holloway, University of London. I am a member of the Oxford/Royal Holloway Constraints 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 interested in the complexity of soft constraint languages, propagation algorithms for soft global constraints, structural complexity of constraint satisfaction problems, fixed-parameter algorithms, approximation algorithms, randomized algorithms for sampling and counting, combinatorial enumeration, and random graphs.

Teaching

Informatics 2B:Data Structures and Algorithms stream. (Teaching Assistant, Spring 2006,2007)
Link to Stack sorting applet here

Papers and preprints

1. Páidí Creed, Sampling Eulerian orientations of the triangle, Journal of Discrete Algorithms, 7(2), pages 168-180, 2009.
   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.
   
2. 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.
   
3. 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.
4. 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

• BCTCS 2009 at Warwick.
• 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.

Blogs, news, and opinions from Maths and TCS

• All you need to know from the world of Computational Complexity, courtesy of Lance Fortnow.
• The irreverent opinions of Doron Zeilberger.
• Scott Aaronson is Shtetl-Optimized.
• Luca Trevisan, In Theory.
• Richard Lipton has a very informative blog TCS.
• Theorem of the Day.

Academic

• Lists of conferences and events are maintained by CDAM, Tom Friedetzky, and Mohammad Farshi.
• TCS cheat sheet
• Some useful concentration of measure inequalities
• Computational complexity texts available online by Oded Goldreich and Sanjeev Arora & Boaz Barak.
• Ian Parberry's useful guides.