- 2013 - Jamie Fairbrother (Lancaster): Statistical modelling of TV interference for shared-spectrum devices. (Internship Jan-Jun 2013)
- 2012 - Bo Ye (London South Bank): TV sensing for whitespace applications. (Internship Oct-Dec 2012)
- 2009 - Peter Tam (Birmingham): Optimal railway trip planning in the presence of known delay distributions. (Internship Oct-Dec 2009)
- 2006-8 - Linlin Song (QMUL): Random graph models for wireless networks - degree awarded 2010-05-31. Now working in China
- 2001 - Natasha Savage (UMIST): Random Boolean networks. Afterwards postdoc at Sheffield, Edinburgh, and Duke University
- 1996 - Tony Dixon (UWA): Feigenbaum scaling. Now working in Perth WA
- 2013 - Christopher Deeks (Warwick): Networks of Q-learners
- 2013 - Tadeo (Bath): Base-station subset selection for optimum radio coverage
- 2013 - Maria Constantinou (Bath): Tuning of rsync for optimum cloud storage performance
- 2012 - Manasi Phadnis (Bath): MAC layer Markov chains in wireless protocols
- 2012 - Dario Papavassiliou (Warwick): Phylogenetics of the early Germanic languages
- 2011 - Richard Perkins (Bath): UHF propagation over hills
- 2011 - Qilin Hu (York): Implementation of radio sensing algorithms (jointly supervised with Richard MacKenzie)
- 2011 - Benjamin Hu (York): Analysis and modelling of homehub propagation data
- 2011 - Sharon Bullimore (Warwick): Centralized and distributed graph
coloring using Briggs' theorem.
- 2010 - Steve Leonard (Bath): Geometry and statistics of the positional distribution of houses
- 2010 - James Evans (York): Distributed heuristics for graph coloring. Now working for Santander in Milton Keynes.
- 2009 - Dhruv Sethi (York): Trip planning subject to random delays
- 2008 - Costas Skarakis (York): Convex optimization - theory and practice. Now back in Greece.
- 2008 - Martin Tijmes (Twente): Optimization of wireless cities
- 2006 - Mark Harris (York): Analysis and modelling of train delay data
- 2005 - Ramasubramanian B (York): Geometric integrators
- 2005 - Alan Terry (York): Exponential random graphs. Completed a PhD at Surrey 2009. Now working on cancer modelling at Dundee University.
- 2004 - Min Chen (York): Mixing time of random walks on graphs. Now working in China.
- 2003 - Linlin Song (York): A distributed algorithm for the graph center problem. Proceeded to PhD at QMUL.
- 2000 - Shirley Tay: Efficient network topologies
- 2013 - Chenhao Li (Cambridge): Mobility prediction algorithms
- 2007 - Hong Xuan (Cambridge): Generalized Voronoi geometry
- 2006 - Andrew Ainsworth (Cambridge): WAP channel allocation
This website uses no cookies. This page was last modified 2013-05-19 15:45