Clearing 2010 Clearing 2010
return to top
return to top

Profile

Dr Paul Sant, Senior Lecturer in Computer Science

Paul Sant

Dr Paul Sant joined the department in September 2005 as a lecturer and he became a Senior Lecturer in September 2006.

Paul completed his PhD from King's College, London in 2003 with a thesis entitled "Algorithmics of edge-colouring pairs of 3-regular trees" and prior to this, a BSc. in Computer Science from the University of Liverpool (1999).

Research Interests

  • Graph Theory
  • Algorithm Design
  • Combinatorics and Discrete Mathematics
  • Bioinformatics

Recent publications

Combinatorics and Graph Theory
  • Alan Gibbons and Paul Sant, Binary Trees, Towers and colourings, Journal of Combinatorial Mathematics and Combinatorial Computing, submitted May 2008.
  • Paul Sant and Tim French, Trust
  • Alan Gibbons and Paul Sant, Binary Trees, Towers and Colourings, Proceedings of the International Workshop on Combinatorial Algorithms 2007, L. Brankovich, Y. Lin and W.F. Smyth (Eds), College Publications, ISBN 9781904987673, 2008.
  • Paul Sant and Carsten Maple, A Graph Theoretic Framework for Trust - Form Local to Global, Proceedings of Information Visualisation 2006 (IV06), IEEE Computer Society, 497-503, 2006.
  • Alan Gibbons and Paul Sant, Stringology and The Four Colour Problem of Planar Maps, String Algorithmics, Volume 2 (Texts in Algorithms), C. Illiopoulos and T. Lecroq (Eds.), King's College Publications, ISBN 0-9543006-4-5, 2004.
  • Alan Gibbons and Paul Sant, Rotation sequences and edge-colouring of binary tree pairs, Theoretical Computer Science, 326(1-3), pages 409-418, 2004.
  • Alan Gibbons and Paul Sant, Edge-colouring Pairs of Binary Trees: Towards a concise proof of the Four-Colour Theorem of Planar Maps, Lecture Notes in Computer Science, volume 2420, pages 25-29, K. Diks and W.Rytter (Eds.).
Grid Computing
  • Stelios Sotiriadis, Nik Bessis, Ye Huang, Paul Sant, Carsten Maple, Defining minimum requirements of inter-collaborated nodes by measuring the weight of node interactions', Proceedings of the International Conference on Complex, Intelligent and Software Intensive Systems, Krakow, Poland, February 15-18, 2010
Computer Security and Networking
  • Gregory Epiphaniou, Carsten Maple, Paul Sant, Matthew Reeves, Affects of Queuing Mechanisms on RTP Traffic. Comparative Analysis of Jitter, End-to-End Delay and Packet Loss, Proceedings of the ARES Conference, Krakow, Poland, February 15-18, 2010.
Data Compression
  • L. Gasieniec, R. Kolpakov, I. Potapov and P.Sant, Real-time traversal in grammar based compressed files, Proceedings of the Data Compression Conference 2005 (DCC2005), 2005.
Bioinformatics
  • Leszek Gasieniec, Cindy Y.Li, Paul Sant, Prudence W.H. Wong Efficient Probe Selection in Microarray Design. To appear at IEEE CIBCB 2006.
  • Paul Sant and Martyn Amos, Models of recombination in Ciliates, Computation in Cells and Tissues: Perspectives and Tools of Thought, R. Paton et al. (Eds.), Collected volume in the Natural Computing Series, pages 269-276, Springer-Verlag, 2004.

Administrative duties

  • Partner College Liason (Computing) - 2006/7)

Conference Organisation

  1. Co-organiser (along with Dr Raphael Clifford) of BAD'07
  2. Co-organiser (along with Dr Raphael Clifford) of BAD'08
  3. Co-organiser (along with Dr Raphael Clifford) of BAD'09

Extra Curricular activities

In his spare time Paul enjoys a large variety of sports including: competitive athletics, marathon running, football and swimming. He also regularly attends the gym.

Besides sporting activities Paul also enjoys reading, going to the theatre and watching opera.

Contact details

Dr Paul Sant, Department of Computer Science and Technology
T: 01582 743705

return to top